LQR with Tracking: A Zeroth-order Approach and Its Global Convergence
Zhaolin Ren, Aoxiao Zhong, Na Li

TL;DR
This paper extends the theoretical understanding of model-free LQR approaches to the more general tracking case with arbitrary targets, proposing a zeroth-order algorithm with proven global convergence.
Contribution
It introduces a zeroth-order policy gradient method for LQR tracking and proves its global convergence, expanding beyond zero-target LQR problems.
Findings
The LQR tracking problem has a favorable optimization landscape.
The proposed algorithm achieves global convergence.
Numerical simulations validate theoretical results.
Abstract
There has been substantial recent progress on the theoretical understanding of model-free approaches to Linear Quadratic Regulator (LQR) problems. Much attention has been devoted to the special case when the goal is to drive the state close to a zero target. In this work, we consider the general case where the target is allowed to be arbitrary, which we refer to as the LQR tracking problem. We study the optimization landscape of this problem, and show that similar to the zero-target LQR problem, the LQR tracking problem also satisfies gradient dominance and local smoothness properties. This allows us to develop a zeroth-order policy gradient algorithm that achieves global convergence. We support our arguments with numerical simulations on a linear system.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdaptive Dynamic Programming Control · Advanced Control Systems Optimization · Advanced Bandit Algorithms Research
