SLIDE 1
Control Theory: Feedback and the Pole-Shifting Theorem Joseph Downs - - PowerPoint PPT Presentation
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 2
SLIDE 3
What is Control Theory?
◮ steer physical quantities to desired values
SLIDE 4
What is Control Theory?
◮ steer physical quantities to desired values ◮ mathematical description of engineering process
SLIDE 5
What is Control Theory?
◮ steer physical quantities to desired values ◮ mathematical description of engineering process ◮ application of dynamical systems theory
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
Examples
◮ cruise control
SLIDE 8
Examples
◮ cruise control ◮ precision amplification (lasers + circuits)
SLIDE 9
Examples
◮ cruise control ◮ precision amplification (lasers + circuits) ◮ biological motor control systems
SLIDE 10
The Handstand Problem: Setup
◮ Iα = τi
SLIDE 11
The Handstand Problem: Setup
◮ Iα = τi ◮ mL2¨
θ = mgL sin θ − u
SLIDE 12
The Handstand Problem: Setup
◮ Iα = τi ◮ mL2¨
θ = mgL sin θ − u
◮ ¨
θ = g sin θ
L
−
u mL2
SLIDE 13
What is a State?
◮ contains ”sufficient information”
SLIDE 14
What is a State?
◮ contains ”sufficient information” ◮ describes system past
SLIDE 15
What is a State?
◮ contains ”sufficient information” ◮ describes system past ◮ useful for deterministic systems
SLIDE 16
What is a State?
◮ contains ”sufficient information” ◮ describes system past ◮ useful for deterministic systems ◮ state variable, x
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
Notation
◮ convenient to ”vectorize”
SLIDE 19
Notation
◮ convenient to ”vectorize” ◮
˙ x1 = f1(x1, x2, ..., xn) ˙ x2 = f2(x1, x2, ..., xn) ... ˙ xn = fn(x1, x2, ..., xn)
SLIDE 20
Notation
◮ convenient to ”vectorize” ◮
˙ x1 = f1(x1, x2, ..., xn) ˙ x2 = f2(x1, x2, ..., xn) ... ˙ xn = fn(x1, x2, ..., xn)
◮ →
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
The Handstand Problem: Notation
◮ x1 = θ
SLIDE 23
The Handstand Problem: Notation
◮ x1 = θ ◮ x2 = ˙
θ
SLIDE 24
The Handstand Problem: Notation
◮ x1 = θ ◮ x2 = ˙
θ
◮ ˙
x := ˙ x1 ˙ x2
- =
- x2
g sin x1 L
−
u mL2
- =: f(x, u)
SLIDE 25
Feedback Mechanisms
◮ plug calculated values in as control
SLIDE 26
Feedback Mechanisms
◮ plug calculated values in as control ◮ u = ψ(t, x)
SLIDE 27
Feedback Mechanisms
◮ plug calculated values in as control ◮ u = ψ(t, x) ◮ achieved by measuring physical quantities
SLIDE 28
Feedback Mechanisms
◮ plug calculated values in as control ◮ u = ψ(t, x) ◮ achieved by measuring physical quantities ◮ state vs. output feedback
SLIDE 29
Linearity and Time-Invariance
◮ linear: ˙
x = A(t)x + B(t)u
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
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
How to Apply the Pole-Shifting Theorem
◮ assume time-invariance: ∂φ(t,:,:) ∂t
≪ 1
SLIDE 33
How to Apply the Pole-Shifting Theorem
◮ assume time-invariance: ∂φ(t,:,:) ∂t
≪ 1
◮ linearize about an equilibrium point (˙
x = 0)
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
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
The Handstand Problem: Theorem Preparation
◮ ˙
x ≈ Ax + Bu
SLIDE 37
The Handstand Problem: Theorem Preparation
◮ ˙
x ≈ Ax + Bu
◮ A =
1
g L
SLIDE 38
The Handstand Problem: Theorem Preparation
◮ ˙
x ≈ Ax + Bu
◮ A =
1
g L
- ◮ B =
- −
1 mL2
SLIDE 39
The Handstand Problem: Theorem Preparation
◮ ˙
x ≈ Ax + Bu
◮ A =
1
g L
- ◮ B =
- −
1 mL2
- ◮ AB =
−
1 mL2
SLIDE 40
Pole-Shifting Theorem Statement
◮ A(n × n) and B(n × m) are s.t.
rank
- [ B
AB ... An−1B ]
- = n
SLIDE 41
Pole-Shifting Theorem Statement
◮ A(n × n) and B(n × m) are s.t.
rank
- [ B
AB ... An−1B ]
- = n
◮ →
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
Pole-Shifting Theorem Consequences
◮ we can make a feedback law!
SLIDE 44
Pole-Shifting Theorem Consequences
◮ we can make a feedback law! ◮ u = Fx
SLIDE 45
Pole-Shifting Theorem Consequences
◮ we can make a feedback law! ◮ u = Fx ◮ ˙
x = (A + BF)x
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
The Handstand Problem: Theorem Application
◮ F =
- f1
f2
SLIDE 48
The Handstand Problem: Theorem Application
◮ F =
- f1
f2
- ◮ A + BF =
- 1
g L − f1 mL2
− f2
mL2
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
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
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
Conclusion
◮ control theory provides framework
SLIDE 53
Conclusion
◮ control theory provides framework ◮ linearization simplifies problem
SLIDE 54
Conclusion
◮ control theory provides framework ◮ linearization simplifies problem ◮ simple rank condition permits use of feedback
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