Controllability is Harder to Decide than Accessibility
From MaRDI portal
Recommendations
Cited in
(12)- Geometrical and topological methods in optimal control theory
- Controllability on infinite-dimensional manifolds: a Chow-Rashevsky theorem
- Output-controllability and output-near-controllability of driftless discrete-time bilinear systems
- On controllability, near-controllability, controllable subspaces, and nearly-controllable subspaces of a class of discrete-time multi-input bilinear systems
- Computing the shape of the image of a multi-linear mapping is possible but computationally intractable: Theorems
- Controllability and Stabilizability of Discontinuous Bimodal Piecewise Linear Systems
- On controllability and near-controllability of discrete-time inhomogeneous bilinear systems without drift
- 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
- Popov-Belevitch-Hautus type controllability tests for linear complementarity systems
- The complexity of deciding controllability
This page was built for publication: Controllability is Harder to Decide than Accessibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809639)