Online optimal control with affine constraints

Y Li, S Das, N Li - Proceedings of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
This paper considers online optimal control with affine constraints on the states and actions
under linear dynamics with bounded random disturbances. The system dynamics and …

Online optimal control with linear dynamics and predictions: Algorithms and regret analysis

Y Li, X Chen, N Li - Advances in Neural Information …, 2019 - proceedings.neurips.cc
This paper studies the online optimal control problem with time-varying convex stage costs
for a time-invariant linear dynamical system, where a finite lookahead window of accurate …

Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit

Y Li, G Qu, N Li - IEEE Transactions on Automatic Control, 2020 - ieeexplore.ieee.org
This article considers online optimization with a finite prediction window of cost functions
and additional switching costs on the decisions. We study the fundamental limits of dynamic …

Online convex optimization with time-varying constraints and bandit feedback

X Cao, KJR Liu - IEEE Transactions on automatic control, 2018 - ieeexplore.ieee.org
In this paper, online convex optimization problem with time-varying constraints is studied
from the perspective of an agent taking sequential actions. Both the objective function and …

Best of both worlds in online control: Competitive ratio and policy regret

G Goel, N Agarwal, K Singh… - Learning for Dynamics …, 2023 - proceedings.mlr.press
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 …

Online optimization in dynamic environments: Improved regret rates for strongly convex problems

A Mokhtari, S Shahrampour… - 2016 IEEE 55th …, 2016 - ieeexplore.ieee.org
In this paper, we address tracking of a time-varying parameter with unknown dynamics. We
formalize the problem as an instance of online optimization in a dynamic setting. Using …

Constrained online convex optimization with feedback delays

X Cao, J Zhang, HV Poor - IEEE Transactions on Automatic …, 2020 - ieeexplore.ieee.org
In this article, we study constrained online convex optimization (OCO) in the presence of
feedback delays, where a decision maker chooses sequential actions without knowing the …

Adaptive regret for control of time-varying dynamics

P Gradu, E Hazan, E Minasyan - Learning for Dynamics …, 2023 - proceedings.mlr.press
We consider the problem of online control of systems with time-varying linear dynamics. To
state meaningful guarantees over changing environments, we introduce the metric of {\it …

Online gradient descent for linear dynamical systems

M Nonhoff, MA Müller - IFAC-PapersOnLine, 2020 - Elsevier
In this paper, online convex optimization is applied to the problem of controlling linear
dynamical systems. An algorithm similar to online gradient descent, which can handle time …

Using predictions in online optimization with switching costs: A fast algorithm and a fundamental limit

Y Li, G Qu, N Li - 2018 Annual American Control Conference …, 2018 - ieeexplore.ieee.org
This paper studies an online optimization problem with switching costs and a finite
prediction window. We propose a computationally efficient algorithm, Receding Horizon …