A survey of computational complexity results in systems and control

✍ Scribed by Vincent D. Blondel; John N. Tsitsiklis

• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 293 KB
• Volume: 36
• Category: Article
• ISSN: 0005-1098
• DOI: 10.1016/s0005-1098(00)00050-9

✦ Synopsis

The purpose of this paper is twofold: (a) to provide a tutorial introduction to some key concepts from the theory of computational complexity, highlighting their relevance to systems and control theory, and (b) to survey the relatively recent research activity lying at the interface between these "elds. We begin with a brief introduction to models of computation, the concepts of undecidability, polynomial-time algorithms, NP-completeness, and the implications of intractability results. We then survey a number of problems that arise in systems and control theory, some of them classical, some of them related to current research. We discuss them from the point of view of computational complexity and also point out many open problems. In particular, we consider problems related to stability or stabilizability of linear systems with parametric uncertainty, robust control, time-varying linear systems, nonlinear and hybrid systems, and stochastic optimal control.