Nonlinear stabilization when delay is a function of state Miroslav - - PowerPoint PPT Presentation

nonlinear stabilization when delay is a function of state
SMART_READER_LITE
LIVE PREVIEW

Nonlinear stabilization when delay is a function of state Miroslav - - PowerPoint PPT Presentation

Nonlinear stabilization when delay is a function of state Miroslav Krstic Sontagfest , May 2011 The Sontag Army (the ISS/CLF Corps) Andy Teel Randy Freeman mk Zhongping Jiang Rodolphe Sepulchre Mrdjan Jankovic Dragan Nesic David Angeli


slide-1
SLIDE 1

Nonlinear stabilization when delay is a function of state

Miroslav Krstic

Sontagfest, May 2011

slide-2
SLIDE 2

The Sontag Army (the ISS/CLF Corps) Andy Teel Randy Freeman mk Zhongping Jiang Rodolphe Sepulchre Mrdjan Jankovic Dragan Nesic David Angeli Murat Arcak Daniel Liberzon Lars Gr¨ une Joao Hesphanha Frank Allgower Hiroshi Ito Michael Malisoff Frederic Mazenc Pierdomenico Pepe Iasson Karafyllis ...

slide-3
SLIDE 3

Outline

  • LTI systems with time-varying delay
  • nonlinear systems with state-dependent delay
  • happy birthday slide

lkj

slide-4
SLIDE 4

LTI Systems w/ Constant Delay

˙ X(t) = AX(t)+BU(t −D) A - possibly unstable; D - arbitrarily large

Assume: (A,B) controllable and matrix K found such that A+BK is Hurwitz.

slide-5
SLIDE 5

LTI Systems w/ Constant Delay

˙ X(t) = AX(t)+BU(t −D)

Predictor-based control law:

U(t) = K

  • eADX(t)+

Z t

t−DeA(t−θ)BU(θ)dθ

  • X(t+D)P(t)
slide-6
SLIDE 6

Time-Varying Input Delay

Basic idea introduced by Artstein (TAC, 1982) , but only conceptually (nor explicitly), for LTV systems with TV delays. Explicit design for LTI plants presented by Nihtila (CDC, 1991) , but no analysis of stability

  • r of feasibility of the controller.
slide-7
SLIDE 7

Time-Varying Input Delay

˙ X(t) = AX(t)+BU(φ(t)) φ(t) = t −D(t) := “delayed time”

Predictor feedback

U(t) = K

  • eA
  • φ−1(t)−t
  • X(t)+

Z t

φ(t)eA

  • φ−1(t)−φ−1(θ)
  • B

U(θ) φ′ φ−1(θ) dθ

slide-8
SLIDE 8

Need a Lyapunov functional. Construct one with a backstepping transformation of the actuator state:

W(θ) = U(θ)−K

