A Distributionally Robust Approach to Regret Optimal Control using the Wasserstein Distance

被引:6
作者
Al Taha, Feras [1 ]
Yan, Shuhao [1 ]
Bitar, Eilyan [1 ]
机构
[1] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14853 USA
来源
2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC | 2023年
基金
加拿大自然科学与工程研究理事会;
关键词
OPTIMIZATION; DESIGN;
D O I
10.1109/CDC49753.2023.10384311
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes a distributionally robust approach to regret optimal control of discrete-time linear dynamical systems with quadratic costs subject to a stochastic additive disturbance on the state process. The underlying probability distribution of the disturbance process is unknown, but assumed to lie in a given ball of distributions defined in terms of the type-2 Wasserstein distance. In this framework, strictly causal linear disturbance feedback controllers are designed to minimize the worst-case expected regret. The regret incurred by a controller is defined as the difference between the cost it incurs in response to a realization of the disturbance process and the cost incurred by the optimal noncausal controller which has perfect knowledge of the disturbance process realization at the outset. Building on a well-established duality theory for optimal transport problems, we derive a reformulation of the minimax regret optimal control problem as a tractable semidefinite program. Using the equivalent dual reformulation, we characterize a worst-case distribution achieving the worstcase expected regret in relation to the distribution at the center of theWasserstein ball. We compare the minimax regret optimal control design method with the distributionally robust optimal control approach using an illustrative example and numerical experiments.
引用
收藏
页码:2768 / 2775
页数:8
相关论文
共 30 条
[1]  
Abbasi-Yadkori Y., 2011, COLT, P1
[2]   DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization [J].
Ahmadi, Amir Ali ;
Majumdar, Anirudha .
SIAM JOURNAL ON APPLIED ALGEBRA AND GEOMETRY, 2019, 3 (02) :193-230
[3]   System level synthesis [J].
Anderson, James ;
Doyle, John C. ;
Low, Steven H. ;
Matni, Nikolai .
ANNUAL REVIEWS IN CONTROL, 2019, 47 :364-393
[4]   Quantifying Distributional Model Risk via Optimal Transport [J].
Blanchet, Jose ;
Murthy, Karthyek .
MATHEMATICS OF OPERATIONS RESEARCH, 2019, 44 (02) :565-600
[5]   Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems [J].
Bubeck, Sebastien ;
Cesa-Bianchi, Nicolo .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01) :1-122
[6]  
Coppens P, 2020, PR MACH LEARN RES, V120, P521
[7]  
Dean S, 2018, ADV NEUR IN, V31
[8]   A System Level Approach to Regret Optimal Control [J].
Didier, Alexandre ;
Sieber, Jerome ;
Zeilinger, Melanie N. .
IEEE CONTROL SYSTEMS LETTERS, 2022, 6 :2792-2797
[9]   Linear minimax regret estimation of deterministic parameters with bounded data uncertainties [J].
Eldar, YC ;
Ben-Tal, A ;
Nemirovski, A .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2004, 52 (08) :2177-2188
[10]   A competitive minimax approach to robust estimation of random parameters [J].
Eldar, YC ;
Merhav, N .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2004, 52 (07) :1931-1946