On performance bound estimation in NMPC with time-varying terminal cost
Lukas Beckenbach, Stefan Streif

TL;DR
This paper develops a method to estimate and improve the performance bounds of nonlinear MPC with time-varying terminal costs by using decay rates and adaptive techniques, enhancing stability and efficiency.
Contribution
It introduces a novel scheme for performance bound estimation in time-varying NMPC using decay analysis and adaptive terminal cost adjustment.
Findings
Performance bounds can be dynamically estimated and improved.
Adaptive terminal cost enhances control performance.
Method demonstrated successfully in a case study.
Abstract
Model predictive control (MPC) schemes are commonly designed with fixed, i.e., time-invariant, horizon length and cost functions. If no stabilizing terminal ingredients are used, stability can be guaranteed via a sufficiently long horizon. A suboptimality index can be derived that gives bounds on the performance of the MPC law over an infinite-horizon (IH). While for time-invariant schemes such index can be computed offline, less attention has been paid to time-varying strategies with adapting cost function which can be found, e.g., in learning-based optimal control. This work addresses the performance bounds of nonlinear MPC with stabilizing horizon and time-varying terminal cost. A scheme is proposed that uses the decay of the optimal finite-horizon cost and convolutes a history stack to predict the bounds on the IH performance. Based on online information on the decay rate, the…
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 · Adaptive Dynamic Programming Control · Iterative Learning Control Systems
