Decompositional Construction of Lyapunov Functions for Hybrid Systems
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.
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 2.Pettersson, S., Lennartson, B.: Stability and robustness for hybrid systems. In: 35th IEEE Conference on Decision and Control (CDC), pp. 1202–1207 (1996)Google Scholar
- 4.Prajna, S., Papachristodoulou, A.: Analysis of switched and hybrid systems – beyond piecewise quadratic models. In: 22nd American Control Conference (ACC) (2003)Google Scholar
- 5.Papachristodoulou, A., Prajna, S.: Analysis of non-polynomial systems using the sums of squares decomposition. Positive Polynomials in Control, 23–43 (2005)Google Scholar
- 10.Pettersson, S.: Analysis and Design of Hybrid Systems. PhD thesis, Chalmers University of Technology, Gothenburg (1999)Google Scholar