SYLGOCFeb 15, 2024

Predictive Linear Online Tracking for Unknown Targets

arXiv:2402.10036v312 citationsh-index: 14Has CodeICML
Originality Incremental advance
AI Analysis

This addresses the challenge of tracking moving targets with unknown dynamics in real-time control applications, representing an incremental advance with practical hardware validation.

The paper tackles the problem of online tracking for unknown, non-stationary targets in linear control systems by proposing the PLOT algorithm, which achieves a dynamic regret scaling of O(√(TV_T)) and is successfully implemented on a real quadrotor.

In this paper, we study the problem of online tracking in linear control systems, where the objective is to follow a moving target. Unlike classical tracking control, the target is unknown, non-stationary, and its state is revealed sequentially, thus, fitting the framework of online non-stochastic control. We consider the case of quadratic costs and propose a new algorithm, called predictive linear online tracking (PLOT). The algorithm uses recursive least squares with exponential forgetting to learn a time-varying dynamic model of the target. The learned model is used in the optimal policy under the framework of receding horizon control. We show the dynamic regret of PLOT scales with $\mathcal{O}(\sqrt{TV_T})$, where $V_T$ is the total variation of the target dynamics and $T$ is the time horizon. Unlike prior work, our theoretical results hold for non-stationary targets. We implement PLOT on a real quadrotor and provide open-source software, thus, showcasing one of the first successful applications of online control methods on real hardware.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes