mlsanityData to 7 Oct 2026

Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity

arXiv 2210.12312 ↗First posted 22 Oct 2022math.OCcited by 16

Not on the map. Why?

Abstract (arXiv)

We study Model Predictive Control (MPC) and propose a general analysis pipeline to bound its dynamic regret. The pipeline first requires deriving a perturbation bound for a finite-time optimal control problem. Then, the perturbation bound is used to bound the per-step error of MPC, which leads to a bound on the dynamic regret. Thus, our pipeline reduces the study of MPC to the well-studied problem of perturbation analysis, enabling the derivation of regret bounds of MPC under a variety of settings. To demonstrate the power of our pipeline, we use it to generalize existing regret bounds on MPC in linear time-varying (LTV) systems to incorporate prediction errors on costs, dynamics, and disturbances. Further, our pipeline leads to regret bounds on MPC in systems with nonlinear dynamics and constraints.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Oct 2022.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 5; 2024: 6; 2025: 2; 2026: 3.

16 papers.

Sort:

By area: