SearcharxivSearch

arXiv subjects

Jordan Leung

Publications and source records attributed to Jordan Leung.

4 recordsLinked to original sources

FIRE-GNN: Force-informed, Relaxed Equivariance Graph Neural Network for Rapid and Accurate Prediction of Surface Properties

The work function and cleavage energy of a surface are critical properties that determine the viability of materials in electronic emission applications, semiconductor devices, and heterogeneous catalysis. While first principles calculations are accurate in predicting these properties, their computational expense combined with the vast search space of surfaces make a comprehensive screening approach with density functional theory (DFT) infeasible. Here, we introduce FIRE-GNN (Force-Informed, Relaxed Equivariance Graph Neural Network), which integrates surface-normal symmetry breaking and machine learning interatomic potential (MLIP)-derived force information, achieving a twofold reduction in mean absolute error (down to 0.065 eV) over the previous state-of-the-art for work function prediction. We additionally benchmark recent invariant and equivariant architectures, analyze the impact of symmetry breaking, and evaluate out-of-distribution generalization, demonstrating that FIRE-GNN consistently outperforms competing models for work function predictions. This model enables accurate and rapid predictions of the work function and cleavage energy across a vast chemical space and facilitates the discovery of materials with tuned surface properties

cond-mat.mtrl-sci

Reference Governor for Input-Constrained MPC to Enforce State Constraints at Lower Computational Cost

In this paper, a control scheme is developed based on an input constrained Model Predictive Controller (MPC) and the idea of modifying the reference command to enforce constraints, usual of Reference Governors (RG). The proposed scheme, referred to as the RGMPC, requires optimization for MPC with input constraints for which fast algorithms exist, and can handle (possibly nonlinear) state and input constraints. Conditions are given that ensure recursive feasibility of the RGMPC scheme and finite-time convergence of the modified command to the the desired reference command. Simulation results for a spacecraft rendezvous maneuver with linear and nonlinear constraints demonstrate that the RGMPC scheme has lower average computational time as compared to state and input constrained MPC with similar performance.

eess.SY

A Computationally Governed Log-domain Interior-point Method for Model Predictive Control

This paper introduces a computationally efficient approach for solving Model Predictive Control (MPC) reference tracking problems with state and control constraints. The approach consists of three key components: First, a log-domain interior-point quadratic programming method that forms the basis of the overall approach; second, a method of warm-starting this optimizer by using the MPC solution from the previous timestep; and third, a computational governor that bounds the suboptimality of the warm-start by altering the reference command provided to the MPC problem. As a result, the closed-loop system is altered in a manner so that MPC solutions can be computed using fewer optimizer iterations per timestep. In a numerical experiment, the computational governor reduces the worst-case computation time of a standard MPC implementation by 90, while maintaining good closed-loop performance.

math.OC

An Analysis of Closed-Loop Stability for Linear Model Predictive Control Based on Time-Distributed Optimization

Time-distributed Optimization (TDO) is an approach for reducing the computational burden of Model Predictive Control (MPC). When using TDO, optimization iterations are distributed over time by maintaining a running solution estimate and updating it at each sampling instant. In this paper, TDO applied to input constrained linear MPC is studied in detail, and analytic expressions for the system gains and a bound on the number of optimization iterations per sampling instant required to guarantee closed-loop stability is derived. Further, it is shown that the closed-loop stability of TDO-based MPC can be guaranteed using multiple mechanisms including increasing the number of solver iterations, preconditioning the optimal control problem, adjusting the MPC cost matrices, and reducing the length of the receding horizon. These results in a linear system setting also provide insights and guidelines that could be more broadly applicable, e.g., to nonlinear MPC.

math.OC