59.7OCMay 20
Scaled Graph Bounding Techniques for Reset SystemsTimo de Groot, Maurice Heemels, Tom Oomen et al.
Reset systems can overcome fundamental limitations of linear time-invariant control. The recently introduced notion of scaled (relative) graphs provides a promising framework for developing graphical analysis and design tools for reset systems, in line with widely adopted loopshaping methods for linear systems. The aim of this paper is to derive techniques for over-bounding the scaled graph of reset systems, and obtain insights in their accuracy. We exploit connections between quadratic dissipativity and scaled graphs to recast the over-bounding problem as the search for piecewise quadratic storage functions. Using specific sampling techniques, we reveal a fundamental limitation of general scaled graph approximation methods that are based on quadratic dissipativity.
87.5OCApr 2
Scaled Relative Graphs and Dynamic Integral Quadratic Constraints: Connections and Computations for Nonlinear SystemsTimo de Groot, Tom Oomen, W. P. M. H. Heemels et al.
Scaled relative graphs (SRGs) enable graphical analysis and design of nonlinear systems. In this paper, we present a systematic approach for computing both soft and hard SRGs of nonlinear systems using dynamic integral quadratic constraints (IQCs). These constraints are exploited via application of the S-procedure to compute tractable SRG overbounds. In particular, we show that the multipliers associated with the IQCs define regions in the complex plane. Soft SRG computations are formulated through frequency-domain conditions, while hard SRGs are obtained via hard factorizations of multipliers and linear matrix inequalities. The overbounds are used to derive an SRG-based feedback stability result for Lur'e-type systems, providing a new graphical interpretation of classical IQC stability results with dynamic multipliers.