On structural controllability theorem

Hirokazu MAYEDA · IEEE Transactions on Automatic Control · 1981

The structural controllability theorem was given first by Lin for the single input case by the graph theoretic approach, and several authors extended this to the multiinput case by the matrix algebra. In this correspondence a graph theoretic interpretation of the condition that the structured matrix [A B] has generically full rank is derived from well-known theorem in the graph theory, and this leads to a quite simple proof of the structural controllability theorem.

Read the paper · More papers on PaperTik