Regret-optimal Estimation and Control

06/22/2021
by   Gautam Goel, et al.
4

We consider estimation and control in linear time-varying dynamical systems from the perspective of regret minimization. Unlike most prior work in this area, we focus on the problem of designing causal estimators and controllers which compete against a clairvoyant noncausal policy, instead of the best policy selected in hindsight from some fixed parametric class. We show that the regret-optimal estimator and regret-optimal controller can be derived in state-space form using operator-theoretic techniques from robust control and present tight,data-dependent bounds on the regret incurred by our algorithms in terms of the energy of the disturbances. Our results can be viewed as extending traditional robust estimation and control, which focuses on minimizing worst-case cost, to minimizing worst-case regret. We propose regret-optimal analogs of Model-Predictive Control (MPC) and the Extended KalmanFilter (EKF) for systems with nonlinear dynamics and present numerical experiments which show that our regret-optimal algorithms can significantly outperform standard approaches to estimation and control.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2020

Regret-optimal control in dynamic environments

We consider the control of linear time-varying dynamical systems from th...
research
05/04/2021

Regret-Optimal Full-Information Control

We consider the infinite-horizon, discrete-time full-information control...
research
11/14/2022

Follow the Clairvoyant: an Imitation Learning Approach to Optimal Control

We consider control of dynamical systems through the lens of competitive...
research
02/26/2021

A Regret Minimization Approach to Iterative Learning Control

We consider the setting of iterative learning control, or model-based po...
research
10/09/2019

Robust Monopoly Regulation

We study the regulation of a monopolistic firm using a robust-design app...
research
04/13/2023

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

This paper proposes a distributionally robust approach to regret optimal...
research
10/24/2021

Online estimation and control with optimal pathlength regret

A natural goal when designing online learning algorithms for non-station...

Please sign up or login with your details

Forgot password? Click here to reset