On Path-Complete Lyapunov Functions: Geometry and Comparison

DOI10.1109/TAC.2018.2863380MaRDI QIDQ5223699zbMATH OpenOpenAlexFDO

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

Publication date 18 July 2019

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of mathematical programming (90C90) 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: We study optimization-based criteria for the stability of switching systems, known as Path-Complete Lyapunov Functions, and ask the question "can we decide algorithmically when a criterion is less conservative than another". Our contribution is twofold. First, we show that a Path-Complete Lyapunov Function, which is a multiple Lyapunov function by nature, can always be expressed as a common Lyapunov function taking the form of a combination of minima and maxima of the elementary functions that compose it. Geometrically, our results provide for each Path-Complete criterion an implied invariant set. Second, we provide a linear programming criterion allowing to compare the conservativeness of two arbitrary given Path-Complete Lyapunov functions.

Cited in

(8)

• On global exponential stability of discrete-time switching systems with dwell-time ranges: novel induced LMIs for linear systems with delays
• Graph-based conditions for feedback stabilization of switched and LPV systems
• Multiple Lyapunov functions and memory: a symbolic dynamics approach to systems and control
• Max-min Lyapunov functions for switched systems and related differential inclusions
• Characterization of the ordering of path-complete stability certificates with addition-closed templates
• Continuous-time switched systems with switching frequency constraints: path-complete stability criteria
• Comparison of path-complete Lyapunov functions via template-dependent lifts
• Computation of invariant sets for complex systems

This page was built for publication: On Path-Complete Lyapunov Functions: Geometry and Comparison

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