Distributionally Robust Model Predictive Control with Total Variation Distance
Preprint
Abstract
This paper studies the problem of distributionally robust model predictive control (MPC) using total variation distance ambiguity sets. For a discrete-time linear system with additive disturbances, we provide a conditional value-at-risk reformulation of the MPC optimization problem that is distributionally robust in the expected cost and chance constraints. The distributionally robust chance constraint is over-approximated as a simpler, tightened chance constraint that reduces the computational burden. Numerical experiments support our results on probabilistic guarantees and computational efficiency.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Wasserstein Distributionally Robust Motion Control for Collision Avoidance Using Conditional Value-at-RiskIEEE Transactions on Robotics, 2021
- On distributionally robust chance constrained programs with Wasserstein distanceMathematical Programming, 2019
- Risk-Aware Motion Planning and Control Using CVaR-Constrained OptimizationIEEE Robotics and Automation Letters, 2019
- A Framework for Time-Consistent, Risk-Sensitive Model Predictive Control: Theory and AlgorithmsIEEE Transactions on Automatic Control, 2018
- Distributionally Robust Stochastic ProgrammingSIAM Journal on Optimization, 2017
- Stochastic Model Predictive Control: An Overview and Perspectives for Future ResearchIEEE Control Systems, 2016
- Distributionally Robust Control of Constrained Stochastic SystemsIEEE Transactions on Automatic Control, 2015
- A Probabilistic Particle-Control Approximation of Chance-Constrained Stochastic Predictive ControlIEEE Transactions on Robotics, 2010
- Convex Approximations of Chance Constrained ProgramsSIAM Journal on Optimization, 2007
- Coherent Measures of RiskMathematical Finance, 1999