Data-driven distributionally robust MPC for constrained stochastic systems
Peter Coppens, Panagiotis Patrinos

TL;DR
This paper presents a data-driven distributionally robust model predictive control approach that adapts online, guarantees feasibility, and transitions from robust to certainty-equivalent control as more data becomes available.
Contribution
It introduces conic representable risk and a moment-based ambiguity set for tractable, adaptive control of stochastic systems with guarantees on recursive feasibility.
Findings
Control scheme is robust with limited data.
Converges to certainty-equivalent controller with more data.
Numerical experiment demonstrates effectiveness.
Abstract
In this paper we introduce a novel approach to distributionally robust optimal control that supports online learning of the ambiguity set, while guaranteeing recursive feasibility. We introduce conic representable risk, which is useful to derive tractable reformulations of distributionally robust optimization problems. Specifically, to illustrate the techniques introduced, we utilize risk measures constructed based on data-driven ambiguity sets, constraining the second moment of the random disturbance. In the optimal control setting, such moment-based risk measures lead to tractable optimal controllers when combined with affine disturbance feedback. Assumptions on the constraints are given that guarantee recursive feasibility. The resulting control scheme acts as a robust controller when little data is available and converges to the certainty equivalent controller when a large sample…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
