Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity
Abstract
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.
Cite
Text
Lin et al. "Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity." Neural Information Processing Systems, 2022.Markdown
[Lin et al. "Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity." Neural Information Processing Systems, 2022.](https://mlanthology.org/neurips/2022/lin2022neurips-boundedregret/)BibTeX
@inproceedings{lin2022neurips-boundedregret,
title = {{Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity}},
author = {Lin, Yiheng and Hu, Yang and Qu, Guannan and Li, Tongxin and Wierman, Adam},
booktitle = {Neural Information Processing Systems},
year = {2022},
url = {https://mlanthology.org/neurips/2022/lin2022neurips-boundedregret/}
}