Online Convex Optimization for Robust Control of Constrained Dynamical Systems

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article investigates the problem of controlling linear time-invariant systems subject to time-varying and a priori unknown cost functions, state and input constraints, and exogenous disturbances. We combine the online convex optimization framework with tools from robust model predictive control to propose an algorithm that is able to guarantee robust constraint satisfaction. The performance of the closed loop emerging from application of our framework is studied in terms of its dynamic regret, which is proven to be bounded linearly by the variation of the cost functions and the magnitude of the disturbances. We corroborate our theoretical findings and illustrate implementational aspects of the proposed algorithm by a numerical case study on a tracking control problem of an autonomous vehicle.

Cite

CITATION STYLE

APA

Nonhoff, M., Dall’anese, E., & Muller, M. A. (2026). Online Convex Optimization for Robust Control of Constrained Dynamical Systems. IEEE Transactions on Automatic Control, 71(6), 3543–3558. https://doi.org/10.1109/TAC.2025.3641731

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free