The complexity of deciding controllability

DOI10.1016/0167-6911(90)90038-VzbMath0711.93013MaRDI QIDQ923015

Matthias Kawski

Publication date: 1990

Published in: Systems \& Control Letters (Search for Journal in Brave)

zbMATH Keywords

NP-hardsmall-time locally controllable

Mathematics Subject Classification ID

Controllability (93B05) Nonlinear systems in control theory (93C10) Control/observation systems governed by ordinary differential equations (93C15)

Related Items

A survey of computational complexity results in systems and control ⋮ Controllability on infinite-dimensional manifolds: a Chow-Rashevsky theorem

Cites Work

• Controlled stability
• Lie Brackets and Local Controllability: A Sufficient Condition for Scalar-Input Systems
• A General Theorem on Local Controllability
• Controllability is Harder to Decide than Accessibility
• Control variations with an increasing number of switchings
• Unnamed Item
• Unnamed Item