全変動距離を用いた分布ロバストモデル予測制御
Distributionally Robust Model Predictive Control with Total Variation Distance
全変動距離の曖昧性集合を用い、期待コストとチャンス制約に対して分布ロバストなMPCをCVaR定式化で解き、計算負荷を抑える近似を提案した論文。
著者: Anushri Dixit, Mohamadreza Ahmadi, Joel W. Burdick
分類: eess.SY, cs.RO, cs.SY, math.OC
原文アブストラクト
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.
