The single-input Minimal Controllability Problem for structured systems
Résumé
This paper considers the Minimal Controllability Problem (MCP), {\em i.e.} the problem of controlling a linear system with an input vector having as few non-zero entries as possible. We focus on structured systems which represent an interesting class of parameter dependent linear systems and look for structural controllability properties based on the sparsity pattern of the input vector. We show first that the MCP is solvable when a rank condition is satisfied and show that generically one non-zero entry in the input vector is sufficient to achieve controllability when there is no specific system structure. According to the fixed zero/non-zero pattern of the state matrix entries, we give an explicit characterisation of the minimum number and the possible location of non-zero entries in the input vector to ensure generic controllability. The analysis based on graph tools provides with a simple polynomial MCP solution and highlights the structural mechanisms that make it useful to act on some variables to ensure controllability.