Data driven stability analysis of black-box switched linear systems

From MaRDI portal
Publication:2280933

DOI10.1016/J.AUTOMATICA.2019.108533zbMATH Open1429.93266arXiv1803.03687OpenAlexW2969264971WikidataQ127346736 ScholiaQ127346736MaRDI QIDQ2280933FDOQ2280933


Authors: Joris Kenanian, Raphaël M. Jungers, Ayça Balkan, Paulo Tabuada Edit this on Wikidata


Publication date: 19 December 2019

Published in: Automatica (Search for Journal in Brave)

Abstract: Can we conclude the stability of an unknown dynamical system from the knowledge of a finite number of snapshots of trajectories? We tackle this black-box problem for switched linear systems. We show that, for any given random set of observations, one can give probabilistic stability guarantees. The probabilistic nature of these guarantees implies a trade-off between their quality and the desired level of confidence. We provide an explicit way of computing the best stability-like guarantee, as a function of both the number of observations and the required level of confidence. Our proof techniques rely on geometrical analysis, chance-constrained optimization, and stability analysis tools for switched systems, including the joint spectral radius.


Full work available at URL: https://arxiv.org/abs/1803.03687




Recommendations




Cites Work


Cited In (10)

Uses Software





This page was built for publication: Data driven stability analysis of black-box switched linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280933)