Papers › Minimax Adaptive Control for a Finite Set of Linear Systems
Minimax Adaptive Control for a Finite Set of Linear Systems
Anders Rantzer
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
An adaptive controller with bounded l2-gain from disturbances to errors is derived for linear time-invariant systems with uncertain parameters restricted to a finite set. The gain bound refers to the closed loop system, including the non-linear learning procedure. As a result, robustness to unmodelled dynamics (possibly nonlinear and infinite-dimensional) follows from the small gain theorem. The approach is based on a new zero-sum dynamic game formulation, which optimizes the trade-off between exploration and exploitation. An explicit upper bound on the optimal value function is stated in terms of semi-definite programming and a corresponding simple formula for an adaptive controller achieving the upper bound is given. Once the uncertain parameters have been sufficiently estimated, the controller behaves like standard H-infinity optimal control.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections