Professional Documents
Culture Documents
Basic information
• Controllability: Possibility of changing the states from the input.
• Observability: Possibility of estimating the states from the output.
• Linear dependence (text p. 45):
o Definition: A set of vectors {x1, x2, …, xm} in ℜ n is linearly independent iff
α1 x1 + α 2 x 2 + ... + α m x m = 0 ⇔ α1 = α 2 = ... = α m = 0
o Examples:
T T
§ x1 = [1 0] and x2 = [1 2]
α1(1) + α2(1) = 0
α1(0) + α2(2) = 0 ⇒ α1 = α2 = 0
⇒ they are linearly independent
T T
§ x1 = [1 1] and x2 = [2 2]
α1(1) + α2(2) = 0
α1(1) + α2(2) = 0 ⇒ α1 = -2α2
⇒ they are linearly dependent
• Rank and nullity of a matrix (text p. 48)
o Definition: The rank of a matrix A is the number of linearly independent
columns in A. The nullity of a matrix A is the difference between the total
number of columns and the number of linearly independent columns in the
matrix A. You are required to learn how to use Matlab to find the rank of a
matrix (p.49)
o Example:
1 2 3 1 2 3
rank 4 5 6 =2 rank 4 5 5 =3
7 8 9 7 8 9
• Diagonal form and Jordan form (text p. 55): A square matrix A can be transformed
into a diagonal or block diagonal form using the following transformation (see p. 61
for Matlab usages – eig(a) and Jordan(a)):
Aˆ = Q A Q
−1
Examples:
• Observability:
o Observability is a property of the pair (A, C) and is independent of B and D.
o Definition: A system is observable iff any unknown initial states can be
determined uniquely from the knowledge of the input and the output over a
finite time interval.
o Duality: The pair (A, B) is controllable ⇔ The pair (AT, BT) is observable.
o Requirements: A is n × n and C is q × n
§ The n × n matrix
t T
Aτ
W o (t ) = ∫ e A τ C C e dτ
T
0
is nonsingular for any t > 0.
§ The nq × n observability matrix O
⎡C A 0 ⎤
⎢ ⎥
⎢C A1 ⎥
⎢ ⎥
⎢C A 2 ⎥
⎢ ⎥
O = ⎢. ⎥
⎢. ⎥
⎢ ⎥
⎢. ⎥
⎢ n −1 ⎥
⎢C A ⎥
⎣ ⎦
∞ T
Aτ
W o (t ) = ∫ e A τ C C e dτ
T
⎡C A 0 ⎤
⎢ 1
⎥
⎢C A ⎥
⎢ 2 ⎥
⎢C A ⎥
O n − q +1 = ⎢. ⎥
⎢ ⎥
⎢. ⎥
⎢. ⎥
⎢ ⎥
⎢C A n − q ⎥
⎣ ⎦
T
has rank n or the n × n matrix O n−q+1 O n−q +1 is nonsingular.
o The observability property is invariant under any equivalence transformation.
o The observability indices are invariant under any equivalence transformation
and any reordering of the row of C.
Controllable
Not Observable
Not Controllable
Observable
Not Controllable
Not Observable
• Systematic approach:
o An uncontrollable system can be transformed into a controllable one that has
the same transfer matrix (zero-state equivalent) (P.160, Ex. 6.8).
1) Form the controllability matrix and test the controllability of the system.
2) Determine the matrix Q for the transformation:
a. If rank(A) is n1, the first n1 columns of Q are any n1 linearly
independent columns from the controllability matrix.
b. The remaining columns can be chosen arbitrarily as long as Q is
nonsingular.
3) Let P = Q-1 and perform the following similarity transformation:
A = P A P −1 B = P B C = C P −1 D = D
o An unobservable system can be transformed into an observable one that has
the same transfer matrix (zero-state equivalent).
1) Form the observability matrix and test the observability of the system.
2) Determine the matrix P for the transformation:
a. If rank(A) is n2, the first n2 rows of P are any n2 linearly independent
rows from the observability matrix.
b. The remaining rows can be chosen arbitrarily as long as P is
nonsingular.
3) Perform the following similarity transformation:
A = P A P −1 B = P B C = C P −1 D=D
• Matlab usages (p. 161) – ctrbf and obsvf
Discrete-time systems
• Controllability: Since the output does not affect the controllability, only the internal
state equation ((A, B) pair) is considered here.
o Definition: A system is controllable iff there exists an input that can transfer
any initial state to any final state in a finite time.
o Requirements: A is n × n and B is n × p
§ The n × n matrix
n −1
m T
W dc (n − 1) = ∑ ( A) B B A ( )
T m
m =0
is nonsingular for any t > 0.
§ The n × np controllability matrix
0 1 2 n −1
C d = [ A B A B A B ... A B]
has rank n (full row rank).
§ The n × (n + p) matrix [A – λI B] has full row rank at every λ of A.
§ The unique solution of Wdc – A WdcAT = B BT is positive definite if
the |λs| of A all less than 1. The solution is called the discrete
controllability Gramian and is given by:
∞
m
W dc = ∑ ( A) B B A
T
( )
T m
m =0
• Observability:
o Observability is a property of the pair (A, C) and is independent of B and D.
o Definition: A system is observable iff any unknown initial states can be
determined uniquely from the knowledge of the input and the output over a
finite time interval.
o Duality: The pair (A, B) is controllable ⇔ The pair (AT, BT) is observable.
o Requirements: A is n × n and C is q × n
§ The n × n matrix
n −1
W do (n − 1) = ∑ A ( ) T m T m
C C ( A)
m =0
is nonsingular.
§ The nq × n observability matrix
⎡C A 0 ⎤
⎢ 1 ⎥
⎢C A ⎥
⎢ 2 ⎥
⎢C A ⎥
O d = ⎢. ⎥
⎢ ⎥
⎢. ⎥
⎢. ⎥
⎢ ⎥
⎢C A n −1 ⎥
⎣ ⎦
has rank n (full column rank).
⎡ A − λ I ⎤
§ The (n × q) × n matrix ⎢ ⎥ has full row rank at every λ of A.
⎣ C ⎦
§ The unique solution of Wdo – AT WdoA = CT C is positive definite if
the |λs| of A all less than 1. The solution is called the observability
Gramian and is given by:
∞
W do = ∑ A ( )
T m T
C C ( A)
m
m =0