Online Optimal Tracking of Linear Systems with Adversarial Disturbances
Abstract
This paper presents a memory-augmented control solution to the optimal reference tracking problem for linear systems subject to adversarial disturbances. We assume that the dynamics of the linear system are known and that the reference signal is generated by a linear system with unknown dynamics. Under these assumptions, finding the optimal tracking controller is formalized as an online convex optimization problem that leverages memory of past disturbance and reference values to capture their temporal effects on the performance. That is, a (disturbance, reference)-action control policy is formalized, which selects the control actions as a linear map of the past disturbance and reference values. The online convex optimization is then formulated over the parameters of the policy on its past disturbance and reference values to optimize general convex costs. It is shown that our approach outperforms robust control methods and achieves a tight regret bound O(√T) where in our regret analysis, we have benchmarked against the best linear policy.
Cite
Text
Yaghmaie and Modares. "Online Optimal Tracking of Linear Systems with Adversarial Disturbances." Transactions on Machine Learning Research, 2023.Markdown
[Yaghmaie and Modares. "Online Optimal Tracking of Linear Systems with Adversarial Disturbances." Transactions on Machine Learning Research, 2023.](https://mlanthology.org/tmlr/2023/yaghmaie2023tmlr-online/)BibTeX
@article{yaghmaie2023tmlr-online,
title = {{Online Optimal Tracking of Linear Systems with Adversarial Disturbances}},
author = {Yaghmaie, Farnaz Adib and Modares, Hamidreza},
journal = {Transactions on Machine Learning Research},
year = {2023},
url = {https://mlanthology.org/tmlr/2023/yaghmaie2023tmlr-online/}
}