The complexity of deciding controllability

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


It is shown that the problem of deciding whether a control system is small-time locally controllable or not is NP-hard. This is an extension of a recent paper by Sontag to single-input systems and to bounded controls.

Original languageEnglish (US)
Pages (from-to)9-14
Number of pages6
JournalSystems and Control Letters
Issue number1
StatePublished - Jul 1990


  • Local controllability
  • complexity
  • nonlinear control

ASJC Scopus subject areas

  • Control and Systems Engineering
  • General Computer Science
  • Mechanical Engineering
  • Electrical and Electronic Engineering


Dive into the research topics of 'The complexity of deciding controllability'. Together they form a unique fingerprint.

Cite this