X(φ−1(θ)P(θ)

  • eA
  • φ−1(θ)−t
  • X(t)+

Z θ

φ(t)eA

  • φ−1(θ)−φ−1(σ)
  • B

U(σ) φ′ φ−1(σ) dσ

  • φ(t) ≤ θ ≤ t
slide-9
SLIDE 9

Need a Lyapunov functional. Construct one with a backstepping transformation of the actuator state:

W(θ) = U(θ)−K

X(φ−1(θ)P(θ)

  • eA
  • φ−1(θ)−t
  • X(t)+

Z θ

φ(t)eA

  • φ−1(θ)−φ−1(σ)
  • B

U(σ) φ′ φ−1(σ) dσ

  • φ(t) ≤ θ ≤ t

V(t) = X(t)TPX(t)+a

Z t

φ(t)

e

bφ−1(θ)−t

φ−1(t)−t

  • φ−1(t)−t
  • φ′

φ−1(θ) W(θ)2dθ

slide-10
SLIDE 10

Theorem 1 ∃G,g > 0 s.t.

|X(t)|2 +

Z t

t−D(t)U2(θ)dθ ≤ Ge−gt

  • |X0|2 +

Z 0

−D(0)U2(θ)dθ

  • ,

∀t ≥ 0,

where G (but not g) depends on the function D(·).

slide-11
SLIDE 11

Conditions on the delay function D(t) = t −φ(t):

  • D(t) ≥ 0 (causality);
  • D(t) is uniformly bounded from above (all inputs applied to the plant eventually reach

the plant);

  • D′(t) < 1 (plant never feels input values that are older than the ones it has already

felt— input signal direction never reversed );

  • D′(t) is uniformly bounded from below (delay cannot disappear instantaneously, but
  • nly gradually).
slide-12
SLIDE 12

Achilles heel:

φ−1(t) > t > φ(t)

!

D(t) needs to be known sufficiently far in advance ⇒ method appears not to be usable for state-dependent delays

slide-13
SLIDE 13

Nonlinear systems with state-dependent delay

(with Nikolaos Bekiaris-Liberis)

slide-14
SLIDE 14
  • Control over networks
  • Driver reaction delay
  • Milling processes
  • Rolling mills
  • Engine cooling systems
  • Population dynamics
slide-15
SLIDE 15

Nonlinear Systems with State-Dependent Input Delay

˙ X(t) = f

  • X(t),U
  • t − D(X(t))
  • Challenge:

P(t) =

value of the state at the time when the control applied at t reaches the system

= X

  • t +D(P(t))
  • P(θ)

= X(t)+

Z θ

t−D(X(t))

f (P(s),U(s)) 1−∇D(P(s)) f (P(s),U(s))ds, t −D(X(t)) ≤ θ ≤ t

slide-16
SLIDE 16

Nonlinear Systems with State-Dependent Input Delay

˙ X(t) = f

  • X(t),U
  • t − D(X(t))
  • Challenge:

P(t) =

value of the state at the time when the control applied at t reaches the system

= X

  • t +D(P(t))
  • P(θ)

= X(t)+

Z θ

t−D(X(t))

f (P(s),U(s)) 1−∇D(P(s)) f (P(s),U(s))ds, t −D(X(t)) ≤ θ ≤ t

slide-17
SLIDE 17

Controller (possibly time-varying)

U(t) = κ((t +D(P(t)),P(t))

slide-18
SLIDE 18

Example 1 (stabilizing, but not global even for linear systems)

˙ X(t) = X(t)+U

  • t −X(t)2

Simulations with input initial conditions

U(θ) = 0,−X(0)2 ≤ θ ≤ 0.

For X(0) ≥ X∗ =

1 √ 2e = 0.43, the controller never “kicks in” (dashed)

0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 t x(t) 0.1 0.2 0.3 0.4 0.5 0.6 0.7 −0.2 −0.1 0.1 0.2 0.3 0.4 0.5 0.6 0.7 φ(t) t

slide-19
SLIDE 19

Result not global because of feasibility condition “delay rate < 1”

To keep the prediction horizon finite and control bounded, the initial conditions and solu- tions must satisfy

Fc :

∇D(P(θ)) f (P(θ),U(θ)) < c,

for all θ ≥ −D(X(0)), for some c ∈ (0,1]. We refer to F1 as the feasibility condition of the controller.

slide-20
SLIDE 20

!"#"$%!!!",!!#(•+$),&&'%(")&≤&$&≤&0

.

slide-21
SLIDE 21

Theorem 2 (local u.a.s. in sup-norm of U)

∃ψRoA ∈ K , ρ ∈ K C , and β ∈ K L s.t. ∀ initial cond. that satisfy B0(c) : |X(0)|+ sup

−D(X(0))≤θ≤0

|U(θ)| < ψRoA(c)

for some 0 < c < 1,

|X(t)|+ sup

t−D(X(t))≤θ≤t

|U(θ)| ≤ β

  • ρ
  • |X(0)|+

sup

−D(X(0))≤θ≤0

|U(θ)|,c

  • ,t
  • ,

∀t ≥ 0.

If U is locally Lipschitz on the interval [−D(X(0)),0), there exists a unique solution to the closed-loop system with X Lipschitz on [0,∞), U Lipschitz on (0,∞)

slide-22
SLIDE 22

Assumption 1 D ∈ C1 (Rn;R+) Assumption 2

˙ X = f (X,ω) is forward complete

Assumption 3

˙ X = f (X,κ(t,X)) is g.u.a.s.

slide-23
SLIDE 23

Lemma 1 (infinite-dimensional backstepping transformation of the actuator state)

W(θ) = U(θ)−κ(σ(θ),P(θ)), t −D(X(t)) ≤ θ ≤ t,

transforms the closed-loop system into the “target system”

˙ X(t) = f (X(t),κ(t,X(t))+W (t −D(X(t)))) W(t) = 0, ∀t ≥ 0.

Lemma 2 (u.a.s. of target system)

∃ρ∗ ∈ K C , β2 ∈ K L s.t., for all solutions satisfying Fc for 0 < c < 1, |X(t)|+ sup

t−D(X(t))≤θ≤ t

|W(θ)| ≤ β2  ρ∗  |X(0)|+ sup

−D(X(0))≤θ≤ 0

|W(θ)|,c  ,t  ,

slide-24
SLIDE 24

!("#+#τ) τ#∈"[(!("),0] "("#+#τ) τ#∈"[(!("),0]

.

slide-25
SLIDE 25

!"#"!$%"&$'($ )*+,-.'#$(-./&0'.+!

%&+&"1!!!",!!#(•+$),&&'%(")&≤&$&≤&0

.

slide-26
SLIDE 26

Lemma 3 (norm equivalence between the original system and target system)

∃ρ2 ∈ K C ∞, α9 ∈ K ∞ s.t., for all solutions satisfying Fc for 0 < c < 1, |X(t)|+ sup

t−D(X(t))≤θ≤t

|U(θ)| ≤ α−1

9

  • |X(t)|+

sup

t−D(X(t))≤θ≤t

|W(θ)|

  • |X(t)|+

sup

t−D(X(t))≤θ≤t

|W(θ)| ≤ ρ2

  • |X(t)|+

sup

t−D(X(t))≤θ≤t

|U(θ)|,c

  • Lemma 4

(finding a ball ¯

B around the origin and within the feasibility region) ∃¯ ρc ∈ K C ∞ s.t. Fc (0 < c < 1) is satisfied by all solutions that satisfy ¯ B(c) : |X(t)|+ sup

t−D(X(t))≤θ≤t

|U(θ)| < ¯ ρc(c,c) ∀t ≥ 0.

Lemma 5 (finding a ball B0 of initial conditions s.t. all solutions are confined in ¯

B ⊂ Fc) ∃ψRoA ∈ K s.t. for all initial conditions in B0(c), the solutions remain in ¯ B(c) ⊂ Fc for

some 0 < c < 1.

slide-27
SLIDE 27

Examples

slide-28
SLIDE 28

Example 2 Non-holonomic unicycle with D(x,y) = x2 +y2 A predictor-based version of Pomet’s (1992) time-varying controller:

ω = −5P2cos(3σ(t))− pq

  • 1+25cos(3σ(t))2

−Θ v = −P+5Q(sin(3σ(t))−cos(3σ(t)))+Qω,

where

P = X cos(Θ)+Y sin(Θ) Q = X sin(Θ)−Y cos(Θ),

and the predictor is given by

X(t) = x(t)+

Z t

t−D(x(t),y(t))

˙ σ(s)v(s)cos(Θ(s))ds Y(t) = y(t)+

Z t

t−D(x(t),y(t))

˙ σ(s)v(s)sin(Θ(s))ds Θ(t) = θ(t)+

Z t

t−D(x(t),y(t))

˙ σ(s)ω(s)ds σ(t) = t +D(X(t),Y(t)) ˙ σ(s) = 1 1−2(X(s)v(s)cos(Θ(s))+Y(s)v(s)sin(Θ(s)))

slide-29
SLIDE 29

−0.4 −0.2 0.2 0.4 0.6 0.8 1 0.2 0.4 0.6 0.8 1 x(t) y(t) Trajectory of the robot for t ∈ [0, 15]

−20 −10 10 20 −15 −10 −5 5 10 15 Trajectory of the robot for t ∈ [0, 500] x(t) y(t)

5 10 15 1 2 3 4 5 6 7 8 9 10 t D(t)

Solid: with delay compensation; dashed: without.

slide-30
SLIDE 30

Example 3 (global stabilization—not with D unif. bdd but with ˙

D = ∇Df < 1) ˙ X(t) = X(t)+U (t −D(X(t))) 1+U (t −D(X(t)))2 , D(X) = 1 4 log

  • 1+X2

.

In the delay-free case, the controllerU = −2X yields the closed-loop system ˙

X = −

X 1+4X2.

5 10 15 20 0.5 1 1.5 2 2.5 X (t) t

  • 1. X(t) grows exponentially,
  • 2. X(t) decays as “backwards” square root,
  • 3. X(t) decays exponentially.
slide-31
SLIDE 31

Example 4 (forward completeness not needed for local stabilization)

˙ X(t) = X4(t)+2X5(t)+X2(t)(1+X(t))U(t −X2(t)).

Origin not reachable for X0 < −1, hence not glob. stabilizable. Origin not loc. exp. stabilizable. Delay-free controller U = −X yields ˙

X = −X3 +2X5, with RoA = 1

√ 2 ≈ 0.7.

1 2 3 4 5 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 t X (t)

Solid: controller with delay compensation. Dotted: delay-free case. Dashed: U = −X applied to the plant with delay. The initial condition X0 = 0.54 is large. The state

X(σ∗) is almost at R =

1 √ 2 when control kicks in.

slide-32
SLIDE 32

Theorem 3 (loc. asymp. stabilization of ODE ⇒ loc. asymp. stabilization ∀ delay fcn) If in the absence of delay there exist R > 0 and β1 ∈ K L s.t. ∀t ≥ 0,

|X(0)| < R ⇒ |X(t)| ≤ β1(|X(0)|,t),

then there exist δ > 0 and β2 ∈ K L s.t. ∀t ≥ 0,

|X(0)|+ sup

−D(X(0))≤θ≤0

|U(θ)| < δ ⇓ |X(t)|+ sup

t−D(X(t))≤θ≤t

|U(θ)| ≤ β2

  • |X(0)|+

sup

−D(X(0))≤θ≤0

|U(θ)|,t

  • .

Extra challenge: Make δ so small that, when control kicks in, |X| < R. (Estimate the time the control kicks in from a fixed pt. problem on a delay bound, which is a contraction for sufficiently small initial condition.)

slide-33
SLIDE 33

Example 5 (state-dependent delay on state)

˙ X1(t) = X2

  • t −asin2X1(t)
  • ,

a ≥ 0 ˙ X2(t) = U(t) U(t) = −c2(X2(t)+c1P1(t))−c1 X2(t) 1−asin(2P1(t))X2(t) P1(θ) = X1(t)+

Z θ

t−asin2X1(t)

X2(s)ds 1−asin(2P1(s))X2(s)

slide-34
SLIDE 34

2 4 6 8 10 −5 5 10 15 20 t X2(t) X1(t) 2 4 6 8 10 −6 −4 −2 2 4 6 8 t U (t)

2 4 6 8 10 2 4 6 8 10 φ(t) = t − 0.3 sin

2(X1(t))

σ(t) t

slide-35
SLIDE 35

Feliz cumplea˜ nos!