Computing Scaled Relative Graphs of Discrete-Time LTI Systems From Data
IEEE Control Systems Letters · 2026 · 10 · 841-846
DOI: 10.1109/lcsys.2026.3700680 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Control Systems Letters, 2026. Verfasst von Talitha Nauta und 1 weiteren Autor:innen. Gefördert von: ELLIIT Strategic Research Area.
Abstract (Originalsprache)
Graphical methods for system analysis have played a central role in control theory. The Scaled Relative Graph (SRG) has recently emerged as a useful tool for stability analysis of feedback interconnections. In this letter, we further extend its applicability by showing how the SRG of a discrete-time linear-time-invariant (LTI) system can be computed exactly from its state-space representation using linear matrix inequalities. We additionally propose a fully data-driven approach where we demonstrate how to compute the SRG exclusively from input-output data. Furthermore, we introduce a robust version of the SRG, which can be computed from noisy data trajectories and contains the SRG of the actual system.
Förderung
- ELLIIT Strategic Research Area
Zitieren
APA
Nauta, T., & Pates, R. (2026). Computing Scaled Relative Graphs of Discrete-Time LTI Systems From Data. IEEE Control Systems Letters, 10, 841-846. https://doi.org/10.1109/lcsys.2026.3700680
Vancouver
Nauta T, Pates R. Computing Scaled Relative Graphs of Discrete-Time LTI Systems From Data. IEEE Control Systems Letters. 2026;10:841-846. doi:10.1109/lcsys.2026.3700680
BibTeX
@article{Nauta2026,
author = {Nauta, Talitha and Pates, Richard},
title = {Computing Scaled Relative Graphs of Discrete-Time LTI Systems From Data},
journal = {IEEE Control Systems Letters},
year = {2026},
volume = {10},
pages = {841--846},
doi = {10.1109/lcsys.2026.3700680}
}
EUVIMED