lie brackets and stability of switched systems daniel
play

LIE BRACKETS AND STABILITY OF SWITCHED SYSTEMS Daniel Liberzon - PowerPoint PPT Presentation

LIE BRACKETS AND STABILITY OF SWITCHED SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign Happy 60 th birthday, Eduardo! 1 of 22 SWITCHED SYSTEMS


  1. LIE BRACKETS AND STABILITY OF SWITCHED SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign Happy 60 th birthday, Eduardo! 1 of 22

  2. SWITCHED SYSTEMS Switched system: • is a family of systems • is a switching signal Switching can be: • State-dependent or time-dependent • Autonomous or controlled Details of discrete behavior are “abstracted away” Discrete dynamics classes of switching signals Properties of the continuous state : stability 2 of 22

  3. STABILITY ISSUE unstable Asymptotic stability of each subsystem is not sufficient for stability 3 of 22

  4. GLOBAL UNIFORM ASYMPTOTIC STABILITY GUAS is Lyapunov stability plus asymptotic convergence GUES: 4 of 22

  5. COMMUTING STABLE MATRICES => GUES (commuting Hurwitz matrices) For subsystems – similarly 5 of 22

  6. COMMUTING STABLE MATRICES => GUES Alternative proof: ∃ quadratic common Lyapunov function [ Narendra–Balakrishnan ’94 ] . . . is a common Lyapunov function 6 of 22

  7. LIE ALGEBRAS and STABILITY Lie algebra: Lie bracket: is nilpotent if s.t. U is solvable if s.t. Nilpotent means suff. high-order Lie brackets are 0 e.g. Nilpotent GUES [ Gurvits ’95 ] 7 of 22

  8. SOLVABLE LIE ALGEBRA => GUES Lie’s Theorem: is solvable triangular form Example: exponentially fast exp fast 0 diagonal ∃ quadratic common Lyap fcn [ L–Hespanha–Morse ’99 ], see also [ Kutepov ’82 ] 8 of 22

  9. MORE GENERAL LIE ALGEBRAS Levi decomposition: radical (max solvable ideal) • is compact (purely imaginary eigenvalues) GUES, quadratic common Lyap fcn • is not compact not enough info in Lie algebra: There exists one set of stable generators for which gives rise to a GUES switched system, and another which gives an unstable one [ Agrachev–L ’01 ] 9 of 22

  10. SUMMARY: LINEAR CASE Lie algebra w.r.t. Assuming GES of all modes, GUES is guaranteed for: • commuting subsystems: • nilpotent Lie algebras (suff. high-order Lie brackets are 0) e.g. • solvable Lie algebras (triangular up to coord. transf.) • solvable + compact (purely imaginary eigenvalues) Quadratic common Lyapunov function exists in all these cases Extension based only on the Lie algebra is not possible 10 of 22

  11. SWITCHED NONLINEAR SYSTEMS Lie bracket of nonlinear vector fields: Reduces to earlier notion for linear vector fields (modulo the sign) 11 of 22

  12. SWITCHED NONLINEAR SYSTEMS • Commuting systems GUAS Can prove by trajectory analysis [ Mancilla-Aguilar ’00 ] or common Lyapunov function [ Shim et al. ’98, Vu–L ’05 ] • Linearization (Lyapunov’s indirect method) • Global results beyond commuting case – ? [Unsolved Problems in Math. Systems and Control Theory, ’04] 12 of 22

  13. SPECIAL CASE globally asymptotically stable Want to show: is GUAS Will show: differential inclusion is GAS 13 of 22

  14. OPTIMAL CONTROL APPROACH Associated control system: where (original switched system ) Worst-case control law [Pyatnitskiy, Rapoport, Boscain, Margaliot] : fix and small enough 14 of 22

  15. MAXIMUM PRINCIPLE (along optimal trajectory) Optimal control: is linear in (unless ) at most 1 switch GAS 15 of 22

  16. GENERAL CASE Want: polynomial of degree (proof – by induction on ) bang-bang with switches GAS See [Margaliot–L ’06] for details; also [ Sharon–Margaliot ’07 ] 16 of 22

  17. REMARKS on LIE-ALGEBRAIC CRITERIA • Checkable conditions • In terms of the original data • Independent of representation • Not robust to small perturbations In any neighborhood of any pair of matrices there exists a pair of matrices generating the entire Lie algebra [ Agrachev–L ’01 ] How to capture closeness to a “nice” Lie algebra? 17 of 22

  18. [Agrachev–Baryshnikov–L ’10] ROBUST CONDITIONS compact set of Hurwitz matrices GUES: Lie algebra: Levi decomposition: ( solvable, semisimple) Switched transition matrix splits as where and Let and robust condition but GUES not constructive 18 of 22

  19. [Agrachev–Baryshnikov–L ’10] ROBUST CONDITIONS compact set of Hurwitz matrices GUES: Lie algebra: Levi decomposition: ( solvable, semisimple) Switched transition matrix splits as where and Let and more conservative but GUES easier to verify There are also intermediate conditions 19 of 22

  20. [Agrachev–Baryshnikov–L ’10] ROBUST CONDITIONS Levi decomposition: Switched transition matrix splits as Previous slide: small GUES But we also know: compact Lie algebra (not nec. small) GUES Cartan decomposition: ( compact subalgebra) Transition matrix further splits: where and Let GUES 20 of 22

  21. [Agrachev–Baryshnikov–L ’10] ROBUST CONDITIONS Levi decomposition: Cartan decomposition: GUES Example: 21 of 22

  22. CONCLUSIONS • Discussed a link between Lie algebra structure and stability under arbitrary switching • Linear story is rather complete, nonlinear results are still preliminary • Focus of current work is on stability conditions robust to perturbations of system data 22 of 22

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend