Lect 06 Hand Out
Lect 06 Hand Out
Lect 06 Hand Out
Fiagbedzi-Pearson reduction
sh
lecture no. 6
Leonid Mirkin
Nontrivial complication
Consider
h W x.t/
P
D A0 x.t / C Ah x.t
h/ C Bu.t /;
complicates matters
Workaround:
I
namely, unstable ones (we know that there is only a finite number of them).
x.t
Q / Qx.t / C
eA.t
h/
t h
Q n
Q
Q
for some AQ 2 Rn
and Q 2 Rnn
. Then,
Z t
Q
Q
Px.t/
Q
Q
D Qx.t
P /CA
eA.t h/ QAh x./d C e Ah QAh x.t / QAh x.t h/
t h
Z t
Q
Q
D QA0 x.t / C QBu.t / C AQ
eA.t h/ QAh x. /d C e Ah QAh x.t /
t h
D AQx.t/
Q C QBu.t /
Q
AQ
QA0
Q
Ah
QAh x.t /:
Q
Ah
QAh ;
PQ / D AQx.t
Q W x.t
Q / C QBu.t /:
(l.c.m.e.)
Q D QA0 C e
Properties of solutions of l.c.m.e. AQ
Q
Ah
QAh
Q
Ah
Q
h
QAh D Q.A
Q
0Ce
Ah /:
Q
h
Ah / D 0, so that
whenever Q
Q 0, every eigenvalue of AQ is a pole of h
A0
A0
Closed-loop spectrum
Ah e
Q
A.t
h/
t h
/).
FQ Q
sI
FQ e
A0 Ah e
Q Rh
Ah
.sI
0 e
sh
Q
A/
dQAh
B
I
X.s/
D I.C. :
U.s/
.sI
Because
Q
Ah
Q
.sI A/
d QAh
0
Ah
sh
I /QAh D Q.sI
Ah e
A0
sh
/;
Q
Ah
Q
.sI A/
.s/ D
d QAh D .sI
FQ .sI
Q 1 Q.sI
A/
sI A0 Ah e sh
Q 1 Q.sI A0 Ah e
A/
Ah e
A0
sh
B
I
sh
/:
D det I
B
:
I
A0 Ah e sh / B FQ .sI
Q 1 Q det.sI
B FQ .sI A/
Q 1 Q.sI
A/
A0
Ah e
A0
cl .s/ D
In other words,
sh
/:
Ah e
sh
AQ Q
AQ C QB FQ Q
D
B FQ I
B FQ
I
FQ .sI
Q
Q 1 QB D det.sI A
A/
det.sI
QB FQ /
Q
A/
and thus
and
cl .s/ D det .sI
A0 Ah e sh
Q Rh
Q
Ah
.sI A/
dQAh
0 e
we have that
det I
QCe
Then
Q C .e
AQ
D sQ
so that
sI
FQ Q C e
Next,
Q
A/ Q C e
det.sI A0
det.sI
Ah e
Q
A/
sh
det.sI
AQ
S
Q
spec.h;cl / D spec.h / n spec.A/
spec.Q cl /
Q spec.h /).
(remember, spec.A/
I
QB FQ /:
Implications
Thus, if we can
Let
I
I
h W x.t
P /D
Then transformation
Z
u.t/ D FQ Qx.t / C
eA.t
h/
t h
Q to the
stabilizes h by moving all its unstable modesthose in spec.A/
Q
Q
eigenvalues of A C QB F and keeping the other modes of h untouched.
x.t/
Q
Qx.t / C
t
t h
0
h
. /x.t C / C . /u.t C / d :
t
eA.t
h
with l.c.m.e.
Q D
AQ
and
I
Q D
Not quite, solving AQ
I
(l.c.m.e.0 )
eA Q./d
h
where BQ
eA Q./d
h
S
Q
spec.h;cl / D spec.h / n spec.A/
spec.Q cl /.
Example
0
Let
h W x.t
P /D
x.t / C x.t
h/ C u.t /;
Q ./x. / C ./u./ d d
Is it that simple ?
C/
h .s/ D s C 1
sh
D C 1 C j!
h
j!h
60
6
6
./ D 6 :::
6
40
:: : :
:
:
0
0 0
3
2
0
60
7
7
6
:: 7 . / C X 6 ::
7
6:
:7
6
i
40
5
0
0
::
:
0
:: : :
:
:
0
0
3
7
7
:: 7 . C h /
i
:7
7
0 5
0 0
::
:
. C 1/2 C ! 2 D e
2h
lim
e
s
sh
h
D 1 C h;
s!0 1
D 1 C lim
Example (contd)
Outline
Thus, we have only one unstable pole to shift and may pick nQ D 1, AQ D 0.
Eqn. (l.c.m.e.) then reads 0 D q C q , so we may pick q D 1. Then
Fiagbedzi-Pearson reduction
PQ / D u.t/;
Q W x.t
Z
k x.t / C
x./d
t h
/:
1
k 1C
e
s
sh
2 H 1:
d
y
Pr .s/e
sh
wu
u
eQ
CQ .s/
Pr .s/.1
sh
Pr .s/e
sh
C.s/
wy
C.s/
1
Pr C e
sh
1 Pr e sh
S Td
2 H 1:
C Pr C e sh
Tu T
Lets
I
Loop shifting
Pr .s/
Pr .s/e
Pr .s/.1
Pr .s/.1
CQ .s/
sh
sh
Pr .s/
Pr .s/e
Pr .s/.1
sh
Pr .s/.1
sh
sh
CQ .s/
C.s/
wy
CQ .s/
/ we
Pr .s/.1
We end up with a new loop with the plant Pr and the controller
C
CQ
Q
C
so
that
C
D
1 C CPr .1 e sh /
1 CQ Pr .1 e
sh /
Pr .s/.1
CQ .s/
Pr .s/
CQ .s/
uQ
wy
yQ
wQ y
1. if Pr .1
2. if Pr .1
sh
y
u
1 Well,
wQ y
wy
D
wQ u
sh
./wu
C.s/
wy
sh
C.s/
sh
wQ y
Pr .1
sh
I
Q
Tcl
0
Pr .1
I
sh
sh
Key question:
I
Pr .1 e
wu
sh
/wu
I
0
Pr .1
when does Pr .1
sh
/ 2 H1 ?
and
Pr .s/.1
(in fact, never; this can be verified by making use of explicit form of TQcl )
different signals.
I
Tcl D
0
Pr .s/
yQ
Thus,
wQ u
sh
C.s/
sh
sh
wu
Pr .s/.1
wy
wu
sh
wu
Pr .s/e
Pr .s/
Pr .s/e
sh
C.s/
wu
sh
sh
wy
:
wu
Pr .s/ proper and its only unstable poles are single poles at j 2
k , k 2 Z,
h
sh
Outline
Fiagbedzi-Pearson reduction
Pr .s/
Pr .s/e
sh
Pr .s/.1
sh
Pr .s/.1
sh
CQ .s/
C.s/
wy
sh
C Pr .s/.1
sh
/ D Pr .s/.
The question:
I
Pr .s/e
PQ .s/
sh
wu
Pr .s/e
wQ u
sh
.s/
u
.s/
CQ .s/
C.s/
Pr .s/e
C .s/ D PQ .s/
C.s/
uQ
wy
CQ .s/
yQ
wQ y
PQ .s/
C.s/ D CQ .s/ I
.s/CQ .s/
CQ .s/
.s/
I
0
.s/ Q
I
Tcl .s/
I
0
.s/
I
sh
as
s
d 2 H 1
.s/ D
e
s
Pr .s/e
sh
Res
sh
I0
C .s/
for some entire .s/ (Pr .s/ has only one pole, that at the origin).
2 Here
As Pr .s/e
sh
1
s
sh
Likewise,
1
2 H 1:
e
1
1
,
s a
e sh I a
e ah
C .s/ D
s a
s a
1
s a
ah
the choice
e
PQ .s/ D
s
e ah
.s/ D
s a
again.
sh
De
Res
ah
gives us required
sh
so that if Pr .s/ D
Res s 1 1 e sh I 1
e h
Q
P .s/ D
D
;
s 1
s 1
.s/ D
.s 1/
d 2 H 1 :
e sh
De
s a
ah
e
0
.s a/
d 2 H 1
e
a
sh
it t < h
ea.t
h/
and PQ .s/ D
p.t
Q /D
and
if t h
sh
e
a
(
0
1
s
e
a
ah
Completion operator
are
ea.t
h/
.t/ D p.t/
Q
p.t / D
ea.t
sh
h/
A B
C 0
if t 0
then
it t < 0 or t h
h G.s/e
sh
Q
G.s/
h .t / D
h/
if 0 t < h
otherwise
h G.s/e
sh
h .t /e
0
y.t/ D C
eA.t
t h
h/
sh
sh
sh
if t h
A
B
C e Ah 0
A B
e
C 0
st
dt D
u writes
Bu. /d D C
C eA.t
h/
Be
st
dt
eA.
0
A B
:
Pr .s/ D
C 0
We can always choose .s/ D h Pr .s/e sh 2 H 1 , for which
h/
Bu.t
/d:
is indeed rational.
sh
sh
Q , so we call it completion of
to rational G.s/
Let
PQ .s/ D Pr .s/e
I h G.s/e sh stable for every proper rational G.s/.
Ce
(
C eA.t
it t < h
A.t h/
G.s/e
sh
is
LTI system
if 0 t < h
(
0
sh
Q
We are looking for rational G.s/
such that g.t
Q / gh .t /, 8t h. Obviously,
(
0
it t < 0
A
B
Q
:
g.t/
Q
D
so that G.s/ D
C e Ah 0
C e Ah eAt B if t 0
8t h:
Pr .s/e
(
0
it t < 0
respectively. Thus,
p.t/ p.t/;
Q
Let G.s/ D
C h Pr .s/e
sh
A
B
D
Ah
Ce
0
Example 1
y
CQ .s/
h Pr .s/e
sh
d
y
1
s 1
sh
eQ
2eh
e
Then,
I
I
h Pr .s/e
sh
CQ .s/
and
s 1
sh
s 1
C.s/
Transfer function
C.s/ D CQ .s/ I
and then
2eh .s 1/
;
sC1
2eh
e
sC1
T .s/ D
1
2.1 e .s
Td .s/ D
1C
sC1
s 1
1/h
sh
sh
Outline
Observer-predictor revised
Let Pr .s/ D
Fiagbedzi-Pearson reduction
A B
C 0
xP .t / D .A C LC /x .t / C Bu.t
o
eA.t
t h
Ly.t /
/
Bu. /d
h/
Z
u.t / D F eAh xo .t / C
Z
eA.t
/
Bu./d
t h
eAh Bu.t
eAh L y.t /
h/ Ly.t /
Z t
h/
A
e
t h
C xo .t / :
A.t /
Bu. /d
P D .A C BF C e
u.t/ D F .t /
Substituting xo .t/ D e
Ah
.t /
.t/
P D .A C e
eA.t
h /
Bu./d , we get
Ah
LC e Ah /.t / C Bu.t /
Z t
Ah
e LC
eA.t h / Bu./d
LC e
e L yCC
A.t h /
t h
u.t/ D F .t/
for
CQ .s/
h Pr .s/e
t h
sh
A C BF C eAh LC e
Q
C .s/ D
F
Ah
eAh L
:
0
Outline
u
CQ .s/
h Pr .s/e
sh
Fiagbedzi-Pearson reduction
Ah
eAh L
;
0
/
Ah
eAh Ly.t/
Connections
Ah
u D F
t
t h
Ah
Ah
D eAh .A C LC /e
Ah
is Hurwitz). Thus,
observer-predictor is MSP when primary controller CQ is observer-based
controller for PQ
sh
Bu. /d
when u is
We say that transfer function P .s/ has (strongly) coprime factorization over
H 1 if there are transfer functions
wu
P .s/
such that
P .s/ D N.s/M
and
X.s/ Y .s/
NQ .s/ MQ .s/
.s/ D MQ
.s/NQ .s/
M.s/ YQ .s/
I 0
D
:
Q
0 I
N.s/ X.s/
C.s/
wy
Theorem
There is controller C.s/ internally stabilizing this system iff 3 P .s/ has strong
coprime factorization over H1. In this case all stabilizing controllers can be
parametrized as (Youla parametrization)
1
Q
YQ .s/ C M.s/Q.s/ X.s/
C N.s/Q.s/
1
Y .s/ C Q.s/MQ .s/
D X.s/ C Q.s/NQ .s/
C.s/ D
se
se s
D
sC1
A B
C D
A C LC B C LD
X.s/ Y .s/
4
D
F
I
NQ .s/ MQ .s/
C
D
3
L
0 5
I
and
wy
C.s/
nontrivial part here, only if, was proved by Malcolm C. Smith (1989).
1
sC1
2
A C BF B
Q
M.s/ Y .s/
4
D
F
I
Q
N.s/ X.s/
C C DF D
3
L
0 5;
I
Let P .s/ be (not necessarily rational) proper transfer function such that
Lemma
P .s/ D Pa .s/
P .s/ D Pa .s/
.s/
Xa .s/ Ya .s/
NQ a .s/ MQ a .s/
Ma .s/ YQa .s/
I 0
D
:
0 I
Na .s/ XQ a .s/
X.s/ Y .s/
Xa .s/ Ya .s/
I 0
D
2 H1
NQ .s/ MQ .s/
NQ a .s/ MQ a .s/ .s/ I
and
M.s/ YQ .s/
I
0
Ma .s/ YQa .s/
D
2 H1
.s/ I
N.s/ XQ .s/
Na .s/ XQ a .s/
Proof.
By direct substitution.
Dead-time systems
If
C D . YQ C MQ/.XQ C NQ/
Hence,
C.XQ a C Na Q/
P .s/ D Pr .s/e
D . YQa C Ma Q/ XQ a C Na Q
. YQa C Ma Q/
C. YQa C Ma Q/ D
sh
A B
e
D
C 0
sh
YQa C Ma Q
or, equivalently,
h
P .s/ D
A
B
Ah
Ce
0
h
A B
e
C 0
sh
.I C C/ 1 C D Ca
C D Ca .I
Ca /
Ca .s/
.s/
h Pr .s/e
sh
CQ .s/