Distributionally Robust Model Predictive Control with Total Variation Distance
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Mar 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 2.
2 papers.