Online Nonstochastic Control with Convex Safety Constraints
arXiv:2501.18039
Abstract
This paper considers the online nonstochastic control problem of a linear time-invariant system under convex state and input constraints that need to be satisfied at all times. We propose an algorithm called Online Gradient Descent with Buffer Zone for Convex Constraints (OGD-BZC), designed to handle scenarios where the system operates within general convex safety constraints. We demonstrate that OGD-BZC, with appropriate parameter selection, satisfies all the safety constraints under bounded adversarial disturbances. Additionally, to evaluate the performance of OGD-BZC, we define the regret with respect to the best safe linear policy in hindsight. We prove that OGD-BZC achieves regret given proper parameter choices. Our numerical results highlight the efficacy and robustness of the proposed algorithm.
22 pages, 2 figures, accepted in American Control Conference(ACC) 2025