8.3 Optimal Tracking, Servo Problem, and Disturbance Rejection 317
and after some manipulations
¯
A
T
P + P
¯
A = −
¯
Q (8.88)
This is the Lyapunov equation. It is known that for an arbitrary symmetric
positive definite matrix
¯
Q there a is symmetric positive definite matrix P that
is solution of this equation if matrix
¯
A is asymptotically stable.
When
¯
A is back-substituted into (8.88) from (8.79) and
¯
Q from (8.84),
then we obtain
(A −BK)
T
P + P (A − BK)=−Q −
R
−1
B
T
P
T
R
R
−1
B
T
P
(8.89)
This equation can be easily rewritten to the form (8.75).
It is important to observe that the optimal feedback control shown in
Fig. 8.3 places optimally poles of the closed-loop system.
Pole Placement (PP) represents such feedback control design where the
matrix K in (8.79) is chosen so that the matrix
¯
A is asymptotically stable.
LQR control is in this aspect only a special case of the PP control design.
Consider now a system
˙x(t)=Ax(t)+Bu(t), x(0) = x
0
(8.90)
y(t)=Cx(t) (8.91)
and cost function
I =
1
2
∞
0
y
T
(t)Q
y
y(t)+u
T
(t)Ru(t)
dt (8.92)
Substituting equation (8.91) into (8.92) yields
I =
1
2
∞
0
x
T
(t)C
T
Q
y
Cx(t)+u
T
(t)Ru(t)
dt (8.93)
Denote as
Q = C
T
Q
y
C (8.94)
then the cost function (8.93) is of the same form as (8.72) and the output
regulation problem has been transformed into the classical LQR problem. So-
lution of the optimal problem, i. e. minimisation of I from (8.93) for arbitrary
x
0
guarantees the state feedback given by equation (8.73). The block diagram
of output LQR is shown in Fig. 8.7.
8.3 Optimal Tracking, Servo Problem, and Disturbance
Rejection
Previous section was devoted to the problem when a system was to be steered
from some initial state to a new state in some optimal way. In fact, this is
only a special case of a general problem of optimal setpoint tracking.