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 givesThe 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]
https://ee263.stanford.edu/archive/contr.pdf. Stephen Boyd, EE263: Controllability and state transfer, slide 18–3
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.
The reachable set collects all endpoints attainable from at exactly by admissible control inputs. If arrival any time up to is allowed, use , with . These definitions differ: a general dynamical system may drift away after early arrival, so waiting need not preserve the target. The reachable set is always relative to a declared input class and any constraints on the entire path.
For the double integrator starting from , now require measurable functions as control inputs with almost everywhere. Write for its endpoint at . Two integrals determine the endpoint:Our mathematical example has the exact reachable setTo see the upper boundary, fix : put first and last, switching at . This maximizes the weighted integral for position because early commands have the largest weight ; the required net velocity fixes . Formally, has the same sign as this maximizing command, so changing to any other admissible command with the same integral cannot increase . Reversing the order gives the lower boundary. Pointwise convex combinations of these two commands preserve and attain every intermediate , so the formula describes the whole region, not merely a bound. The extreme commands are bang-bang control.
In particular, the bounded double integrator can move from rest to position and rest again exactly when . Its minimum duration is therefore in these normalized units. With freely chosen time every rest-to-rest distance is attainable; with a fixed deadline many are excluded. Changing the amplitude bound to with scales this condition to . This shows why specifying the controls matters even when the Kalman rank criterion gives full rank of a matrix.
In closed quantum control, a density operator reachable set lies inside its unitary orbit of a density operator, since coherent evolution preserves the spectrum. That orbit need not be fully reachable under the available control inputs.
The double integrator is the linear time-invariant system in which one control input is integrated into velocity, and velocity into position. It is a mathematical idealization of one-dimensional motion under commanded acceleration; for a constant mass and net force , Newton's second law gives . The worked examples here use normalized dimensionless quantities and assume no control disturbances, rather than describing a laboratory record. [ref]
https://www-personal.umich.edu/~dsbaero/others/25-DoubleIntegrator.pdf. Venkatesh G. Rao and Dennis S. Bernstein, Naive Control of the Double Integrator, pages 87–88
Writing givesThe Kalman rank criterion therefore gives controllability in every for unrestricted real control inputs. More concretely, choose constants on the first and second halves. Starting at , direct integration givesThe endpoint map has determinant , so these two amplitudes can supply any desired endpoint displacement. For a rest-to-rest move of distance , take , . At and these are the two commands in the first figure. No impulse is needed; shorter deadlines require larger finite commands.
Articles by others on the same topic
There are currently no matching articles.
