Controllability Gramian 2026-10-14
For and the constant matrices over the real numbers in the Kalman rank criterion, the finite-time Controllability Gramian accumulates the influence of all command times. Its column space equals that of the controllability matrix, and is a symmetric positive-definite matrix exactly when the controllability matrix has rank of a matrix . If so, put . Among square-integrable functions steering to at , the command
minimizes , with value . Here in a matrix superscript denotes transpose. This cost is a squared input norm, not necessarily physical energy, and the optimizing command need not satisfy an amplitude bound. [ref]
For the double integrator, , so direct integration gives
For a rest-to-rest distance , and the minimum squared input norm is . Compare the two constant commands in the double integrator example, whose cost is : both attain the target, but the smooth command costs less. At , , however, peaks at , so it violates while the two constant commands remain admissible. Controllability, optimal control, and constrained reachability in control theory answer different questions.
Controllability matrix 2026-10-14
For the linear time-invariant system , with and , the controllability matrix has rows and columns. The columns of are directions influenced directly by the control inputs; account for how the dynamics carry their influence into further directions. The column space of the controllability matrix is the zero-state reachable set for any when inputs are unrestricted. [ref]
Kalman rank criterion 2026-10-14
For a finite-dimensional continuous-time linear time-invariant system on , with constant matrices over the real numbers, no state constraints, and every piecewise continuous function allowed as a control input without an amplitude bound, controllability in any fixed is equivalent to the controllability matrix having rank of a matrix . The same equivalence holds with all square-integrable functions as inputs. A stronger useful statement is
where is a matrix exponential and is the column space. Thus a rank of a matrix leaves only an -dimensional affine subspace reachable at that time. [ref]
The Kalman rank criterion allows arbitrarily large commands as shrinks. It does not assert controllability with bounded control inputs, nor test a general nonlinear dynamical system just by counting its inputs. For the double integrator, and give two independent directions, despite there being only one control input.
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.