Polyhedral Path-Complete Lyapunov Functions

Nikolaos Athanasopoulos, Raphael M. Jungers

Research output: Chapter in Book/Report/Conference proceedingConference contribution

48 Downloads (Pure)

Abstract

Path-complete methods utilize a set of positive definite functions and a specially constructed graph in order to evaluate, among others, stability of switching systems. This tool is shown to be general, e.g., path-complete criteria are universal for linear switching systems and quadratic templates. In this work, we extend the approach to polyhedral Lyapunov functions, and introduce a simple parameterization that can be sufficient for stability analysis. Moreover, we indicate ways of obtaining less conservative stability criteria by partial graph extensions, all evaluated by solving Linear Programs (LPs).
Original languageEnglish
Title of host publication2019 IEEE 58th Conference on Decision and Control (CDC)
Publisher IEEE
DOIs
Publication statusPublished - 12 Mar 2020

Publication series

Name
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Fingerprint

Dive into the research topics of 'Polyhedral Path-Complete Lyapunov Functions'. Together they form a unique fingerprint.

Cite this