Some complexity questions regarding controllability
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1326-1329 vol.2
- https://doi.org/10.1109/cdc.1988.194538
Abstract
Experience with accessibility and controllability suggests that the latter is much more difficult to characterize. The author's objective is to make this relative difficulty precise in a formal sense. In the spirit of computational complexity, he picks a class of systems (bilinear subsystems) and shows that for this class the accessibility property can be decided in polynomial time while controllability is NP-hard.Keywords
This publication has 10 references indexed in Scilit:
- Controllability is Harder to Decide than AccessibilitySIAM Journal on Control and Optimization, 1988
- A General Theorem on Local ControllabilitySIAM Journal on Control and Optimization, 1987
- Intractable problems in control theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Real addition and the polynomial hierarchyInformation Processing Letters, 1985
- Nonlinear Control Systems: An IntroductionPublished by Springer Nature ,1985
- Determination of the Transitivity of Bilinear SystemsSIAM Journal on Control and Optimization, 1979
- Nonlinear controllability and observabilityIEEE Transactions on Automatic Control, 1977
- Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic DecompositionACM SIGSAM Bulletin, 1976
- On some questions of rationality and decidabilityJournal of Computer and System Sciences, 1975
- On the length of a Hilbert ascending chainProceedings of the American Mathematical Society, 1971