Data-Driven Estimation of Structured Singular Values
Estimating the size of the modeling error is crucial for robust control. Over the years, numerous metrics have been developed to quantify the model error in a control relevant manner. One of the most important such metrics is the structured singular value, as it leads to necessary and sufficient conditions for ensuring stability and robustness in feedback control under structured model uncertainty. Although the computation of the structured singular value is often intractable, lower and upper bounds for it can often be obtained if a model of the system is known. In this paper, we introduce a fully data-driven method to estimate a lower bound for the structured singular value, by conducting experiments on the system and applying power iterations to the collected data. Our numerical simulations demonstrate that this method effectively lower bounds the structured singular value, yielding results comparable to those obtained using the Robust Control toolbox of MATLAB.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Impact of Estimation Errors of a Matrix of Transfer Functions onto Its Analytic Singular Values and Their Potential Algorithmic Extraction
A matrix of analytic functions A(z), such as the matrix of transfer functions in a multiple-input multiple-output (MIMO) system, generally admits an analytic singular value decomposition (SVD), where the singular values …
On Dynamic Mode Decomposition of Control-affine Systems
This paper builds on the theoretical foundations for dynamic mode decomposition (DMD) of control-affine dynamical systems by leveraging the theory of vector-valued reproducing kernel Hilbert spaces (RKHSs). Specifically,…
Koopman AutoEncoder via Singular Value Decomposition for Data-Driven Long-Term Prediction
The Koopman autoencoder, a data-driven technique, has gained traction for modeling nonlinear dynamics using deep learning methods in recent years. Given the linear characteristics inherent to the Koopman operator, contro…
PredictionTime SeriesError Estimation for Sketched SVD via the Bootstrap
In order to compute fast approximations to the singular value decompositions (SVD) of very large matrices, randomized sketching algorithms have become a leading approach. However, a key practical difficulty of sketching …
Error Estimation for Sketched SVD
In order to compute fast approximations to the singular value decompositions (SVD) of very large matrices, randomized sketching algorithms have become a leading approach. However, a key practical difficulty of sketching …