Documente Academic
Documente Profesional
Documente Cultură
Objectives
On completing this section, you should:
Be able to implement the IMC design procedure on
discrete systems.
Be able to compare common discrete control
algorithms, namely:
The discrete PID algorithm (plus filter)
Dead-beat Algorithm
Dahlins Algorithm
LECTURE ELEVEN
d
yySS
++
qqq(s)
((zz))
++
pp(s)
(z )
yy
y = pq ys + (1p (z pq)
d
)
q = p-1f
Problem 1:
If p ( z ) contains non-minimum phase components:
kz 3
z 1.5
e.g. p1 ( z ) =
or p2 ( z ) =
2
z 0.5
(z 0.5 )
q1 ( z ) =
(z
0.5 ) z +3
Non-causal
11- 4
and q2 ( z ) =
(z
0.5 )
z 1.5
Unstable
LECTURE ELEVEN
Invertible
1
1
such that p pA = pM (stable, causal, and strictly proper)
and the all-pass component, pA ( z ) , is defined as:
pA ( z ) = z
(1 ) ( z )
( z ) (1 ) .
1
i =1
Note that pA (e i T
) = 1
q = pM1 (n.b. q (1 ) = p 1 (1 ) )
kz 3
z 0.5
kz
q (z ) =
pA1 ( z ) = z 4 , pM 1 ( z ) =
z 0.5
kz
z 0.5
z 1.5
pA 2 ( z ) = 0.667
z 1
2
(z 0.667 )
z 1.5
0.667 ( z 0.5 )
p2 ( z ) =
2
z ( z 0.667 ) q ( z ) = z ( z 0.667 )
(z 0.5 )
pM 2 ( z ) = 1.5
2
(z 0.5 )
p1 ( z ) =
11- 6
LECTURE ELEVEN
f (z ) =
dk
(1 f (z ) ) z =1 = 0, 0 k < m
dz k
input type (1 or 2)
1
=0
1 z 1 z =1
z 1.5
z 3
2
( z 0.5 )
= pq = pAf =
0.667 ( z 1.5 )(1 ) -3
z =1
If ys = z/(z 1) (unit step): lim y (kT ) = lim (z 0.667
)(z )
k
z 1
i.e. design with q (1 ) = p 1 (1 ) guarantees offset-free response
11- 8
LECTURE ELEVEN
11- 9
q ( z ) = pM1 ( z ) f ( z )
As seen previously, any negative poles in q(z) lead to ringing
(the controller output will exhibit a sign change in each
sample). The closer these negative poles are to 1, the more
severe will be the ringing.
11- 10
LECTURE ELEVEN
Example of Ringing
Consider the process p ( s ) =
sampled at T=3.
p (z ) =
0.016 ( z + 0.87 )
(z 0.90 ) (z 0.74 )
pM ( z ) =
0.016 ( z + 0.87 ) z
(z 0.90 ) (z 0.74 )
pA ( z ) = z 1
q ( z ) = pM1 (z ) f ( z ) =
11- 11
Example of Ringing
c (z ) =
q (z )
1 p (z ) q (z )
11- 12
LECTURE ELEVEN
qmod ( z ) = q ( z )
(z i )
i
=1
(1 i )
z P =
z P (1 i )
i =1
=1
11- 13
q (z )
qmod ( z ) = q ( z )
(z i )
i
=1
(1 i )
i
=1
z P =
q (z )
P
z P (1 i )
i =1
11- 14
LECTURE ELEVEN
11- 15
(z )
p (z )
Im(z)
p (e
iT
Re(z)
Multiplicative uncertainty
p (e iT )
11- 16
Process model
p(eiT ) = p(eiT ) (1 +
m
(eiT ) =
(eiT ) )
depends on T
LECTURE ELEVEN
Computing
(z) - Example
Compute,
Solution:
pworst (z) =
(1 + k ) (1 e T /(1) )
z
(1+ ) T
(z e
(1 e )
z (z e )
T /(1 )
p(z) =
11- 17
(z) =
iT
z = e
Computing
(z) - Example
= 1, = = k = 0.2
T = 0.5
T = 0.5
T = 0.05
T = 0.05
0 < < T
0 < < T
The results for T = 0.05 are close to those one would expect
for a continuous system. For T = 0.5, the effect of uncertainty
may be different, depending on the ratio of /.
11- 18
LECTURE ELEVEN
11- 19
ys(z)
(z )
10
LECTURE ELEVEN
1
+ D s e ( s )
Continuous theoretical PID: u ( s ) = Kc 1 +
I s
T k
u(k) = Kc e(k) +
e(i) + D ( e(k) - e(k-1) ) + us
I i= 0
Velocity form:
T k-1
u(k-1) = Kc e(k-1) +
e(i) + D ( e(k-1) - e(k-2) ) + us
T
I i = 0
T
e(k) + D ( e(k) 2e(k-1) + e(k-2) )
= Kc e(k) e(k-1) +
T
I
T D
= Kc 1 +
+ e(k) 1 + 2 D e(k-1) + D e(k-2)
T
T
T
11- 22
11
LECTURE ELEVEN
T D
u(k) = Kc 1 +
+ e(k) 1 + 2 D e(k-1) + D e(k-2)
T
T
T
-1
-2
u(k) + z + z
=
=
e(k)
1 z -1
Advantages:
The velocity form is independent of initial
condition, us.
It is not subject to reset wind-up.
Disadvantages:
It responds aggressively to step changes in
setpoint.
The differential operator is sensitive to noise.
11- 23
ys(k)
11- 24
12
LECTURE ELEVEN
Dead-beat Algorithm
In dead-beat control, the desired response is to ensure zeroerror from the n+1 sample, where n = /T. The desired closed
loop transfer function is: y ( z )
= ( z ) = z -(n+1)
ys ( z )
(z )
z -(n+1)
-1
= G -1 ( z )
Thus, CDB ( z ) = G ( z )
1 (z )
1 z -(n+1)
Example.
1 e T 0.5 z 1
10
8.6z 1
T = 1, P(s) =
, G(z) = HP(z) = 10
=
0.5s + 1
1 0.14z 1
1 e T 0.5z 1
-1
Since the process has no dead-time, n = 0, and ( z ) = z
Thus, CDB ( z ) = G -1 ( z )
11- 25
z -1
1 0.14z 1 z -1
1 0.14z 1
=
=
0.116
1 z -1
8.6z 1 1 z -1
1 z -1
1 0.14z 1
1 z -1
1. The equivalent IMC controller, Q(z) is:
CDB ( z )
z 0.14
= 0.116 (1 0.14z 1 ) = 0.116
QDB (z) =
1 + G ( z ) CDB ( z )
z
2. The output is specified at the sample instances only. The
actual process could have large inter-sample overshoots
and/or be highly oscillatory.
CDB ( z ) = 0.116
11- 26
13
LECTURE ELEVEN
Dahlins Algorithm
Recall that the IMC design for a delay process gives:
y (s)
1
= (s) =
e s
s + 1
ys ( s )
This approach enables us to target not only the desired delay
of the response, but also define how fast we would like it to
settle (as determined by the value of ).
Taking this idea into the discrete domain:
(1 b)z-(n+1)
(z ) =
,b = e T , = nT
1 bz-1
(z )
Thus, CDA ( z ) = G -1 ( z )
1 (z )
= G -1 ( z )
11- 27
(1 b)z -(n+1)
,b = e T
1 bz -1 (1 b)z -(n+1)
11- 28
14
LECTURE ELEVEN
(1 b)z-3
,b = e T
-1
1 bz
Hence, CDA ( z ) = G -1 ( z )
=
(1 b)z -3
,b = e T
1 bz -1 (1 b)z -3
1 0.61z 1
(1 b)z -3
0.39z 3 1 bz -1 (1 b)z -3
Q(z) =
1 0.61z 1 1 b
0.39 1 bz -1
DA ( = 0.5 min)
DA ( = 2.0 min)
11- 30
15
Here,
0.39z 3
1 0.61z 1
Note that the fastest
response is obtained
with DB, with the
filter time constant
provided a back-off on
performance for DA.
G(z) =
LECTURE ELEVEN
DA ( = 0.5 min)
DA ( = 2.0 min)
11- 31
Here,
0.39z 4
1 0.61z 1
With no filter, DB is
unstable with delay
uncertainty. DA with
= 0.5 is close to the
theoretical stability
limit, and with = 2
gives a similar to
nominal response.
G(z) =
Adaptive Control
In cases where parameter changes are expected to be large,
robust control may lead to poor performance. Such cases are:
Large, frequent disturbances (feed composition, feed
quality)
Batch operation (no steady-state)
Inherent nonlinear behavior (pH control, highly nonlinear
kinetics, catalyst decay, heat exchanger fouling, etc).
A variety of adaptive control techniques are often used in
these situations, where:
The process changes are largely known and can be
anticipated this calls for programmed adaptation, which
is essentially a feedforward strategy.
The process changes are largely unknown this calls for
on-line adaptive control or self-tuning control, and
involves feedback.
11- 32
16
LECTURE ELEVEN
Programmed Adaptation
Gain Scheduling based on knowledge of nonlinearity If
the process gain is known to vary significantly, we can use a
controller with a nonlinear gain: C(s) = f(e) x g(s):
Options for f(e):
a. Continuous gain
(1 ) e , 0 1
f (e) = +
100
If 0, this leads to offset
because the controller is
insensitive to small e.
b. 3-piece nonlinear controller
Kc , e eband
f (e) =
Kc,low , e < eband
11- 34
17
LECTURE ELEVEN
Self-tuning Controllers
When process changes can be neither measured nor anticipated,
programmed adaptation cannot be used. Instead, a feedback
strategy is employed, in which the controller is retuned on-line.
Controller
computation
parameter estimates
input
controller
settings
Process model
parameter
estimation
output
11- 35
18
LECTURE ELEVEN
dCCl
1
=
(F1 (t ) CCl 1 (t ) F (t ) CCl (t ) )
dt
60V
dC Na
1
=
(F2 (t ) CNa 2 (t ) F (t ) CNa (t ) )
dt
60V
pH = log C H , C H (t ) = KW COH (t ) , KW = 10 14 gmol2 /li2
COH (t ) = C Na (t ) + C H (t ) CCl (t )
Defining variables: P = F1 60V ,Q = F2 60V
Ch = CH
11- 37
KW , Cn 2 = C Na 2
KW , Cc 1 = CCl 1
KW
dCh
1
=
(Ch + Cc 1C h2 C h3 ) P
1 + C h2
dt
+ C h + Cn 2C h2 C h3 Q , C h ( 0 ) = 1
11- 38
19
LECTURE ELEVEN
P: 1.5 1.6 at t = 5 s
11- 40
20
LECTURE ELEVEN
11- 41
Summary
On completing this section, you should:
Be able to implement the IMC design procedure on
discrete systems.
21