Decompositional Construction of Lyapunov Functions for Hybrid Systems

  • Jens Oehlerking
  • Oliver Theel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5469)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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
  3. 3.
    Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming, Series B 96, 293–320 (2003)MathSciNetCrossRefMATHGoogle Scholar
  4. 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. 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
  6. 6.
    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)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Vu, L., Liberzon, D.: Common Lyapunov functions for families of commuting nonlinear systems. Systems and Control Letters 54(5), 405–416 (2005)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    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)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)CrossRefMATHGoogle Scholar
  10. 10.
    Pettersson, S.: Analysis and Design of Hybrid Systems. PhD thesis, Chalmers University of Technology, Gothenburg (1999)Google Scholar
  11. 11.
    Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    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)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jens Oehlerking
    • 1
  • Oliver Theel
    • 1
  1. 1.Department of Computer ScienceCarl von Ossietzky University of OldenburgOldenburgGermany

Personalised recommendations