Lec 03 P 2
Lec 03 P 2
We will see that this novel parametrisation leads to deep insights into
control system design and reinforces, from an alternative perspective,
ideas that have been previously studied.
We will see that this novel parametrisation leads to deep insights into
control system design and reinforces, from an alternative perspective,
ideas that have been previously studied.
We will see that this novel parametrisation leads to deep insights into
control system design and reinforces, from an alternative perspective,
ideas that have been previously studied.
Motivation for the affine parametrisation from the idea of open loop
inversion.
Motivation for the affine parametrisation from the idea of open loop
inversion.
Motivation for the affine parametrisation from the idea of open loop
inversion.
To (s ) = Go (s )Q (s ).
Go ( s ) C ( s )
To (s ) = .
1 + Go ( s ) C ( s )
Go ( s ) C ( s )
To (s ) = .
1 + Go ( s ) C ( s )
Comparing the two previous equations, we see that the former affine
relationship holds if we simply parameterise C (s ) in the following
fashion:
C (s )
Q (s ) = .
1 + Go ( s ) C ( s )
Comparing the two previous equations, we see that the former affine
relationship holds if we simply parameterise C (s ) in the following
fashion:
C (s )
Q (s ) = .
1 + Go ( s ) C ( s )
Q (s )
C (s ) = .
1 − Q (s )Go (s )
Q (s )
C (s ) = .
1 − Q (s )Go (s )
We will then work with Q (s ) as the design variable rather than the
original C (s ).
Q (s )
C (s ) = .
1 − Q (s )Go (s )
We will then work with Q (s ) as the design variable rather than the
original C (s ).
Di (s ) Do (s )
Controller
+ +
R (s ) U (s ) + Y (s )
Q (s ) Plant
+ +
− +
Dn (s )
+
Ym (s )
+
Go (s )
−
EQ (s )
However, it turns out that, in the Q (s ) form this question has a very
simple answer, namely all that is required is that Q (s ) be stable.
Q (s )
C (s ) = .
1 − Q (s )Go (s )
To (s ) = Q (s )G o (s )
So ( s ) = 1 − Q ( s ) G o ( s )
Sio (s ) = (1 − Q (s )Go (s )) Go (s )
Suo (s ) = Q (s )
We are for the moment only considering the case when Go (s ) is stable.
Then, we see that all of the above transfer functions are stable if and only
if Q (s ) is stable.
For the nominal design case (i.e. no modelling errors) we recall that:
To (s ) = Q (s )G o (s )
So ( s ) = 1 − Q ( s ) G o ( s )
Sio (s ) = (1 − Q (s )Go (s )) Go (s )
Suo (s ) = Q (s ).
For the nominal design case (i.e. no modelling errors) we recall that:
To (s ) = Q (s )G o (s )
So ( s ) = 1 − Q ( s ) G o ( s )
Sio (s ) = (1 − Q (s )Go (s )) Go (s )
Suo (s ) = Q (s ).
For the nominal design case (i.e. no modelling errors) we recall that:
To (s ) = Q (s )G o (s )
So ( s ) = 1 − Q ( s ) G o ( s )
Sio (s ) = (1 − Q (s )Go (s )) Go (s )
Suo (s ) = Q (s ).
To (s ) = Q (s )G o (s )
To (s ) = Q (s )G o (s )
To (s ) = Q (s )G o (s )
Q (s ) = (Go (s ))−1 .
To (s ) = Q (s )G o (s )
Q (s ) = (Go (s ))−1 .
Q (s ) = FQ (s ) (Go (s ))−1
Q (s ) = FQ (s ) (Go (s ))−1
Q (s ) = FQ (s ) (Go (s ))−1
Q (s ) = FQ (s ) (Go (s ))i
where (Go (s ))i is a stable approximation to (Go (s ))−1 .
Bos (s )Bou (s )
Go ( s ) =
Ao ( s )
where Bos (s ) and Bou (s ) are the stable and unstable factors in the
numerator, respectively, with Bou (0) = 1.
Bos (s )Bou (s )
Go ( s ) =
Ao ( s )
where Bos (s ) and Bou (s ) are the stable and unstable factors in the
numerator, respectively, with Bou (0) = 1.
i
Ao ( s )
(Go (s )) = .
Bos (s )
Recall, again, the following expressions for the closed loop sensitivity
functions in terms of Q (s ):
To (s ) = Q (s )G o (s )
So ( s ) = 1 − Q ( s ) G o ( s )
Sio (s ) = (1 − Q (s )Go (s )) Go (s )
Suo (s ) = Q (s ).
Recall, again, the following expressions for the closed loop sensitivity
functions in terms of Q (s ):
To (s ) = Q (s )G o (s )
So ( s ) = 1 − Q ( s ) G o ( s )
Sio (s ) = (1 − Q (s )Go (s )) Go (s )
Suo (s ) = Q (s ).
Recall, again, the following expressions for the closed loop sensitivity
functions in terms of Q (s ):
To (s ) = Q (s )G o (s )
So ( s ) = 1 − Q ( s ) G o ( s )
Sio (s ) = (1 − Q (s )Go (s )) Go (s )
Suo (s ) = Q (s ).
Q (s ) = s Q̄ (s ) + (Go (s ))−1 Qa (s )
Q (s ) = s Q̄ (s ) + (Go (s ))−1 Qa (s )
Q (s )
C (s ) = .
1 − Q (s )Go (s )
Q (s )
C (s ) = .
1 − Q (s )Go (s )
For example, say the plant is minimum phase, then we could choose
(Go (s ))i = (Go (s ))−1 .
Q (s )
C (s ) = .
1 − Q (s )Go (s )
For example, say the plant is minimum phase, then we could choose
(Go (s ))i = (Go (s ))−1 .
FQ (s ) (Go (s ))i
C (s ) = .
1 − F Q (s )
1
FQ (s ) =
(τs + 1)r
then, the high frequency gain of the controller, Khf c , and the high
frequency gain of the model, Khf g , are related by:
1
Khf c = r
τ Khf g
1
FQ (s ) =
(τs + 1)r
then, the high frequency gain of the controller, Khf c , and the high
frequency gain of the model, Khf g , are related by:
1
Khf c = r
τ Khf g
1
FQ (s ) =
(τs + 1)r
then, the high frequency gain of the controller, Khf c , and the high
frequency gain of the model, Khf g , are related by:
1
Khf c = r
τ Khf g
(Go (s ))−1
Suo (s ) = Q (s ) =
The University of Newcastle
(τs + 1)r
Lecture 3, Part 2: Affine Parametrisation – p. 22/29
5. Robustness
To (s ) = Q (s )Go (s )
So ( s ) = 1 − Q ( s ) G o ( s )
Sio (s ) = (1 − Q (s )Go (s )) Go (s )
Suo (s ) = Q (s )