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

lie brackets and stability of switched systems daniel
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 1

1 of 22

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 60th birthday, Eduardo!

slide-2
SLIDE 2

2 of 22

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”

: stability

Properties of the continuous state Discrete dynamics classes of switching signals

slide-3
SLIDE 3

3 of 22

STABILITY ISSUE

unstable

Asymptotic stability of each subsystem is not sufficient for stability

slide-4
SLIDE 4

4 of 22

GLOBAL UNIFORM ASYMPTOTIC STABILITY

GUAS is Lyapunov stability plus asymptotic convergence GUES:

slide-5
SLIDE 5

5 of 22

COMMUTING STABLE MATRICES => GUES

For subsystems – similarly (commuting Hurwitz matrices)

slide-6
SLIDE 6

6 of 22

. . . quadratic common Lyapunov function

[Narendra–Balakrishnan ’94]

COMMUTING STABLE MATRICES => GUES

Alternative proof: is a common Lyapunov function

slide-7
SLIDE 7

7 of 22

LIE ALGEBRAS and STABILITY

U

Nilpotent means suff. high-order Lie brackets are 0

e.g.

is nilpotent if s.t. is solvable if s.t. Lie algebra: Lie bracket: Nilpotent GUES [Gurvits ’95]

slide-8
SLIDE 8

8 of 22

SOLVABLE LIE ALGEBRA => GUES

Example: quadratic common Lyap fcn

diagonal exponentially fast exp fast

[L–Hespanha–Morse ’99], see also [Kutepov ’82]

Lie’s Theorem: is solvable triangular form

slide-9
SLIDE 9

9 of 22

MORE GENERAL LIE ALGEBRAS

Levi decomposition:

radical (max solvable ideal)

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]

  • is compact (purely imaginary eigenvalues)

GUES, quadratic common Lyap fcn

  • is not compact

not enough info in Lie algebra:

slide-10
SLIDE 10

10 of 22

SUMMARY: LINEAR CASE

Extension based only on the Lie algebra is not possible

Lie algebra

w.r.t. Quadratic common Lyapunov function exists in all these cases 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)
slide-11
SLIDE 11

11 of 22

SWITCHED NONLINEAR SYSTEMS

Lie bracket of nonlinear vector fields: Reduces to earlier notion for linear vector fields

(modulo the sign)

slide-12
SLIDE 12

12 of 22

SWITCHED NONLINEAR SYSTEMS

  • Linearization (Lyapunov’s indirect method)

Can prove by trajectory analysis [Mancilla-Aguilar ’00]

  • r common Lyapunov function [Shim et al. ’98, Vu–L ’05]
  • Global results beyond commuting case – ?

[Unsolved Problems in Math. Systems and Control Theory, ’04]

  • Commuting systems

GUAS

slide-13
SLIDE 13

13 of 22

SPECIAL CASE

globally asymptotically stable Want to show: is GUAS Will show: differential inclusion is GAS

slide-14
SLIDE 14

14 of 22

OPTIMAL CONTROL APPROACH

Associated control system: where (original switched system ) Worst-case control law [Pyatnitskiy, Rapoport, Boscain, Margaliot]: fix and small enough

slide-15
SLIDE 15

15 of 22

MAXIMUM PRINCIPLE

is linear in at most 1 switch (unless ) GAS Optimal control:

(along optimal trajectory)

slide-16
SLIDE 16

16 of 22

GENERAL CASE

GAS Want: polynomial of degree (proof – by induction on ) bang-bang with switches

See [Margaliot–L ’06] for details; also [Sharon–Margaliot ’07]

slide-17
SLIDE 17

17 of 22

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?

slide-18
SLIDE 18

18 of 22

ROBUST CONDITIONS

compact set of Hurwitz matrices

GUES: Lie algebra: Levi decomposition: ( solvable, semisimple) Switched transition matrix splits as where and Let and GUES

robust condition but not constructive

[Agrachev–Baryshnikov–L ’10]

slide-19
SLIDE 19

19 of 22

more conservative but easier to verify

GUES There are also intermediate conditions GUES: Levi decomposition: ( solvable, semisimple) Switched transition matrix splits as where and Let and

compact set of Hurwitz matrices

Lie algebra:

ROBUST CONDITIONS

[Agrachev–Baryshnikov–L ’10]

slide-20
SLIDE 20

20 of 22

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

ROBUST CONDITIONS

[Agrachev–Baryshnikov–L ’10]

slide-21
SLIDE 21

21 of 22

Example: GUES Levi decomposition: Cartan decomposition:

ROBUST CONDITIONS

[Agrachev–Baryshnikov–L ’10]

slide-22
SLIDE 22

22 of 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