The complexity of deciding controllability
From MaRDI portal
Recommendations
- Controllability is Harder to Decide than Accessibility
- Overview of complexity and decidability results for three classes of elementary nonlinear systems
- Intractable Problems in Control Theory
- A survey of computational complexity results in systems and control
- Complexity of stability and controllability of elementary hybrid systems
Cites work
- A General Theorem on Local Controllability
- Control variations with an increasing number of switchings
- Controllability is Harder to Decide than Accessibility
- Controlled stability
- scientific article; zbMATH DE number 4154295 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Lie Brackets and Local Controllability: A Sufficient Condition for Scalar-Input Systems
Cited in
(13)- Some complexity problems on single input double output controllers
- Use of the Kolmogorov complexity in analyzing control system dynamics
- Complexity of stability and controllability of elementary hybrid systems
- Controllability on infinite-dimensional manifolds: a Chow-Rashevsky theorem
- Intractable Problems in Control Theory
- scientific article; zbMATH DE number 3985077 (Why is no real title available?)
- Controllability is Harder to Decide than Accessibility
- Overview of complexity and decidability results for three classes of elementary nonlinear systems
- NP-Hardness of Some Linear Control Design Problems
- Computing the shape of the image of a multi-linear mapping is possible but computationally intractable: Theorems
- A survey of computational complexity results in systems and control
- Controllability of \(\mathrm{SO}(1, 4)\) action on \(S^3\)
- Accessibility condition for discrete-time linear systems on Lie groups
This page was built for publication: The complexity of deciding controllability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923015)
