{
  "id": "controllability",
  "title": "Controllability",
  "lang": "en",
  "source_lang": "en",
  "summary": "Controllability is the ability to steer a dynamical system between specified states using admissible inputs within a finite time.",
  "category": "technology",
  "subcategory": "engineering",
  "type": "concept",
  "aliases": [
    "State controllability"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/controllability/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/controllability/",
      "json": "https://aiwiki.page/zh/controllability.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Controllability is a property of a dynamical system that describes whether external inputs can move its internal state from one specified condition to another in a finite time. In control theory, it establishes which motions or operating conditions are achievable through the available control inputs. Controllability depends on the system dynamics, the placement and action of actuators, the permitted inputs, and the time available; it does not simply mean that a system responds to a command."
    },
    {
      "heading": "States, inputs, and reachability",
      "text": "A system's state is a collection of variables sufficient, together with future inputs, to determine its future evolution. For a moving object, these might include position and velocity; for an electrical circuit, capacitor voltages and inductor currents.\n\nA continuous-time state-space model can be written as\n\n\\[\\dot{x}(t)=f(x(t),u(t),t),\\]\n\nwhere \\(x(t)\\in\\mathbb{R}^n\\) is the state and \\(u(t)\\in\\mathbb{R}^m\\) is the input.\n\nA target state \\(x_f\\) is reachable from an initial state \\(x_0\\) over a specified interval if there is an admissible input that takes the system from \\(x_0\\) to \\(x_f\\). A system is completely state-controllable if every initial state can be transferred to every target state in a finite time, under the stated assumptions about inputs and timing.\n\nTerminology varies between texts:\n\n- Reachability often refers specifically to reaching arbitrary states from the zero state.\n- Null controllability means that every initial state can be driven to zero.\n- Complete controllability usually means that arbitrary state-to-state transfers are possible.\n\nThese properties coincide for finite-dimensional continuous-time linear time-invariant systems with unrestricted inputs. They need not coincide in more general settings, particularly discrete-time systems with singular state-transition matrices.\n\nControllability concerns the internal state, not merely a measured output. Output controllability, the ability to attain arbitrary output values, is a different and potentially weaker property."
    },
    {
      "heading": "Linear time-invariant systems",
      "text": "For a finite-dimensional linear time-invariant system, the standard continuous-time model is\n\n\\[\\dot{x}=Ax+Bu,\\]\n\nwhere \\(A\\) is an \\(n\\times n\\) system matrix and \\(B\\) is an \\(n\\times m\\) input matrix. Its solution at time \\(T\\), taking the initial time as zero, is\n\n\\[x(T)=e^{AT}x(0)+ \\int_0^T e^{A(T-\\tau)}Bu(\\tau)\\,d\\tau.\\]\n\nThe first term describes unforced evolution. The integral describes the changes that inputs can produce. Controllability asks whether these changes span the entire state space.\n\nThe standard results assume real-valued inputs without amplitude bounds, normally drawn from a suitable class such as piecewise-continuous or square-integrable functions. Physical constraints can substantially change what is achievable.\n\nKalman rank criterion\n\nThe controllability matrix is\n\n\\[\\mathcal{C}= \\begin{bmatrix} B&AB&A^2B&\\cdots&A^{n-1}B \\end{bmatrix}.\\]\n\nThe pair \\((A,B)\\) is controllable if and only if\n\n\\[\\operatorname{rank}\\mathcal{C}=n.\\]\n\nThe columns of \\(B\\) describe directions in which inputs act directly. The columns of \\(AB,A^2B,\\ldots\\) describe additional directions accessible through the system's internal dynamics. A single input can therefore control multiple state variables.\n\nIf the rank is \\(r<n\\), the states reachable from zero form an \\(r\\)-dimensional subspace of the state space. This subspace is invariant under \\(A\\).\n\nExample: position and velocity\n\nAn idealized object with acceleration as its control input satisfies\n\n\\[\\dot{p}=v,\\qquad \\dot{v}=u.\\]\n\nWith \\(x=(p,v)^{\\mathsf T}\\),\n\n\\[A= \\begin{bmatrix} 0&1\\\\ 0&0 \\end{bmatrix}, \\qquad B= \\begin{bmatrix} 0\\\\ 1 \\end{bmatrix}.\\]\n\nIts controllability matrix is\n\n\\[\\mathcal{C}= \\begin{bmatrix} 0&1\\\\ 1&0 \\end{bmatrix},\\]\n\nwhich has rank two. Although the input acts directly only on velocity, its accumulated effect changes position. Both variables can be assigned final values through a suitable input over any positive time interval, provided input magnitude is unrestricted.\n\nBy contrast, the system\n\n\\[\\dot{x}_1=u,\\qquad \\dot{x}_2=0\\]\n\nis not controllable: no input can change \\(x_2\\).\n\nPopov–Belevitch–Hautus test\n\nThe Popov–Belevitch–Hautus, or PBH, test gives an equivalent condition:\n\n\\[\\operatorname{rank} \\begin{bmatrix} \\lambda I-A&B \\end{bmatrix} =n\\]\n\nfor every complex eigenvalue \\(\\lambda\\) of \\(A\\).\n\nEquivalently, no nonzero left eigenvector of \\(A\\) may be orthogonal to every column of \\(B\\). This connects controllability to individual dynamical modes: an uncontrollable mode cannot be influenced by the inputs."
    },
    {
      "heading": "Controllability Gramian and control energy",
      "text": "For a continuous-time linear time-invariant system, the finite-horizon controllability Gramian is\n\n\\[W_c(T)= \\int_0^T e^{A\\tau}BB^{\\mathsf T}e^{A^{\\mathsf T}\\tau}\\,d\\tau.\\]\n\nFor every \\(T>0\\), the system is controllable if and only if \\(W_c(T)\\) is positive definite.\n\nThe Gramian also measures how much input effort is required. Define the displacement from the uncontrolled final state as\n\n\\[d=x_f-e^{AT}x_0.\\]\n\nWhen the Gramian is invertible, the minimum value of\n\n\\[J=\\int_0^T u(t)^{\\mathsf T}u(t)\\,dt\\]\n\namong inputs that achieve the transfer is\n\n\\[J_{\\min}=d^{\\mathsf T}W_c(T)^{-1}d.\\]\n\nAn input achieving this minimum is\n\n\\[u^*(t)=B^{\\mathsf T}e^{A^{\\mathsf T}(T-t)} W_c(T)^{-1}d.\\]\n\nThis quadratic cost represents input effort; it equals physical energy only when the model and units justify that interpretation.\n\nSmall Gramian eigenvalues identify state-space directions that are expensive to reach. Consequently, exact controllability is not a guarantee of practical maneuverability: a mathematically controllable system may require excessive force, voltage, fuel, or time.\n\nFor an asymptotically stable \\(A\\), the infinite-horizon Gramian exists and satisfies the Lyapunov equation\n\n\\[AW_c+W_cA^{\\mathsf T}+BB^{\\mathsf T}=0.\\]"
    },
    {
      "heading": "Discrete-time and time-varying systems",
      "text": "For the discrete-time model\n\n\\[x_{k+1}=Ax_k+Bu_k,\\]\n\nthe state after \\(N\\) steps is\n\n\\[x_N=A^Nx_0+ \\begin{bmatrix} A^{N-1}B&A^{N-2}B&\\cdots&B \\end{bmatrix} \\begin{bmatrix} u_0\\\\u_1\\\\\\vdots\\\\u_{N-1} \\end{bmatrix}.\\]\n\nArbitrary state-to-state transfers over that horizon are possible exactly when the displayed input-to-state matrix has full row rank. Reachability in at most \\(n\\) steps is characterized by the same Kalman matrix used in continuous time.\n\nNull controllability alone is weaker. For example, if \\(A=0\\) and \\(B=0\\), every initial state becomes zero after one step, but no nonzero state can be reached from zero.\n\nFor a continuous-time linear time-varying system,\n\n\\[\\dot{x}=A(t)x+B(t)u,\\]\n\nlet \\(\\Phi(t,\\tau)\\) be its state-transition matrix. Controllability over \\([t_0,t_1]\\) is characterized by the positive definiteness of\n\n\\[W_c(t_0,t_1)= \\int_{t_0}^{t_1} \\Phi(t_1,\\tau)B(\\tau)B(\\tau)^{\\mathsf T} \\Phi(t_1,\\tau)^{\\mathsf T}\\,d\\tau.\\]\n\nTesting a Kalman matrix at individual instants is not generally sufficient: the evolution of the input directions over the whole interval matters."
    },
    {
      "heading": "Relation to observability and stabilization",
      "text": "Observability asks whether the internal state can be reconstructed from measured outputs. It is distinct from controllability: an input may influence a state that no sensor reveals, or a sensor may reveal a state that no input can influence.\n\nFor a linear system with output equation \\(y=Cx\\), observability of \\((A,C)\\) is mathematically dual to controllability of \\((A^{\\mathsf T},C^{\\mathsf T})\\).\n\nA suitable change of coordinates separates controllable and uncontrollable parts of a linear system. Under state feedback\n\n\\[u=-Kx,\\]\n\nthe closed-loop system matrix becomes \\(A-BK\\). For unrestricted static full-state feedback, controllability permits arbitrary placement of its eigenvalues, subject to complex-conjugate pairing for real matrices. Uncontrollable modes cannot be reassigned by such feedback.\n\nStabilizability is weaker than controllability. A system is stabilizable when every uncontrollable mode is already asymptotically stable. Thus feedback stabilization can be possible even when arbitrary state transfers are not. In continuous time, uncontrollable eigenvalues must have strictly negative real parts; in discrete time, they must lie strictly inside the unit circle.\n\nA transfer function alone does not necessarily expose uncontrollable internal dynamics. Transfer functions describe input–output behavior, and nonminimal state-space realizations can contain internal modes absent from that description."
    },
    {
      "heading": "Nonlinear controllability",
      "text": "For nonlinear systems, controllability can depend on the initial state, target, operating region, time horizon, and permitted input signs or magnitudes.\n\nCommon distinctions include:\n\n- Global controllability: transfers are possible between any states in the specified state domain.\n- Local controllability: transfers are possible within a neighborhood, with precise definitions differing in how trajectories are restricted.\n- Small-time local controllability: the reachable set contains a neighborhood of the initial state for every positive time bound.\n- Accessibility: the reachable set has nonempty interior; it need not contain a neighborhood of the initial state.\n\nFor a control-affine system,\n\n\\[\\dot{x}=f_0(x)+\\sum_{i=1}^{m}f_i(x)u_i,\\]\n\nthe vector fields \\(f_i\\) describe direct control directions. Their Lie brackets describe additional directions obtainable through appropriately sequenced motions. Under suitable assumptions, rank conditions involving these fields and their brackets establish accessibility; stronger conclusions about controllability require further hypotheses.\n\nThis distinction is important in robotics and motion planning. A wheeled vehicle may be unable to move sideways instantaneously yet still achieve a lateral displacement through a sequence of forward, backward, and turning motions.\n\nControllability of a smooth system's linearization at an equilibrium is a sufficient condition for local controllability under standard assumptions, including inputs available around the equilibrium value. An uncontrollable linearization does not establish that the nonlinear system is uncontrollable, because nonlinear effects can provide additional motion directions."
    },
    {
      "heading": "Engineering applications and limitations",
      "text": "Controllability analysis informs actuator selection, placement, and redundancy in aircraft, robots, electrical networks, and process control. It also helps determine whether desired transfers are feasible before an optimal controller or model predictive controller is designed.\n\nSeveral qualifications matter in practice:\n\n- Input and state constraints. Saturation, unilateral forces, temperature limits, and obstacles restrict the reachable set. Unconstrained controllability does not establish constrained feasibility.\n- Sampling. A controllable continuous-time plant can yield an uncontrollable sampled model at particular sampling periods.\n- Numerical conditioning. Directly forming high powers of \\(A\\) can make the Kalman rank test unreliable in floating-point arithmetic. Orthogonal decompositions and controllability staircase methods are generally more dependable.\n- Model uncertainty. A nominal full-rank model may be close to losing controllability. Robust control considers uncertainty and performance questions beyond the binary rank condition.\n- Network structure. Structural controllability asks whether a specified pattern of zero and potentially nonzero matrix entries permits controllability for almost all choices of its free parameters. It does not guarantee controllability for every numerical realization or acceptable control effort.\n- Distributed systems. For systems governed by partial differential equations, exact controllability, approximate controllability, and null controllability may differ substantially. Finite-dimensional rank tests do not transfer directly."
    },
    {
      "heading": "Historical development",
      "text": "Controllability became a central concept in modern control theory through Rudolf E. Kalman's state-space work around 1960. Its development shifted attention from input–output response alone to the internal state of a system and the directions in which inputs can move it.\n\nThe associated rank criteria, duality with observability, and state-space decompositions became foundations for multivariable control. Subsequent work extended controllability theory to nonlinear, time-varying, constrained, stochastic, networked, and infinite-dimensional systems."
    }
  ],
  "links": [
    "control-theory",
    "actuator",
    "linear-time-invariant-system",
    "matrix",
    "vector-space",
    "observability",
    "transfer-function",
    "robotics",
    "motion-planning",
    "process-control",
    "model-predictive-control",
    "robust-control"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}