• DocumentCode
    836228
  • Title

    On structural controllability theorem

  • Author

    Mayeda, Hirokazu

  • Author_Institution
    Osaka University, Osaka, Japan
  • Volume
    26
  • Issue
    3
  • fYear
    1981
  • fDate
    6/1/1981 12:00:00 AM
  • Firstpage
    795
  • Lastpage
    798
  • Abstract
    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.
  • Keywords
    Controllability, linear systems; Matrices; Automatic control; Control systems; Controllability; Equations; Graph theory; Heuristic algorithms; Matrices; Solid modeling;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/TAC.1981.1102707
  • Filename
    1102707