1 Digital Control System Design 1.: Pole Assignment Method
1 Digital Control System Design 1.: Pole Assignment Method
1 Digital Control System Design 1.: Pole Assignment Method
DESIGN 1.
1
x1
+ z
-1
-1 x2 Y
R Q + z c
+
+
x3
+ -1
z
(z − λ 1 )(z − λ 2 ) · · · (z − λ n ) = 0.
4
z-plane poles of 2nd order systems
,
s = −ζω n ± j ω n 1 − ζ 2 .
,
ζ = cos θ and ωd = ω n 1 − ζ 2 .
,
z=e sT
=e − ζ ωn T ƒ
± ωn T 1 − ζ2 = rƒ ± θ
5
from e− ζ ωn T
=r
Thus,
damping ratio
natural freq.
time const.
1 −T
τ = =
ζω n ln
r
6
Pole Assignment for 2nd Order Systems
Consider the second order case of
x(k + 1) = [P − qK]x(k) +
qr(k).
Let
K = [K 1 , K 2 ]
7
8
The characteristic equation of the 2nd order system takes either
of
two real roots
complex roots
(z − α − jβ)(z − α + j β ) = z2 + 2αz + α2 + β2 = 0
9
10
11
The characteristic equation jzI − Acj = 0 becomes,
α c (z) = (z − λ 1 )(z − λ 2 ) = z2 − (λ 1 + λ 2 )z + λ 1 λ 2 = 0
K 1 = 105[λ 1 λ 2 − (λ 1 + λ 2 ) + 1.0]
K2 = 14.67 − 5.34λ 1 λ 2 − 5.17(λ 1 + λ 2 )
14
The unity gain feedback gives satisfactory ζ but the time
constant
2.12 sec. is too large. Try to reduce the time constant to 1
sec.
−T
ln r = τ = −0.1/1 = −0.1 =⇒ r = 0.905
2 2
ln r
θ2 = 2
ζ2 − ln r = (0.193)
16
17
2 Ackermann’s Formula
Since it is difficult to extend the approach demonstrated in
the second order case to a higher order system, the pole
assignment must rely on a more practical procedure called
Ackermann’s formula. When we know the desired poles,
z = λ 1 , z = λ 2 , · · · z = λ n for a n-th order system, write
the characteristic equation,
18
×
19
MATLAB Solution
23
in z-plane. The following MATLAB program uses Ackermann’s
method to move the poles of this system to an assigned
location. This program has four preassigned pole locations:
Pay attention to the gain (final position) for a pulse input that
drive the motor to turn for a limited time duration. If the real
part of the two poles are moved away from z = 1, more damping
slows the motor and the number of turns (rotational angle) gets
less.
26
Open loop response to pulse
1.5
0.5
0
0 5 10 15 25
20
27
State Feedback by Pole Assignment
1.4
1.2
0.8
0.6
0.4
0.2
0
0 5 10 20 25
15
28
State Feedback by Pole Assignment
1.4
1.2
0.8
0.6
0.4
0.2
0
0 5 10 20 25
15
29
State Feedback by Pole Assignment
3.5
2.5
1.5
0.5
0
0 5 10 20 25
15
30
State Feedback by Pole Assignment
1.4
1.2
0.8
0.6
0.4
0.2
0
0 5 10 20 25
15
31
Assignment No. 6
38
STATE ESTIMATION
• The state feedback by the pole assignment method designs
an effective controller to satisfy the desired transient
characteristics related to the pole locations.
• This method, however, requires that all the state variables
are measurable and available for feedback.
• Since not all state variables are necessarily available, we
need to use an observer that estimates (or predicts) the state
variables.
• The technique to design the prediction observer also
uses Ackermann’s formula.
• The prediction observer leads to a controller that
implements the pole assignment together with the state
estimation. 39
4 Observer Model
Using the z-
transform
zX( z) = AX(z) + BU(z)
X( z) = (zI − A) − 1 BU(z)
40
The observer is a system to observe (estimate) the state x(k +
1) from input u(k) and output y(k) . Thus, the equation of the
observer is
Q( z) = (zI − F) − 1 [GY(z) +
HU(z)]
41
Q(z) = (zI − F) −1 [GCX(z) + HU(z)]
Q(z) = (zI − F) −1 [GC(zI − A) − 1 B + H]U(z)
42
(zI − A) − 1 B = (zI − F) −1 [GC(zI − A) − 1 B + H]
(zI − A) − 1 B = (zI − F) −1 GC(zI − A) − 1 B + (zI − F) − 1 H
jzI − A + GCj = 0
44
5 Errors in Estimation
jzI − (A − GC)j = 0
45
All the matrices in the observer state equation except G are from
the plant state equation. G can be independently determined
from the characteristic equation of the error dynamics,
46
Poles of
α e (z)
An approach usually suggested for choosing α e (z) is to make
the
observer two to four times faster than the closed loop control
system designed by the pole assignment due to α c (z) = 0. The
fastest time constant of the closed-loop system, determined
from the system characteristic equation,
49
q(k + 1) = Fq(k) + Gy(k) + Hu(k)
q(k + 1) = (A − GC)q(k) + Gy(k) + Bu(k)
q(k + 1) = Aq(k) + G[y(k) − Cq(k)] + Bu(k)
50
51
52
53
54