An online convex optimization algorithm for controlling linear systems with state and input constraints
arXiv:2005.11308 · doi:10.23919/ACC50511.2021.9482877
Abstract
This paper studies the problem of controlling linear dynamical systems subject to point-wise-in-time constraints. We present an algorithm similar to online gradient descent, that can handle time-varying and a priori unknown convex cost functions while restraining the system states and inputs to polytopic constraint sets. Analysis of the algorithm's performance, measured by dynamic regret, reveals that sublinear regret is achieved if the variation of the cost functions is sublinear in time. Finally, we present a simple example to illustrate implementation details as well as the algorithm's performance and show that the proposed algorithm ensures constraint satisfaction.
6 pages; Final version, accepted for publication in Proc. of the 2021 American Control Conference (ACC)
References in corpus (5)
- Timescale Separation in Autonomous Optimization
- Online Control with Adversarial Disturbances
- Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis
- Online Gradient Descent for Linear Dynamical Systems
- An Iterative Riccati Algorithm for Online Linear Quadratic Control