Skip to Main content Skip to Navigation
Conference papers

Path-Complete Lyapunov Functions for Continuous-Time Switching Systems

Abstract : We use a graph-theory-based argument to propose a novel Lyapunov construction for continuous-time switching systems. Starting with a finite family of continuously differentiable functions, the inequalities involving these functions and the vector fields of the switching system are encoded in a direct and labeled graph. Relaying on the (path-)completeness of this graph, we introduce a signal-dependent Lyapunov function, providing sufficient conditions for stability under fixed-time or dwell-time switching hypothesis. For the case of linear systems, our conditions turn into linear matrix inequalities (LMI), and thus they are compared with previous results, via numerical examples .
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Matteo Della Rossa <>
Submitted on : Monday, October 19, 2020 - 11:57:10 AM
Last modification on : Wednesday, June 9, 2021 - 10:00:20 AM
Long-term archiving on: : Wednesday, January 20, 2021 - 6:34:34 PM


Files produced by the author(s)



Matteo Della Rossa, Mirko Pasquini, David Angeli. Path-Complete Lyapunov Functions for Continuous-Time Switching Systems. 59th Conference on Decision and Control (CDC) 2020, Dec 2020, Jeju Island (virtual conference), South Korea. ⟨10.1109/CDC42340.2020.9304192⟩. ⟨hal-02971179⟩



Record views


Files downloads