Control Theory: Feedback and the Pole-Shifting Theorem Joseph Downs - - PowerPoint PPT Presentation

control theory feedback and the pole shifting theorem
SMART_READER_LITE
LIVE PREVIEW

Control Theory: Feedback and the Pole-Shifting Theorem Joseph Downs - - PowerPoint PPT Presentation

Control Theory: Feedback and the Pole-Shifting Theorem Joseph Downs September 3, 2013 Introduction (+ examples) What is Control Theory? Examples State-Space What is a State? Notation (State) Feedback Feedback Mechanisms LTI Systems


slide-1
SLIDE 1

Control Theory: Feedback and the Pole-Shifting Theorem

Joseph Downs September 3, 2013

slide-2
SLIDE 2

Introduction (+ examples) What is Control Theory? Examples State-Space What is a State? Notation (State) Feedback Feedback Mechanisms LTI Systems Linearity and Stationarity How to Apply the PST The Pole-Shifting Theorem Statement of the Pole-Shifting Theorem Consequences of the Pole-Shifting Theorem Conclusion

slide-3
SLIDE 3

What is Control Theory?

◮ steer physical quantities to desired values

slide-4
SLIDE 4

What is Control Theory?

◮ steer physical quantities to desired values ◮ mathematical description of engineering process

slide-5
SLIDE 5

What is Control Theory?

◮ steer physical quantities to desired values ◮ mathematical description of engineering process ◮ application of dynamical systems theory

slide-6
SLIDE 6

What is Control Theory?

◮ steer physical quantities to desired values ◮ mathematical description of engineering process ◮ application of dynamical systems theory ◮ introduce a control, u

slide-7
SLIDE 7

Examples

◮ cruise control

slide-8
SLIDE 8

Examples

◮ cruise control ◮ precision amplification (lasers + circuits)

slide-9
SLIDE 9

Examples

◮ cruise control ◮ precision amplification (lasers + circuits) ◮ biological motor control systems

slide-10
SLIDE 10

The Handstand Problem: Setup

◮ Iα = τi

slide-11
SLIDE 11

The Handstand Problem: Setup

◮ Iα = τi ◮ mL2¨

θ = mgL sin θ − u

slide-12
SLIDE 12

The Handstand Problem: Setup

◮ Iα = τi ◮ mL2¨

θ = mgL sin θ − u

◮ ¨

θ = g sin θ

L

u mL2

slide-13
SLIDE 13

What is a State?

◮ contains ”sufficient information”

slide-14
SLIDE 14

What is a State?

◮ contains ”sufficient information” ◮ describes system past

slide-15
SLIDE 15

What is a State?

◮ contains ”sufficient information” ◮ describes system past ◮ useful for deterministic systems

slide-16
SLIDE 16

What is a State?

◮ contains ”sufficient information” ◮ describes system past ◮ useful for deterministic systems ◮ state variable, x

slide-17
SLIDE 17

What is a State?

◮ contains ”sufficient information” ◮ describes system past ◮ useful for deterministic systems ◮ state variable, x ◮ allows us to write ˙

x = φ(t, x, u)

slide-18
SLIDE 18

Notation

◮ convenient to ”vectorize”

slide-19
SLIDE 19

Notation

◮ convenient to ”vectorize” ◮

˙ x1 = f1(x1, x2, ..., xn) ˙ x2 = f2(x1, x2, ..., xn) ... ˙ xn = fn(x1, x2, ..., xn)

slide-20
SLIDE 20

Notation

◮ convenient to ”vectorize” ◮

˙ x1 = f1(x1, x2, ..., xn) ˙ x2 = f2(x1, x2, ..., xn) ... ˙ xn = fn(x1, x2, ..., xn)

◮ →

slide-21
SLIDE 21

Notation

◮ convenient to ”vectorize” ◮

˙ x1 = f1(x1, x2, ..., xn) ˙ x2 = f2(x1, x2, ..., xn) ... ˙ xn = fn(x1, x2, ..., xn)

◮ → ◮ ˙

x = f(x)

slide-22
SLIDE 22

The Handstand Problem: Notation

◮ x1 = θ

slide-23
SLIDE 23

The Handstand Problem: Notation

◮ x1 = θ ◮ x2 = ˙

θ

slide-24
SLIDE 24

The Handstand Problem: Notation

◮ x1 = θ ◮ x2 = ˙

θ

◮ ˙

x := ˙ x1 ˙ x2

  • =
  • x2

g sin x1 L

u mL2

  • =: f(x, u)
slide-25
SLIDE 25

Feedback Mechanisms

◮ plug calculated values in as control

slide-26
SLIDE 26

Feedback Mechanisms

◮ plug calculated values in as control ◮ u = ψ(t, x)

slide-27
SLIDE 27

Feedback Mechanisms

◮ plug calculated values in as control ◮ u = ψ(t, x) ◮ achieved by measuring physical quantities

slide-28
SLIDE 28

Feedback Mechanisms

◮ plug calculated values in as control ◮ u = ψ(t, x) ◮ achieved by measuring physical quantities ◮ state vs. output feedback

slide-29
SLIDE 29

Linearity and Time-Invariance

◮ linear: ˙

x = A(t)x + B(t)u

slide-30
SLIDE 30

Linearity and Time-Invariance

◮ linear: ˙

x = A(t)x + B(t)u

◮ time-invariant: ˙

x = φ(t, x, u) = f (x, u)

slide-31
SLIDE 31

Linearity and Time-Invariance

◮ linear: ˙

x = A(t)x + B(t)u

◮ time-invariant: ˙

x = φ(t, x, u) = f (x, u)

