TY - GEN
T1 - Polyhedral Path-Complete Lyapunov Functions
AU - Athanasopoulos, Nikolaos
AU - Jungers, Raphael M.
PY - 2020/3/12
Y1 - 2020/3/12
N2 - 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).
AB - 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).
U2 - 10.1109/CDC40024.2019.9029905
DO - 10.1109/CDC40024.2019.9029905
M3 - Conference contribution
BT - 2019 IEEE 58th Conference on Decision and Control (CDC)
PB - Institute of Electrical and Electronics Engineers Inc.
ER -