Performance Bounds of Model Predictive Control for Unconstrained and Constrained Linear Quadratic Problems and Beyond
Not on the map. Why?
Abstract (arXiv)
We study unconstrained and constrained linear quadratic problems and investigate the suboptimality of the model predictive control (MPC) method applied to such problems. Considering MPC as an approximate scheme for solving the related fixed point equations, we derive performance bounds for the closed-loop system under MPC. Our analysis, as well as numerical examples, suggests new ways of choosing the terminal cost and terminal constraints, which are not related to the solution of the Riccati equation of the original problem. The resulting method can have a larger feasible region, and cause hardly any loss of performance in terms of the closed-loop cost over an infinite horizon.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Nov 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.
- 2025Synthesis of Model Predictive Control and Reinforcement Learning: Survey and Classificationcited by 19
- 2024Model Predictive Control and Reinforcement Learning: A Unified Framework Based on Dynamic Programmingcited by 5
- 2023Suboptimality analysis of receding horizon quadratic control with unknown linear systems and its applications in learning-based controlcited by 1
- 2025Synthesis of Model Predictive Control and Reinforcement Learning: Survey and Classification4 Feb 2025
- 2024Model Predictive Control and Reinforcement Learning: A Unified Framework Based on Dynamic Programming2 Jun 2024
- 2023Suboptimality analysis of receding horizon quadratic control with unknown linear systems and its applications in learning-based control19 Jan 2023