Search arXiv⌕ Search

arXiv · 2610.02187

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 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 $ν\ge2$, 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexey Peregudin, Ngoc Tuan Dinh. 2026-10-01. Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration. https://arxiv.org/abs/2610.02187

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Mixed Bernstein-Fourier Approximants for Optimal Trajectory Generation with Periodic Behavior

Efficient trajectory generation is crucial for autonomous systems; however, current numerical methods often struggle to handle periodic behaviors effectively, particularly when the onboard sensors require equidistant temporal sampling. This paper introduces a novel mixed Bernstein-Fourier approximation framework tailored explicitly for optimal motion planning. Our proposed methodology leverages the uniform convergence properties of Bernstein polynomials for nonperiodic behaviors while effectively capturing periodic dynamics through the Fourier series. Theoretical results are established, including uniform convergence proofs for approximations of functions, derivatives, and integrals, as well as detailed error bound analyses. We further introduce a regulated least squares approach for determining approximation coefficients, enhancing numerical stability and practical applicability. Within an optimal control context, we establish the feasibility and consistency of approximated solutions to their continuous counterparts. We also extend the covector mapping theorem, providing theoretical guarantees for approximating dual variables crucial in verifying the necessary optimality conditions from Pontryagin's Maximum Principle. Numerical examples illustrate the method's superior performance, demonstrating substantial improvements in computational efficiency and precision in scenarios with complex periodic constraints and dynamics. Our mixed Bernstein-Fourier methodology thus presents a robust, theoretically grounded, and computationally efficient approach for advanced optimal trajectory planning in autonomous systems.

eess.SY↗

Emulation-based Neuromorphic Control for the Stabilization of LTI Systems

Neuromorphic engineering aims at designing computing and control systems inspired by the neurons and the brain. For the control community, neuromorphic control is an emerging topic that focuses on designing event-based spiking controllers in the form of spiking neural networks (SNNs). At present, systematic methods for designing and analyzing such controllers are lacking. Therefore in this paper we present a systematic approach for stabilizing linear time-invariant (LTI) systems using SNN-based controllers, in the form of a network of integrate-and-fire neurons, whose input is the measured output from the plant, and which generate spiking control signals. The new approach consists of a two-step emulation-based design procedure. In the first step, we establish conditions on the neuron parameters to ensure that the spiky signal generated by a pair of neurons emulates any continuous-time signal input to the neurons with arbitrary accuracy in terms of a special metric for spiky signals. In the second step, we propose a novel stability notion, called spiky-Input-to-State Stability (sISS) building on this metric, and prove that an asymptotically stable LTI system has this sISS property. By combining these steps, a certifiable practical stability property of the closed-loop system can be established. The approach is illustrated in a numerical case study.

eess.SY↗

Overlapping Covariance Intersection: Fusion with Partial Structural Knowledge of Correlation from Multiple Sources

Emerging large-scale engineering systems rely on distributed fusion for situational awareness, where agents combine noisy local sensor measurements with exchanged information to obtain fused estimates. However, at the sheer scale of these systems, tracking cross-correlations becomes infeasible, preventing the use of optimal filters. Covariance intersection (CI) methods address fusion problems with unknown correlations by minimizing worst-case uncertainty based on available information. Existing CI extensions exploit limited correlation knowledge but cannot incorporate structural knowledge of correlation from multiple sources, which naturally arises in distributed fusion problems. This paper introduces Overlapping Covariance Intersection (OCI), a generalized CI framework that accommodates this novel information structure. We formalize the OCI problem and establish necessary and sufficient conditions for feasibility. We show that a family-optimal solution can be computed efficiently via semidefinite programming, enabling real-time implementation. The proposed tools enable improved fusion performance for large-scale systems while retaining robustness to unknown correlations.

eess.SY↗