◮ much simpler mathematically

slide-32
SLIDE 32

How to Apply the Pole-Shifting Theorem

◮ assume time-invariance: ∂φ(t,:,:) ∂t

≪ 1

slide-33
SLIDE 33

How to Apply the Pole-Shifting Theorem

◮ assume time-invariance: ∂φ(t,:,:) ∂t

≪ 1

◮ linearize about an equilibrium point (˙

x = 0)

slide-34
SLIDE 34

How to Apply the Pole-Shifting Theorem

◮ assume time-invariance: ∂φ(t,:,:) ∂t

≪ 1

◮ linearize about an equilibrium point (˙

x = 0)

◮ A =

  • ∂f1

∂x1 ∂f1 ∂x2 ∂f2 ∂x1 ∂f2 ∂x2

slide-35
SLIDE 35

How to Apply the Pole-Shifting Theorem

◮ assume time-invariance: ∂φ(t,:,:) ∂t

≪ 1

◮ linearize about an equilibrium point (˙

x = 0)

◮ A =

  • ∂f1

∂x1 ∂f1 ∂x2 ∂f2 ∂x1 ∂f2 ∂x2

  • ◮ B =

∂f1

∂u ∂f2 ∂u

slide-36
SLIDE 36

The Handstand Problem: Theorem Preparation

◮ ˙

x ≈ Ax + Bu

slide-37
SLIDE 37

The Handstand Problem: Theorem Preparation

◮ ˙

x ≈ Ax + Bu

◮ A =

1

g L

slide-38
SLIDE 38

The Handstand Problem: Theorem Preparation

◮ ˙

x ≈ Ax + Bu

◮ A =

1

g L

  • ◮ B =

1 mL2

slide-39
SLIDE 39

The Handstand Problem: Theorem Preparation

◮ ˙

x ≈ Ax + Bu

◮ A =

1

g L

  • ◮ B =

1 mL2

  • ◮ AB =

1 mL2

slide-40
SLIDE 40

Pole-Shifting Theorem Statement

◮ A(n × n) and B(n × m) are s.t.

rank

  • [ B

AB ... An−1B ]

  • = n
slide-41
SLIDE 41

Pole-Shifting Theorem Statement

◮ A(n × n) and B(n × m) are s.t.

rank

  • [ B

AB ... An−1B ]

  • = n

◮ →

slide-42
SLIDE 42

Pole-Shifting Theorem Statement

◮ A(n × n) and B(n × m) are s.t.

rank

  • [ B

AB ... An−1B ]

  • = n

◮ → ◮ ∃F(m × n) s.t. eigenvalues of A + BF are arbitrary

slide-43
SLIDE 43

Pole-Shifting Theorem Consequences

◮ we can make a feedback law!

slide-44
SLIDE 44

Pole-Shifting Theorem Consequences

◮ we can make a feedback law! ◮ u = Fx

slide-45
SLIDE 45

Pole-Shifting Theorem Consequences

◮ we can make a feedback law! ◮ u = Fx ◮ ˙

x = (A + BF)x

slide-46
SLIDE 46

Pole-Shifting Theorem Consequences

◮ we can make a feedback law! ◮ u = Fx ◮ ˙

x = (A + BF)x

◮ control system reduces to a dynamical system!

slide-47
SLIDE 47

The Handstand Problem: Theorem Application

◮ F =

  • f1

f2

slide-48
SLIDE 48

The Handstand Problem: Theorem Application

◮ F =

  • f1

f2

  • ◮ A + BF =
  • 1

g L − f1 mL2

− f2

mL2

slide-49
SLIDE 49

The Handstand Problem: Theorem Application

◮ F =

  • f1

f2

  • ◮ A + BF =
  • 1

g L − f1 mL2

− f2

mL2

  • ◮ χA+BF = λ2 + λ f2

mL2 + ( f1 mL2 − g L) = 0

slide-50
SLIDE 50

The Handstand Problem: Theorem Application

◮ F =

  • f1

f2

  • ◮ A + BF =
  • 1

g L − f1 mL2

− f2

mL2

  • ◮ χA+BF = λ2 + λ f2

mL2 + ( f1 mL2 − g L) = 0 ◮ λ = − f2 2mL2 ± 1 2

  • f22

m2L4 − 4 f1 mL2 + 4 g L

slide-51
SLIDE 51

The Handstand Problem: Theorem Application

◮ F =

  • f1

f2

  • ◮ A + BF =
  • 1

g L − f1 mL2

− f2

mL2

  • ◮ χA+BF = λ2 + λ f2

mL2 + ( f1 mL2 − g L) = 0 ◮ λ = − f2 2mL2 ± 1 2

  • f22

m2L4 − 4 f1 mL2 + 4 g L ◮

(f2 > 0)&(f1 > f22 4mL2 + mgL) → Re(λ±) < 0

slide-52
SLIDE 52

Conclusion

◮ control theory provides framework

slide-53
SLIDE 53

Conclusion

◮ control theory provides framework ◮ linearization simplifies problem

slide-54
SLIDE 54

Conclusion

◮ control theory provides framework ◮ linearization simplifies problem ◮ simple rank condition permits use of feedback

slide-55
SLIDE 55

Conclusion

◮ control theory provides framework ◮ linearization simplifies problem ◮ simple rank condition permits use of feedback ◮ further topics: PID control, feedback linearization, robotics,

etc.

slide-56
SLIDE 56

Conclusion

◮ control theory provides framework ◮ linearization simplifies problem ◮ simple rank condition permits use of feedback ◮ further topics: PID control, feedback linearization, robotics,

etc.

◮ Thanks for your time!