Published June 21, 2022
| Accepted Version
Journal Article
Open
Distributionally Robust Model Predictive Control With Total Variation Distance
Abstract
This letter 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.
Additional Information
© 2022 IEEE. Manuscript received 21 March 2022; revised 15 May 2022; accepted 4 June 2022. Date of publication 21 June 2022; date of current version 30 June 2022. This work was supported in part by DARPA through the Subterranean Challenge Program and in part by the California Institute of Technology.Attached Files
Accepted Version - 2203.12062.pdf
Files
2203.12062.pdf
Files
(530.1 kB)
Name | Size | Download all |
---|---|---|
md5:2a67f9af4fbaf2b618f07a316a111311
|
530.1 kB | Preview Download |
Additional details
- Eprint ID
- 115714
- Resolver ID
- CaltechAUTHORS:20220721-7911000
- Defense Advanced Research Projects Agency (DARPA)
- Caltech
- Created
-
2022-07-22Created from EPrint's datestamp field
- Updated
-
2022-07-22Created from EPrint's last_modified field