DISTURBANCE DECOUPLING WITH POLE-PLACEMENT FOR STRUCTURED SYSTEMS - A GRAPH-THEORETIC APPROACH

Structured systems are linear systems of which each of the coefficients in the matrices is, either fixed to zero or an independent free parameter. In this paper the well-known disturbance decoupling problem with pole placement for such systems is studied and necessary and sufficient conditions for the generic solvability of the problem are derived. Generic solvability here means solvability in almost all cases. The conditions will be stated in terms of weighted matchings in a bipartite graph that easily can be associated with a structured system. The advantage of this is that the conditions then can be verified by means of well-known and efficient combinatorial algorithms.