Performance analysis for cone-preserving switched systems with constrained switching
The work provides a unifying theoretical framework for performance analysis of a broad class of switched systems, benefiting control theorists and engineers working on systems with switching constraints.
This paper presents performance analysis conditions for cone-preserving linear discrete-time switched systems with constrained switching, generalizing known results for stability and performance analysis of switched and positive switched systems. It also provides novel ℓ1-performance analysis conditions for positive switched systems with constrained switching, demonstrated with a numerical example.
This paper studies cone-preserving linear discrete-time switched systems whose switching is governed by an automaton. For this general system class, we present performance analysis conditions for a broadly usable performance measure. In doing so, we generalize several known results for performance and stability analysis for switched and positive switched systems, providing a unifying perspective. We also arrive at novel $\ell_1$-performance analysis conditions for positive switched systems with constrained switching, for which we present an application-motivated numerical example. Further, the cone-preserving perspective provides insights into appropriate Lyapunov function selection.