Complexity theoretic aspects of problems in control theory

We introduce some of the concepts of computational complexity theory. We then survey available complexity-theoretic results for some of the main problems of control theory.

[1]  John N. Tsitsiklis,et al.  On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.

[2]  Arkadi Nemirovski,et al.  Several NP-hard problems arising in robust stability analysis , 1993, Math. Control. Signals Syst..

[3]  John N. Tsitsiklis,et al.  On the complexity of decentralized decision making and detection problems , 1985 .

[4]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[5]  E. J. Sondik,et al.  The Optimal Control of Partially Observable Markov Decision Processes. , 1971 .

[6]  John N. Tsitsiklis,et al.  On the Complexity of Designing Distributed Protocols , 1982, Inf. Control..

[7]  J. Tsitsiklis,et al.  An optimal one-way multigrid algorithm for discrete-time stochastic control , 1991 .

[8]  Eduardo Sontag.  Controllability is harder to decide than accessibility , 1988 .

[9]  M. Morari,et al.  Computational complexity of μ calculation , 1993 .

[10]  H. Witsenhausen.  A Counterexample in Stochastic Optimum Control , 1968 .

[11]  John N. Tsitsiklis,et al.  The complexity of dynamic programming , 1989, J. Complex..

[12]  Svatopluk Poljak,et al.  Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..

[13]  D. Bertsekas,et al.  Dynamic Programming and Stochastic Control , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[15]  J. Tsitsiklis,et al.  Intractable problems in control theory , 1986 .

[16]  R. Radner,et al.  Economic theory of teams , 1972 .