Controllability 2026-10-13
Controllability asks whether the available control inputs can move a dynamical system between every pair of states in its declared state space. Fixing a duration gives the precise condition for every , where is the state space and its reachable set. With freely chosen duration, every pair must instead be connectable in some permitted finite time, which may depend on the pair. Always specify admissible control inputs, deadlines and any constraints along the path. [ref]
The surprising part is that one control input can control several state variables by acting at different times. For the double integrator, acceleration changes velocity directly, while the accumulated velocity changes position. Starting from rest, accelerate during the first half of the journey and brake during the second: the final velocity can vanish although the final position has changed. The figure is an analytic mathematical example in dimensionless quantities, with no experimental measurements.
Figure 1.
Timing one control input controls both position and velocity
. The double integrator starts at and runs to . Left: for one time unit, then for one time unit. Middle: the analytic state path ends at , after reaching when braking begins. Right: unit inputs on the first and second halves separately contribute and to the endpoint. Their linear combinations fill the plane when input amplitudes are unrestricted real numbers; subtracting the second contribution from the first gives . Details.
Controllability is useful before trying to design a controller: a requested endpoint outside the reachable set cannot be attained by clever choice of feedback control. The Kalman rank criterion makes this an exact linear algebra calculation for the stated linear time-invariant system model. It concerns whole states, so attaining one plant output is not enough to establish controllability. In quantum control, the declared state space may be an orbit constrained by conservation laws; see quantum controllability and unitary orbit of a density operator.
Reachability in control theory asks about a particular initial state and target : does some admissible control input make at the declared time , or at some allowed duration? Controllability requires this for every pair in the declared state space. This is a property of state evolution, distinct from graph reachability.
For a linear time-invariant system, solving the ordinary differential equation by a matrix exponential gives
The first term is the unforced endpoint. Reachability in control theory asks whether the control input can supply exactly the displacement . The timing matters because the same command is carried by different amounts of subsequent dynamics. [ref]
Here is a contrasting mathematical example with one shared control input:
The controllability matrix has rank of a matrix one. Since , the difference is invariant under every allowed control input. From the reachable set is the diagonal when input amplitudes are unrestricted: is reachable at using , while is impossible at every duration. Having a control input appear in both state equations did not give independent control of both states. This reachable set is pictured alongside the bounded double integrator below.