• DocumentCode
    2975030
  • Title

    Some complexity questions regarding controllability

  • Author

    Sontag, Eduardo D.

  • Author_Institution
    Dept. of Math., Rutgers Univ., Brunswick, NJ, USA
  • fYear
    1988
  • fDate
    7-9 Dec 1988
  • Firstpage
    1326
  • Abstract
    Experience with accessibility and controllability suggests that the latter is much more difficult to characterize. The author´s objective is to make this relative difficulty precise in a formal sense. In the spirit of computational complexity, he picks a class of systems (bilinear subsystems) and shows that for this class the accessibility property can be decided in polynomial time while controllability is NP-hard
  • Keywords
    computational complexity; controllability; linear systems; nonlinear systems; NP-hard; accessibility; bilinear systems; computational complexity; controllability; linear systems; nonlinear systems; polynomial time; Computational complexity; Continuous time systems; Control systems; Controllability; Differential equations; Ear; Linear algebra; Mathematics; Sufficient conditions; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1988., Proceedings of the 27th IEEE Conference on
  • Conference_Location
    Austin, TX
  • Type

    conf

  • DOI
    10.1109/CDC.1988.194538
  • Filename
    194538
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2975030