Pith. sign in

REVIEW 1 cited by

Predictive Linear Online Tracking for Unknown Targets

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.10036 v3 pith:NZDSVZIT submitted 2024-02-15 eess.SY cs.LGcs.SYmath.OC

classification eess.SYcs.LGcs.SYmath.OC
keywords controlonlinetargettrackinglinearplotalgorithmdynamic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret

    cs.LG 2025-05 conditional novelty 6.0 of 10

    For unknown non-explosive linear Gaussian systems, the OPF algorithm with per-coordinate forgetting achieves O(log³ N) regret against the Kalman filter, improving over the prior O(log⁶ N) bound.

Pith tools