Abstract
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based reasoning to decompose hybrid automata into subgraphs, for which we then solve semidefinite optimization problems to obtain local Lyapunov functions. These local computations are made in a way that ensures that the family of local Lyapunov functions forms a global Lyapunov function, proving asymptotic stability of the system. The main advantages over standard LMI methods are 1) improved numerical stability due to smaller optimization problems, 2) the possibility of incremental construction of stable hybrid automata and 3) easier diagnosis of unstable parts of the automaton in case no Lyapunov function can be found.
This work was partly supported by the German Research Foundation (DFG) as part of the Transregional Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS), www.avacs.org .
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Johansson, M., Rantzer, A.: On the computation of piecewise quadratic Lyapunov functions. In: 36th IEEE Conference on Decision and Control (CDC), pp. 3515–3520 (1997)
Pettersson, S., Lennartson, B.: Stability and robustness for hybrid systems. In: 35th IEEE Conference on Decision and Control (CDC), pp. 1202–1207 (1996)
Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming, Series B 96, 293–320 (2003)
Prajna, S., Papachristodoulou, A.: Analysis of switched and hybrid systems – beyond piecewise quadratic models. In: 22nd American Control Conference (ACC) (2003)
Papachristodoulou, A., Prajna, S.: Analysis of non-polynomial systems using the sums of squares decomposition. Positive Polynomials in Control, 23–43 (2005)
Chatterjee, D., Liberzon, D.: Stability analysis of deterministic and stochastic switched systems via a comparison principle and multiple Lyapunov functions. SIAM Journal on Control and Optimization 45(1), 174–206 (2006)
Vu, L., Liberzon, D.: Common Lyapunov functions for families of commuting nonlinear systems. Systems and Control Letters 54(5), 405–416 (2005)
Cai, C., Teel, A.R., Goebel, R.: Smooth Lyapunov functions for hybrid systems part II: (pre)asymptotically stable compact sets. IEEE Transactions on Automatic Control 53(3), 734–748 (2008)
Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)
Pettersson, S.: Analysis and Design of Hybrid Systems. PhD thesis, Chalmers University of Technology, Gothenburg (1999)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)
Das, I., Dennis, J.: Normal-boundary intersection: a new method for generating the Pareto surface in multicriteria optimization problems. SIAM J. Optimization 8, 631–657 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oehlerking, J., Theel, O. (2009). Decompositional Construction of Lyapunov Functions for Hybrid Systems. In: Majumdar, R., Tabuada, P. (eds) Hybrid Systems: Computation and Control. HSCC 2009. Lecture Notes in Computer Science, vol 5469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00602-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-00602-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00601-2
Online ISBN: 978-3-642-00602-9
eBook Packages: Computer ScienceComputer Science (R0)