Path-Complete Graphs and Common Lyapunov Functions

DOI10.1145/3049797.3049817zbMath1369.93565arXiv1612.03983OpenAlexW2562075274MaRDI QIDQ5275321

Raphaël M. Jungers, Nikolaos Athanasopoulos, Matthew Philippe, David Angeli

Publication date: 11 July 2017

Published in: Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

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

zbMATH Keywords

Lyapunov functionpath-complete graphsdiscrete-time switching systemsobserver automaton

Mathematics Subject Classification ID

Lyapunov and storage functions (93D30) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (4)

On the need for switched-gain observers for non-monotonic nonlinear systems ⋮ \(p\)-dominant switched linear systems ⋮ Necessary and Sufficient Conditions for Template-Dependent Ordering of Path-Complete Lyapunov Methods ⋮ Characterization of the ordering of path-complete stability certificates with addition-closed templates

This page was built for publication: Path-Complete Graphs and Common Lyapunov Functions