Path-complete graphs and common Lyapunov functions

DOI10.1145/3049797.3049817MaRDI QIDQ5275321zbMATH OpenOpenAlexFDO

Authors Nikolaos Athanasopoulos, Raphaël M. Jungers, 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, https://pure.qub.ac.uk/en/publications/pathcomplete-graphs-and-common-lyapunov-functions(857dc4c5-c94f-4e83-88f8-455ab95a8772).html

zbMATH Keywords

discrete-time switching systemsLyapunov functionobserver automatonpath-complete graphs

Mathematics Subject Classification ID

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

Abstract: A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate for discrete-time switching systems under arbitrary switching. In this paper, we prove that the satisfiability of such a criterion implies the existence of a Common Lyapunov Function, expressed as the composition of minima and maxima of the pieces of the Path-Complete Lyapunov function. The converse, however, is not true even for discrete-time linear systems: we present such a system where a max-of-2 quadratics Lyapunov function exists while no corresponding Path-Complete Lyapunov function with 2 quadratic pieces exists. In light of this, we investigate when it is possible to decide if a Path-Complete Lyapunov function is less conservative than another. By analyzing the combinatorial and algebraic structure of the graph and the pieces respectively, we provide simple tools to decide when the existence of such a Lyapunov function implies that of another.

Recommendations

• Comparison of path-complete Lyapunov functions via template-dependent lifts
• Joint spectral radius and path-complete graph Lyapunov functions
• On the existence and construction of common Lyapunov functions for switched discrete systems
• Analysis of the joint spectral radius via Lyapunov functions on path-complete graphs
• Two conditions concerning common quadratic Lyapunov functions for linear systems

Cited in

(8)

• Comparison of path-complete Lyapunov functions via template-dependent lifts
• On the need for switched-gain observers for non-monotonic nonlinear systems
• \(p\)-dominant switched linear systems
• A graph-theoretic approach to the method of global Lyapunov functions
• A complete characterization of the ordering of path-complete methods
• Joint spectral radius and path-complete graph Lyapunov functions
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5275321)