paper-with-me

Papers

Competitive Control

2021-07-28 · Gautam Goel, Babak Hassibi

We consider control from the perspective of competitive analysis. Unlike much prior work on learning-based control, which focuses on minimizing regret against the best controller selected in hindsight from some specific class, we focus on designing an online controller which competes against a clairvoyant offline optimal controller. A natural performance metric in this setting is competitive ratio, which is the ratio between the cost incurred by the online controller and the cost incurred by the offline optimal controller. Using operator-theoretic techniques from robust control, we derive a computationally efficient state-space description of the the controller with optimal competitive ratio in both finite-horizon and infinite-horizon settings. We extend competitive control to nonlinear systems using Model Predictive Control (MPC) and present numerical experiments which show that our competitive controller can significantly outperform standard $H_2$ and $H_{\infty}$ controllers in the MPC setting.

📄 PDF Abstract BibTeX arXiv:2107.13657

Code (0)

등록된 구현이 없습니다.

Tasks

Model Predictive Control

Similar Papers 제목 키워드 기반

Optimal Competitive-Ratio Control

2022-06-03 · Oron Sabag, Sahin Lale, Babak Hassibi

Inspired by competitive policy designs approaches in online learning, new control paradigms such as competitive-ratio and regret-optimal control have been recently proposed as alternatives to the classical $\mathcal{H}_2…

Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret

2022-11-21 · Gautam Goel, Naman Agarwal, Karan Singh, Elad Hazan

We consider the fundamental problem of online control of a linear dynamical system from two different viewpoints: regret minimization and competitive analysis. We prove that the optimal competitive policy is well-approxi…

Online Optimization with Memory and Competitive Control

2020-02-13 · NeurIPS 2020 12 · Guanya Shi, Yiheng Lin, Soon-Jo Chung, Yisong Yue 외

This paper presents competitive algorithms for a novel class of online optimization problems with memory. We consider a setting where the learner seeks to minimize the sum of a hitting cost and a switching cost that depe…

Robustness and Consistency in Linear Quadratic Control with Untrusted Predictions

2021-06-17 · NeurIPS 2021 12 · Tongxin Li, Ruixiao Yang, Guannan Qu, Guanya Shi 외

We study the problem of learning-augmented predictive linear quadratic control. Our goal is to design a controller that balances \textit{"consistency"}, which measures the competitive ratio when predictions are accurate,…

Smoothed Online Optimization for Regression and Control

2018-10-23 · Gautam Goel, Adam Wierman

We consider Online Convex Optimization (OCO) in the setting where the costs are $m$-strongly convex and the online learner pays a switching cost for changing decisions between rounds. We show that the recently proposed O…

regression