Professional Documents
Culture Documents
Optimization Algorithms
This chapter covers the theory of LTI feedback optimization algorithms, presented in
terms of manipulations with linear equations and quadratic dissipation inequalities.
5.1.1 Motivation
Not every stable transfer matrix G = G(s) (from w to e) can be obtained by closing a
stabilizing LTI feedback loop K = K(s) in the canonical feedback design setup shown
on Figure 5.1.1. In this section, we investigate the limitations of LTI feedback ability to
change the closed loop transfer matrix, by parameterizing, in convenient terms, the set of
all closed loop systems. Of course, the expression
P11 P12
G = P11 + P12 K(I − P22 K) P21 , where P =
−1
(5.1.1)
P21 P22
119
120
w - - e
- P (s)
u y
K(s)
where G0 , G1 , G2 are fixed stable transfer matrices, and Q is an arbitrary stable transfer
matrix. There is also a convenient time domain interpretation, to be presented later in
this section.
121
For design purposes, the result is extremely important: instead of thinking in terms of
the controller transfer matrix K = K(s), one can be much better off by designing Q(s).
(a) If controller (5.1.6),(5.1.7) stabilizes system (5.1.3)-(5.1.5) then the closed loop
model (5.1.8),(5.1.9) is equivalent to the model defined by the block diagram on
Figure 5.1.2 where Q is the stable system with input θ = θ(t), output v = v(t), and
state xq = xq (t) defined by
with
B2 Df − L
Aq = Acl , Bq = , Cq = Df C 2 − F C f , Dq = Df . (5.1.16)
Bf
Though possibly intimidating, all state space models introduced while formulating
Theorem 5.1.1 allow straightforward “systems” interpretations:
(a) equation (5.1.17) defines a stabdard state observer: using y = y(t) as an input, it
produces an estimate xe = xe (t) of x = x(t) such that the dynamics of the estimation
error ∆(t) = x(t) − xe (t), described by equation (5.1.10), are stable;
(b) the output θ = θ(t) of S1 is the “sensor output estimation error”, i.e. the difference
θ(t) = C2 xe (t) − y(t) between the “sensor output estimate” C2 xe (t) and the actual
measurement y(t);
(c) equations (5.1.14),(5.1.15) with the coefficients defined by (5.1.16) describe the
closed loop dynamics relating sensor noise θ, as shown on Figure 5.1.3, to v(t) =
u(t) − F x(t);
(d) the equations for S2 describe the relation between inputs u(t)−F x(t) = v(t)−F ∆(t),
w = w(t) and the output e = e(t).
123
w=0 e
- -
u P y
-
θ
K ?
d
w - - e
- P
-e -e- Q
6 6
K0 −
0 - -
- P
-e
6
K0
ẋ = ax + bu, y = cx + du,
where the dimensions of x1 , u1 and y1 are n, m and k respectively. Consider the complex
matrix
a − sI b
M(s) =
c d
where s ∈ C is a scalar complex variable. The system is said to have a right zero at a
point s if ker M(s) 6= {0}, i.e. if M(s) is not left invertible, or, equivalently, if there exists
a non-zero pair (X, U) of complex vectors such that
Similarly, the system is said to have a left zero at s if the range of M(s) is not the whole
vector space Cn+k , i.e. if M(s) is not right invertible, or, equivalently, if there exists a
non-zero pair (p, q) of complex vectors such that
As it can be seen from the formulae for T1 and T2 , the restrictions on the closed loop
transfer matrix are caused by the unstable right zeros of the system
ẋ = Ax + B1 w, y = C2 x + D21 w, (5.1.22)
ẋ = Ax + B2 u, z = C1 x + D12 u. (5.1.23)
Indeed, the right zeros of (5.1.22) are the same as the right zeros of
Since A + LC2 is a Hurwitz matrix, a complex number s0 with non-negative real part
is a right zero of G2 if and only T2 (s0 )w0 = 0 for some non-zero vector w0 (possibly
with complex entries). Similarly, s0 such that Re(s0 ) ≥ 0 is a left zero of G1 if and only
q0 T1 (s0 ) = 0 for some non-zero row vector q0 . Therefore the closed loop transfer matrix
125
T = T0 + T1 QT2 satisfies the interpolation constraints T (s0 )w0 = T0 (s0 )w0 for unstable
right zeros of (5.1.22), and q0 T (s0 ) = q0 T0 (s0 ) for unstable left zeros of (5.1.23). It can be
shown that a complete list of such interpolation constraints yields an exact description of
the set of all achievable closed loop transfer matrices T = T (s) in the stabilized system.
Such description can be viewed as dual to (5.1.16).
It can be seen immediately that the right zeros of (5.1.22) cause problems by ob-
structing the observation process, while the left zeros of (5.1.23) describe problems which
a control action will experience even in the case of a complete knowledge of w and x.
denotes the unit step function, is similar to Theorem 5.1.1, but expresses the affine pa-
rameterization in a time-domain format.
Theorem 5.1.2 Let F, L be constant matrices such that A + B2 F and A + LC2 are
Hurwitz matrices. A matrix-valued function E = E(t) is a closed-loop impulse response
from w to e generated in the closed loop system (5.1.3)-(5.1.7) by some stabilizing feedback
controller (5.1.6),(5.1.7) if and only if there exists a function Z = Z(t), elements of which
are finite linear combinations of generalized one-sided exponents tk est λ(t) with Re(s) < 0
(and, in case of a controller which is not strictly proper, Dirac deltas δ = δ(t)), such that
determine H = H(t) and V = V (t) (the Dirac Delta functions dictate the initial con-
ditions for the differential equation), after which equations (5.1.25),(5.1.26) determine
X = X(t) and U = U(t). Naturally, X, U are the closed loop responses from w to x and
u respectively (defined by (5.1.3)-(5.1.7)), and H, V are the closed loop impulse responses
from respectively f and g to u − F x subject to the controller equations (5.1.6),(5.1.7)
combined with
ẋ(t) = Ax(t) + B2 u(t) + f (t), (5.1.29)
y(t) = C2 x(t) + g(t). (5.1.30)
Just as their frequency domain counterpart (5.1.16), the linear equations (5.1.24)-
(5.1.28) define an affine set of stable impulse responses. It is important to understand
that, despite their complicated appearance, equations (5.1.24)-(5.1.28) define a simple
stable state space model
ẽ = cx̃ + dũ, x̃˙ = ax̃ + bũ, x̃(0) = x̃0 , (5.1.31)
where ẽ = ẽ(t) is the column vector made out of the entries of matrix E = E(t), x̃ = x̃(t)
is the column vector made out of the entries of matrices X = X(t) and H = H(t) (while
the components of x̃0 are zeros and the entries of B1 and F ), and ũ = ũ(t) is the column
vector made out of the entries of matrix Z = Z(t).
The proof of Theorem 5.1.2 is similar to the proof of Theorem 5.1.1, and uses the fol-
lowing elementary statements about the relation between state space models and impulse
responses of CT LTI systems:
(S1) if system G is obtained by applying LTI transformation with impulse response q =
q(t) to the output of SCT (a, b, c, d) then its impulse response g is given by
g = hb + qd, where ḣ = ψa + qc, h(t) = 0 for t < 0;
(S2) is system G is obtained by applying SCT (a, b, c, d) to the output of LTI transforma-
tion with impulse response v = v(t) then its impulse response g is given by
g = cx + dv, where ẋ = ax + bv, x(t) = 0 for t < 0.
A dual description of the set of all functions ẽ defined by (5.1.31) with a square
integrable (over {t} = (0, ∞)) input ũ can be given by characterizing all square integrable
row vector functions q and constants v0 such that the identity
Z ∞
q(t)ẽ(t)dt = v0 (5.1.32)
0
Lemma 5.1.1 Let matrices a, b, c, d and vector x̃0 be fixed. Assume a is a Hurwitz
matrix. Identity (5.1.32) is satisfied for all ẽ = ẽ(t) defined by (5.1.31) with a square
integrable ũ = ũ(t) if and only if
where Z ∞
p(t) = q(τ )ce(τ −t)a dτ
t
is the only solution of the differential equation