2000 character limit reached
Minimum Input Selection for Structural Controllability
Published 10 Jul 2014 in math.OC and cs.SY | (1407.2884v2)
Abstract: Given a linear system $\dot{x} = Ax$, where $A$ is an $n \times n$ matrix with $m$ nonzero entries, we consider the problem of finding the smallest set of state variables to affect with an input so that the resulting system is structurally controllable. We further assume we are given a set of "forbidden state variables" $F$ which cannot be affected with an input and which we have to avoid in our selection. Our main result is that this problem can be solved deterministically in $O(n+m \sqrt{n})$ operations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.