Necessary and Sufficient Conditions for Template-Dependent Ordering of Path-Complete Lyapunov Methods
From MaRDI portal
Publication:6120707
DOI10.1145/3501710.3519539OpenAlexW4225399887MaRDI QIDQ6120707
Virginie Debauche, Raphaël M. Jungers, Matteo Della Rossa
Publication date: 21 February 2024
Published in: 25th ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/7228432
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- Stability of discrete-time switching systems with constrained switching sequences
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
- Switching in systems and control
- Nonquadratic Lyapunov functions for robust control
- Continuous-time switched systems with switching frequency constraints: path-complete stability criteria
- Comparison of path-complete Lyapunov functions via template-dependent lifts
- Smooth Lyapunov functions and robustness of stability for difference inclusions
- Multiple Lyapunov functions and other analysis tools for switched and hybrid systems
- A new class of universal Lyapunov functions for the control of uncertain linear systems
- Stability and Stabilizability of Switched Linear Systems: A Survey of Recent Results
- A complete characterization of the ordering of path-complete methods
- Path-Complete Graphs and Common Lyapunov Functions
- Stability Criteria for Switched and Hybrid Systems
- Joint Spectral Radius and Path-Complete Graph Lyapunov Functions
- Convex Analysis