STABILITY under CONSTRAINED SWITCHING

17
STABILITY under CONSTRAINED SWITCHING Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign

description

STABILITY under CONSTRAINED SWITCHING. Daniel Liberzon. Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign. TWO BASIC PROBLEMS. Stability for arbitrary switching Stability for constrained switching. - PowerPoint PPT Presentation

Transcript of STABILITY under CONSTRAINED SWITCHING

Page 1: STABILITY  under  CONSTRAINED  SWITCHING

STABILITY under CONSTRAINED SWITCHING

Daniel Liberzon

Coordinated Science Laboratory andDept. of Electrical & Computer Eng.,Univ. of Illinois at Urbana-Champaign

Page 2: STABILITY  under  CONSTRAINED  SWITCHING

TWO BASIC PROBLEMS

• Stability for arbitrary switching

• Stability for constrained switching

Page 3: STABILITY  under  CONSTRAINED  SWITCHING

MULTIPLE LYAPUNOV FUNCTIONS

Useful for analysis of state-dependent switching

– GAS

– respective Lyapunov functions

is GAS

Page 4: STABILITY  under  CONSTRAINED  SWITCHING

MULTIPLE LYAPUNOV FUNCTIONS

decreasing sequence

decreasing sequence

[DeCarlo, Branicky]

GAS

Page 5: STABILITY  under  CONSTRAINED  SWITCHING

DWELL TIME

The switching times satisfy

dwell time– GES

– respective Lyapunov functions

Page 6: STABILITY  under  CONSTRAINED  SWITCHING

DWELL TIME

– GES

Need:

The switching times satisfy

Page 7: STABILITY  under  CONSTRAINED  SWITCHING

DWELL TIME

– GES

Need:

The switching times satisfy

Page 8: STABILITY  under  CONSTRAINED  SWITCHING

DWELL TIME

– GES

Need:

must be 1

The switching times satisfy

Page 9: STABILITY  under  CONSTRAINED  SWITCHING

AVERAGE DWELL TIME

# of switches on average dwell time

– dwell time: cannot switch twice if

Page 10: STABILITY  under  CONSTRAINED  SWITCHING

AVERAGE DWELL TIME

Theorem: [Hespanha ‘99] Switched system is GAS if

Lyapunov functions s.t. • .

Useful for analysis of hysteresis-based switching logics

# of switches on average dwell time

Page 11: STABILITY  under  CONSTRAINED  SWITCHING

MULTIPLE WEAK LYAPUNOV FUNCTIONS

Theorem: is GAS if

• .

– milder than ADT

Extends to nonlinear switched systems as before

observable for each

s.t. there are infinitely many

switching intervals of length

For every pair of switching times

s.t.

have

Page 12: STABILITY  under  CONSTRAINED  SWITCHING

APPLICATION: FEEDBACK SYSTEMS (Popov criterion)

Corollary: switched system is GAS if

• s.t. infinitely many switching intervals of length

• For every pair of switching times at

which we have

linear system observable

positive real

See also invariance principles for switched systems in: [Lygeros et al., Bacciotti–Mazzi, Mancilla-Aguilar, Goebel–Sanfelice–Teel]

Weak Lyapunov functions:

Page 13: STABILITY  under  CONSTRAINED  SWITCHING

STATE-DEPENDENT SWITCHING

But switched system is stable for (many) other

Switched system

unstable for some

no common

switch on the axes

is a Lyapunov function

Page 14: STABILITY  under  CONSTRAINED  SWITCHING

STATE-DEPENDENT SWITCHING

But switched system is stable for (many) other

level sets of level sets of

Switched system

unstable for some

no common

Switch on y-axis

GAS

Page 15: STABILITY  under  CONSTRAINED  SWITCHING

STABILIZATION by SWITCHING

– both unstable

Assume: stable for some

Page 16: STABILITY  under  CONSTRAINED  SWITCHING

STABILIZATION by SWITCHING

[Wicks et al. ’98]

– both unstable

Assume: stable for some

So for each

either or

Page 17: STABILITY  under  CONSTRAINED  SWITCHING

UNSTABLE CONVEX COMBINATIONS

Can also use multiple Lyapunov functions

Linear matrix inequalities