• DocumentCode
    1545747
  • Title

    Note on a graph-theoretic criterion for structural output controllability

  • Author

    Murota, Kazuo ; Poljak, Svatopluk

  • Author_Institution
    Dept. of Math. Eng. & Inf. Phys., Tokyo Univ., Japan
  • Volume
    35
  • Issue
    8
  • fYear
    1990
  • fDate
    8/1/1990 12:00:00 AM
  • Firstpage
    939
  • Lastpage
    942
  • Abstract
    The structural output controllability of a dynamical system is studied. It is known that the maximum size of linking in an associated dynamic graph provides a good upper bound on the dynamic graph and it was believed that the bound is exact. This conjecture is disproved, and a new, efficiently computed lower bound is presented
  • Keywords
    controllability; graph theory; associated dynamic graph; dynamical system; graph theory; lower bound; structural output controllability; upper bound; Controllability; Differential equations; Electrons; Joining processes; Mirrors; Polynomials; Robust stability; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.58507
  • Filename
    58507