Controllability and Observability
Controllability and observability of linear systems. Feedback and pole placement, observer design, canonical forms, and Riccati equations for stabilizing controllers.
Controllability
Consider
where is and is . However, for simplicity, in the derivations below throughout the chapter, we will assume that .
The pair is said to be controllable if for any and , there exists and a control input so that .
Intuition: Controllability asks whether the input has enough "reach" to steer the state from any starting point to any target point in finite time. If some part of the state space is untouched by the input -- no matter what you apply -- the system is not controllable. Think of it as checking whether you have full authority over the system's state through your control input.
Consider the following:
In this case, if are both 0, it is evident that the system is not controllable: for every given , the future paths are uniquely determined.
Consider, now the more interesting case with . In this case, if the initial condition takes values from the subspace determined by the line , then, for all , the state remains in this subspace. To see this, note that so that the sum of the state components does not change and thus remains 0. Thus, this subspace, which is a strict subset of , is invariant no matter what control is applied: this system is not controllable.
Conditions (i), (ii), (iii), and (iv) below are equivalent:
(i) is controllable.
(ii) The matrix
is full-rank for every .
(iii) The controllability matrix
is full-rank.
(iv) The matrix
has full rank (i.e., rank ) at every eigenvalue of .
Intuition: This theorem gives four different lenses on the same property. Condition (ii) uses the controllability Grammian -- a matrix that accumulates the "energy" the input can inject into each state direction. Condition (iii) is the most computationally practical: just stack and check rank. Condition (iv), the PBH (Popov-Belevitch-Hautus) test, checks that at every eigenvalue of , the input can still influence the corresponding eigenspace -- no mode is "hidden" from the input.
The matrix above is called the controllability Grammian of .
Reachable Set (from origin) and the Controllable Subspace. An implication of the proof of the equivalence between (ii) and (iii) is that the range space of and the range space of the linear operator from the space of integrable control inputs to defined with
are equal. This set is called the reachable (from the origin) set. This set is also called the controllable subspace.
Exercise. The controllability property is invariant under an algebraically equivalent transformation of the coordinates: for some invertible .
Hint: Use the rank condition and show that with and , , and with , we have that the transformed controllability matrix writes as .
Observability
In many problems a controller has access to only the inputs applied and outputs measured. A very important question is whether the controller can recover the state of the system through this information.
Consider
The pair is said to be observable if for any , there exists such that the knowledge of is sufficient to uniquely determine .
Intuition: Observability asks whether we can reconstruct the internal state of a system purely from what we can measure (the output ) and what we know we applied (the input ). If some state components have zero effect on the output -- they are invisible to the sensor -- then the system is not observable. It is the "dual" question to controllability: instead of "can we push the state anywhere?", it asks "can we see where the state is?"
In the above, we could consider without any loss that for all , since the control terms appear in additive forms whose effects can be cancelled from the measurements.
Consider then
The measurement at time writes as:
Taking the derivative:
and taking the derivatives up to order , we obtain for
In matrix form, we can write the above as
Thus, the question of being able to recover from the measurements becomes that of whether the observability matrix
is full-rank or not. Note that adding further rows to this matrix does not increase the rank by the Cayley-Hamilton theorem. Thus, we can recover the initial state if the observability matrix is full-rank.
Furthermore, we have that is a linear combination of . Therefore, if is orthogonal to , then it is also orthogonal to . In particular, if the observability matrix is not full-rank, then there exists a non-zero so that . Thus, we cannot distinguish between and the vector in and thus the system is not observable.
The system
is observable if and only if
is full-rank.
Intuition: Just as the controllability matrix checks whether the input can reach every state direction, the observability matrix checks whether every state direction eventually shows up in the output. Each row represents the information gained from the -th derivative of the output. If such measurements span all of , no state can hide.
The null-space of , that is, is called the unobservable subspace.
The structure of the observability matrix and the controllability matrix leads to the following very important and useful duality result.
is observable if and only if is controllable.
Intuition: This duality is one of the most elegant results in linear systems theory. It says that observability and controllability are two sides of the same coin -- any theorem about controllability immediately gives a theorem about observability by transposing the matrices. The observability matrix of is exactly for the pair .
By the duality theorem and the PBH test (Theorem(iv)), is observable if and only if the matrix
has full column rank (i.e., rank ) at every eigenvalue of . This is the PBH test for observability: no eigenmode of can be invisible to the output .
In view of Theorem (and in particular, now that we have related observability to a condition of the form given in Theorem(iii)), we have the following immediate result:
is observable if and only if
is invertible for all .
Intuition: The observability Grammian accumulates how much "information" the output reveals about each state direction over time. If it is invertible, every state direction has been sufficiently excited in the output for reconstruction. This is the direct dual of the controllability Grammian .
Feedback and Pole Placement
Consider . Then,
The eigenvalues of can be placed arbitrarily if and only if is controllable.
Intuition: If we have full control authority (controllability), we can shape the system's dynamics however we like by choosing the right feedback gain . This is the core promise of state feedback design: controllability guarantees that every mode of the system can be moved to any desired location in the complex plane, enabling arbitrary stability and performance specifications.
To see this result, first consider a system in the controllable canonical realization form (see the relevant section) with
Note that, the eigenvalues of solve the characteristic polynomial whose coefficients are located in the bottom row of (see the proof of Theorem).
Now, apply so that , leading to
Once again, since the eigenvalues of this matrix solve the characteristic polynomial whose coefficients are located in the bottom row (by the proof of Theorem), and these coefficients can be placed by selecting the scalars , we can arbitrarily place the eigenvalues of the closed-loop matrix by feedback.
Through a coordinate transformation , every controllable system can be transformed to an algebraically equivalent linear system in the controllable canonical realization form above. As we saw, for a system in this form, a control can be found so that all the eigenvalues of the closed loop system are on the left-half plane. Finally, the system can be moved back to the original coordinates.
We now see how this (transformation into a controllable canonical realization form) is possible. With , we have that
with , . Now, if is controllable, we know that is full-rank. The transformed controllability matrix writes as: . As a result,
whose validity follows from the fact that is invertible. This leads us to the following conclusion.
Consider where . Every such system, provided that is controllable, can be transformed into a system with the transformation so that is in the controllable canonical realization form.
Intuition: This theorem says that controllability guarantees we can always find a change of coordinates that puts the system into a standard "canonical" structure where pole placement becomes trivial. The transformation is constructive -- it gives you a concrete recipe for computing the coordinate change.
The above then suggests a method to achieve stabilization through feedback: First transform into a controllable canonical realization form, place the eigenvalues through feedback, and transform the system back to the original coordinate.
Observers and Observer Feedback
Consider
Suppose that the controller intends to track the state. A candidate for such a purpose is to write an observer system of the form
We then obtain with , and subtracting the above two equations from one another
Then, the question whether is determined by whether the eigenvalues of can be pushed to the left-half plane with some appropriate . If the system is observable, then this is possible, with the same arguments applicable to the pole placement analysis presented in the previous section (note that controllability and observability are related to each other with a simple duality property that was presented in Theorem: that is can be selected so that has all eigenvalue in the left-half plane, which will also imply that will have the same property).
Now that under observability we have that the controller can track the state with asymptotically vanishing error, suppose that we consider
with the goal of stabilizing the actual system state .
Suppose that we run an observer, and that we consider the following feedback control policy
where is what we used for pole placement, and is what we used in our observer. In this case, we obtain the following relation:
Due to the upper triangular form, we conclude that if both and are stable matrices; two conditions that we have already established under controllability and observability properties. Such a design leads to the separation principle for linear control systems: run an observer and apply the control as if the observer state is the actual state. This design is stabilizing.
Intuition: The separation principle is remarkably powerful: it says you can design the controller () and the observer () independently, and when you combine them, the closed-loop system is stable. The upper triangular block structure of the combined dynamics is the key -- the observer error evolves independently of the state, so the two designs do not interfere with each other.
Canonical Forms
(i) If is in the controllable subspace, then so is .
(ii) If is in the unobservable subspace, then so is .
That is, the controllable and unobservable subspaces are -invariant.
Intuition: -invariance means that the system dynamics cannot push states out of these subspaces. If a state direction is reachable by the input, applying the system dynamics keeps it reachable. If a state direction is invisible to the output, it stays invisible after the dynamics act. This structural property is what allows the block-triangular decompositions that follow.
Controllable canonical form
If a model is not controllable, then we can construct a state transformation with the form with
In the above is controllable. In the above, is some submatrix. The form above is called a controllable canonical form.
The matrix can be obtained with constructing to consist of the following: Let be the rank of the controllability matrix . Then take the first columns of to be linearly independent columns of , and the remaining columns are arbitrary vectors which make invertible. If we write
we have that
Using the fact that the controllable subspace is invariant, it follows that the structure of has to have the given structure.
An implication of the above analysis is that
Observable canonical form
A similar construction applies for observable canonical forms.
with the property that is observable.
An implication of the above analysis is that
Kalman decomposition
One can apply a joint construction, known as Kalman's decomposition. There exists a coordinate transformation so that
with
leads to
where is both controllable and observable. Furthermore,
A corollary of the above discussion is that the minimal realization; that is, the state-space realization with the smallest dimensions involving matrices, is attained when the system is both controllable and observable, as there are no redundant state variables.
Stabilizability and detectability. From the controllable canonical form, we can also establish the following result.
A linear system is stabilizable (in the sense of local or global asymptotic stability) by control if and only if , whenever exists, is a stable matrix (i.e., with eigenvalues strictly in the left half plane).
Define a control-free system to be detectable if whenever then . A consequence of the observable canonical form is that a system is detectable if and only if , whenever exists, is a stable matrix.
Using Riccati Equations to Find Stabilizing Linear Controllers [Optional]
While controllability and observability properties reveal what is possible or impossible with regard to stabilization, they don't directly present an easy-to-compute or constructive method for arriving at design.
One effective method is through Riccati equations. We will present the discussion for discrete-time, but the approach is essentially identical for continuous-time (with the stability conditions of linear systems, as noted earlier, being different).
Controller design via Riccati equations
Consider the following linear system
where , .
Suppose that we would like to minimize the expression over all control laws:
with , .
Consider the system .
(i) If is controllable there exists a solution to the Riccati equation
(ii) If is controllable and, with , is observable; as , the sequence of Riccati recursions, for with arbitrary,
converges to some limit that satisfies the algebraic Riccati above. That is, convergence takes place for any initial condition . Furthermore, such a is unique, and is positive definite. Finally, under the control policy
is stable.
(iii) Under the conditions of part (ii), the control minimizes .
Intuition: The Riccati provides a constructive, computational recipe for optimal control design. Instead of just knowing that pole placement is possible (from controllability), the Riccati approach tells you exactly which feedback gain to use -- one that minimizes a quadratic cost balancing state regulation () against control effort (). The iterative Riccati recursion converges from any starting point, making it numerically robust. This is the foundation of LQR (Linear Quadratic Regulator) design.
In the above, we established a method to find so that is stable: Run the recursions, for any arbitrary initial condition, find the limit and select with
This controller will be stabilizing.
Observer design via Riccati equations
A similar phenomenon as applies for observer design. In fact, with the above discussion, using the duality analysis presented earlier, we can directly design an observer so that the matrix is stable. By writing the condition as the stability of , the question becomes that of finding for which is a stable matrix.
Let be observable. In Theorem, if we replace with , with , and defining for any with controllable, we obtain:
or the Riccati equations
whose limit as for any initial will converge to a unique limit. Finally, taking
will lead to the conclusion that is stable.
Putting controller and observer design together
Accordingly, all we need for the system:
is that be controllable and be observable. With the controller gain and observer gain from above, we can find and so that the system
or, equivalently, with , the system defined with
is stable.
In the above, the conditions on being controllable and being observable can be relaxed: controllability can be replaced with stabilizability and observability can be relaxed to detectability. While stability will be maintained, the only difference would be that or would not be guaranteed to be positive-definite.
Continuous-time case
A similar discussion as above applies for the continuous-time setup. We only discuss the control design, as the observer design follows from duality, as shown above.
Consider
Let , . The only difference with the continuous-time is that the discrete-time Riccati equations above are replaced by a corresponding Riccati differential equation:
If is controllable and, with , is observable, then there exists a unique positive-definite matrix such that the following algebraic Riccati equation is satisfied:
With this , the control given by
is so that is stable.
Applications and Exercises
Exercise. Recall that we had studied the controlled pendulum on a cart (see Figure 12.1). The non-linear mechanical/rotational dynamics equations were found to be
Around , , we apply the linear approximations and , and to arrive at
Finally, writing , , , , we arrive at the linear model in state space form
where .
a) When is the linearized model controllable?
b) Does there exist a control policy with that makes the closed loop linearized system stable? Select specific values for so that controllability holds, and accordingly find an explicit .
c) With the controller in part b), can you conclude that through the arguments presented in the previous chapter (e.g. Theorem), that your (original non-linear) system is locally asymptotically stable?
Hint: a) With
we have that
You will be asked to find the condition for this system to be invertible in your homework assignment.
b) By controllability, we can place the eigenvalues of the matrix arbitrarily. Find an explicit . You can use the method presented earlier in the chapter, or try to explicitly arrive at a stabilizing control matrix.
c) Then, by Theorem, the system is locally stable around the equilibrium point. Precisely explain why this is the case.
Exercise. Consider the linear system
Is this system controllable? Does there exist a matrix so that with , the eigenvalues of the closed-loop matrix: can be arbitrarily assigned?
Exercise. Consider
with
a) Is this system observable? b) Is this system controllable? c) Provide a stabilizing feedback control policy by running an observer.
Hint: a) and b) Yes. c) The system is both controllable and observable. If the system state were available, we could have and select so that is stable. Find such a . Now, we can run an observer as explained in the relevant section:
with the property that is stable. Find such an . Then, the control to be applied would be: . Find explicit values.
Exercise. a) Show that controllability is invariant under an algebraically equivalent transformation of the coordinates: for some invertible .
Hint: With and , , and with , we have that the transformed controllability matrix writes as . Since is invertible, .
b) Consider
Express, through a transformation, this system in a controllable canonical realization form.
Hint: The characteristic polynomial of is . The controllability matrix is , which has full rank when . The controllable canonical form has and . The transformation where .
Exercise. Consider
with
a) Is this system observable? b) Is this system controllable? c) Provide a stabilizing feedback control policy by running an observer.
Note. The model here and the model for given in Exercise are related.
Solution. The system is both controllable and observable. If the system state were available, we could have and select so that is stable. Find such a .
Now, we can run an observer as explain in the lecture notes:
with the property that is stable. Find such an . Then, the control to be applied would be: .