A direct optimization algorithm for input-constrained MPC
Liang Wu, Richard D. Braatz

TL;DR
This paper introduces a novel, data-independent optimization algorithm for input-constrained MPC that guarantees worst-case execution time, enabling reliable real-time control in embedded systems.
Contribution
It proposes a cost-free, data-independent initialization method for interior-point algorithms, removing the need for feasible starting points in input-constrained MPC.
Findings
Algorithm's iteration count depends only on problem dimension
The method provides exact iteration bounds, not worst-case estimates
Numerical validation confirms execution time certification
Abstract
Providing an execution time certificate is a pressing requirement when deploying Model Predictive Control (MPC) in real-time embedded systems such as microcontrollers. Real-time MPC requires that its worst-case (maximum) execution time must be theoretically guaranteed to be smaller than the sampling time in closed-loop. This technical note considers input-constrained MPC problems and exploits the structure of the resulting box-constrained QPs. Then, we propose a \textit{cost-free} and \textit{data-independent} initialization strategy, which enables us, for the first time, to remove the initialization assumption of feasible full-Newton interior-point algorithms. We prove that the number of iterations of our proposed algorithm is \textit{only dimension-dependent} (\textit{data-independent}), \textit{simple-calculated}, and \textit{exact} (not \textit{worst-case}) with the value…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Control Systems Optimization · Interconnection Networks and Systems · Parallel Computing and Optimization Techniques
