Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
Abstract
On broad classes of linear systems, the shortest experiments are almost as good as the best possible ones. For $n$ states and $m$ inputs, the shortest input sequences that support robust data-driven stabilization of every controllable plant have $mn+1$ steps with exact states and $m(n+1)$ with noisy states. We show that, when the spectral radius is bounded and the spectrum is well separated near the unit circle, these sequences tolerate a fixed fraction of the error level achievable by any exper...
Description / Details
On broad classes of linear systems, the shortest experiments are almost as good as the best possible ones. For states and inputs, the shortest input sequences that support robust data-driven stabilization of every controllable plant have steps with exact states and with noisy states. We show that, when the spectral radius is bounded and the spectrum is well separated near the unit circle, these sequences tolerate a fixed fraction of the error level achievable by any experiment, even one designed with full plant knowledge and allowed to use any finite duration. This constant-factor comparison can fail for slowly actuated systems. For with controllability depth , short experiments lose a factor of order , and duration of order is both necessary and sufficient to recover a fixed fraction of the optimal tolerance.
Source: arXiv:2610.02187v1 - http://arxiv.org/abs/2610.02187v1 PDF: https://arxiv.org/pdf/2610.02187v1 Original Link: http://arxiv.org/abs/2610.02187v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Oct 3, 2026
Mathematics
Mathematics
0