Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
Alexey Peregudin, Ngoc Tuan Dinh
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 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 A=I+hG with controllability depth ν2, short experiments lose a factor of order hν-1, and duration of order 1/h is both necessary and sufficient to recover a fixed fraction of the optimal tolerance.
Create a lesson
Related papers
Feasibility of Simultaneous Input-Output Constraints for Tracking in a Class of LTI Systems: Part I
Junhyeok Yoon, Heather Hussain, Anuradha M. Annaswamy
Decentralized Power-Optimal Coordination for Spacecraft Swarms Using Time-Varying Magnetorquer Actuation
Yuta Takahashi, Shin-ichiro Sakai
Local Consistency Does Not Guarantee Global Conservation: Auditing Zero-Shot Composition of Airway Flow Operators
Nichula Sathmith Wasalathilaka, Navodya Heshan Samarasinghe Dhanujaya Suraweera, Kevin Dawson et al.
A Dynamic Generalized Kalman Consensus Filter for Switching Sensor Networks
Tirthankar Chakraborty, Arnab Maity
Interactive Power Flow in the Browser
Samuel Talkington, Frederik Geth, Qian Zhang et al.
A two-stage approach to satellite constellation optimization: classical and QUBO formulations
Carlo Novara