论文信息 - Controllability is harder to decide than accessibility

Controllability is harder to decide than accessibility

This article compares the difficulties of deciding controllability and accessibility. These are standard properties of control systems, but complete algebraic characterizations of controllability have proved elusive. The article shows in particular that, for subsystems of bilinear systems, accessibility can be decided in polynomial time, but controllability is NP-hard.

Eduardo Sontag

[1] R. Brockett. On the algebraic structure of bilinear systems. , 1972 .

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[4] Eduardo D. Sontag,et al. On certain questions of rationality and decidability , 1975 .

[5] A. Krener,et al. Nonlinear controllability and observability , 1977 .

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[8] William M. Boothby,et al. Determination of the Transitivity of Bilinear Systems , 1979 .

[9] P. Crouch,et al. Dynamical realizations of finite Volterra series , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[10] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11] Eduardo D. Sontag,et al. Real Addition and the Polynomial Hierarchy , 1985, Inf. Process. Lett..

[12] Christos Papadimitriou,et al. Intractable problems in control theory , 1985, 1985 24th IEEE Conference on Decision and Control.

[13] A. Isidori. Nonlinear Control Systems: An Introduction , 1986 .

[14] H. Sussmann. A general theorem on local controllability , 1987 .