Beyond inherent robustness: strong stability of MPC despite plant-model mismatch
In this technical report, we establish the asymptotic stability of MPC under plant-model mismatch for problems where the origin remains a steady state despite mismatch. This class of problems includes, but is not limited to, inventory management, path-planning, and control of systems in deviation variables. Our results differ from prior results on the inherent robustness of MPC, which guarantee only convergence to a neighborhood of the origin, the size of which scales with the magnitude of the mismatch. For MPC with quadratic costs, continuous differentiability of the system dynamics is sufficient to demonstrate exponential stability of the closed-loop system despite mismatch. For MPC with general costs, a joint comparison function bound and scaling condition guarantee asymptotic stability despite mismatch. The results are illustrated in numerical simulations, including the classic upright pendulum problem. The tools developed to establish these results can address the stability of offset-free MPC, an open and interesting question in the MPC research literature.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On sparse connectivity, adversarial robustness, and a novel model of the artificial neuron
Deep neural networks have achieved human-level accuracy on almost all perceptual benchmarks. It is interesting that these advances were made using two ideas that are decades old: (a) an artificial neuron based on a linea…
Adversarial RobustnessComputational EfficiencyMathFM-IRL: Flow-Matching for Reward Modeling and Policy Regularization in Reinforcement Learning
Flow Matching (FM) has shown remarkable ability in modeling complex distributions and achieves strong performance in offline imitation learning for cloning expert behaviors. However, despite its behavioral cloning expres…
Reinforcement LearningThe Price of Robustness: Stable Classifiers Need Overparameterization
The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for fin…
Beyond Robustness: Resilience Verification of Tree-Based Classifiers
In this paper we criticize the robustness measure traditionally employed to assess the performance of machine learning models deployed in adversarial settings. To mitigate the limitations of robustness, we introduce a ne…
Learning Aligned Stability in Neural ODEs Reconciling Accuracy with Robustness
Despite Neural Ordinary Differential Equations (Neural ODEs) exhibiting intrinsic robustness, existing methods often impose Lyapunov stability for formal guarantees. However, these methods still face a fundamental accura…