Controllability is Harder to Decide than Accessibility
From MaRDI portal
Publication:3809639
DOI10.1137/0326061zbMath0659.93006OpenAlexW2155973751MaRDI QIDQ3809639
Publication date: 1988
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/807fba2b1a67b83fa510e01a90068b09768e73cd
Analysis of algorithms and problem complexity (68Q25) Controllability (93B05) Nonlinear systems in control theory (93C10)
Related Items
Controllability and Stabilizability of Discontinuous Bimodal Piecewise Linear Systems, On controllability, near-controllability, controllable subspaces, and nearly-controllable subspaces of a class of discrete-time multi-input bilinear systems, Geometrical and topological methods in optimal control theory, Popov-Belevitch-Hautus type controllability tests for linear complementarity systems, On controllability and near-controllability of discrete-time inhomogeneous bilinear systems without drift, The complexity of deciding controllability, Output-Controllability and Output-Near-Controllability of Driftless Discrete-Time Bilinear Systems, A survey of computational complexity results in systems and control, Controllability on infinite-dimensional manifolds: a Chow-Rashevsky theorem
