Intractable problems in control theory
SIAM Journal on Control and Optimization
Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
The complexity of Markov decision processes
Mathematics of Operations Research
Maximal unidirectional perturbation bounds for stability of polynomials and matrices
Systems & Control Letters
Controllability is harder to decide than accessibility
SIAM Journal on Control and Optimization
Kharitonov's theorem revisited
Systems & Control Letters
The complexity of dynamic programming
Journal of Complexity
The complexity of deciding controllability
Systems & Control Letters
The complexity of some reachability problems for a system on a finite group
Systems & Control Letters
The componentwise distance to the nearest singular matrix
SIAM Journal on Matrix Analysis and Applications
The complexity of stochastic games
Information and Computation
Analog computation via neural networks
Theoretical Computer Science
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Computability with low-dimensional dynamical systems
Theoretical Computer Science
Memoryless policies: theoretical limitations and practical results
SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
Positive Definiteness and Stability of Interval Matrices
SIAM Journal on Matrix Analysis and Applications
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
Universal computation and other capabilities of hybrid and continuous dynamical systems
Theoretical Computer Science - Special issue on hybrid systems
On the computational power of neural nets
Journal of Computer and System Sciences
The complexity of mean payoff games on graphs
Theoretical Computer Science
The dynamic universality of sigmoidal neural networks
Information and Computation
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Interconnected automata and linear systems: a theoretical framework in discrete-time
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
On the computational power of dynamical systems and hybrid systems
Theoretical Computer Science - Special issue on universal machines and computations
A family of universal recurrent networks
Theoretical Computer Science - Special issue on universal machines and computations
Studies in hybrid systems: modeling, analysis, and control
Studies in hybrid systems: modeling, analysis, and control
Static output feedback—a survey
Automatica (Journal of IFAC)
Computational complexity of a problem arising in fixed order output feedback design
Systems & Control Letters
NP-Hardness of Some Linear Control Design Problems
SIAM Journal on Control and Optimization
On the complexity of the robust stability problem for linear parameter varying systems
Automatica (Journal of IFAC)
When is a pair of matrices mortal?
Information Processing Letters
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science - Special issue on real numbers and computers
What's decidable about hybrid automata?
Journal of Computer and System Sciences
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Computational complexity of neural networks: a survey
Nordic Journal of Computing
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Encyclopaedia of Complexity Results for Finite-Horizon Markov Decision Process Problems
Encyclopaedia of Complexity Results for Finite-Horizon Markov Decision Process Problems
Control and supervision of discrete event processes
Control and supervision of discrete event processes
Computational complexity of robust stability and regularity in families of linear systems
Computational complexity of robust stability and regularity in families of linear systems
Algorithms for sequential decision-making
Algorithms for sequential decision-making
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Probabilistic propositional planning: representations and complexity
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
On the complexity of solving Markov decision problems
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Complexity of stability and controllability of elementary hybrid systems
Automatica (Journal of IFAC)
Solving H-horizon, stationary Markov decision problems in time proportional to log(H)
Operations Research Letters
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Superstable Linear Control Systems. I. Analysis
Automation and Remote Control
Superstable Linear Control Systems. II. Design
Automation and Remote Control
The Complexity of Decentralized Control of Markov Decision Processes
Mathematics of Operations Research
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
On the undecidability of probabilistic planning and related stochastic optimization problems
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Lyapunov design for safe reinforcement learning
The Journal of Machine Learning Research
Undecidable problems of decentralized observation and control on regular languages
Information Processing Letters
PSPACE-completeness of Modular Supervisory Control Problems
Discrete Event Dynamic Systems
Multiagent coordination by Extended Markov Tracking
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A survey of randomized algorithms for control synthesis and performance verification
Journal of Complexity
Brief paper: Analysis of networked control systems with drops and variable delays
Automatica (Journal of IFAC)
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
Electronic Notes in Theoretical Computer Science (ENTCS)
The theory of trackability with applications to sensor networks
ACM Transactions on Sensor Networks (TOSN)
Reachability in Linear Dynamical Systems
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Computing Omega-Limit Sets in Linear Dynamical Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
On Rational Stochastic Languages
Fundamenta Informaticae
Randomized methods of stabilization of the discrete linear systems
Automation and Remote Control
Brief paper: Parameter-dependent robust H∞ filtering for uncertain discrete-time systems
Automatica (Journal of IFAC)
Stochastic algorithms for robustness of control performances
Automatica (Journal of IFAC)
On the number of α-power-free binary words for 2
Theoretical Computer Science
Overlap-free words and spectra of matrices
Theoretical Computer Science
A Strongly Polynomial Algorithm for Controlled Queues
Mathematics of Operations Research
On decentralized stabilization of discrete-time nonlinear systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Spot pricing of secondary spectrum access in wireless cellular networks
IEEE/ACM Transactions on Networking (TON)
Approximation of the joint spectral radius of a set of matrices using sum of squares
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Computing the growth of the number of overlap-free words with spectra of matrices
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The continuous Skolem-Pisot problem
Theoretical Computer Science
Polynomial time computation in the context of recursive analysis
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Automatica (Journal of IFAC)
Sampled fictitious play for approximate dynamic programming
Computers and Operations Research
Automatica (Journal of IFAC)
Stability analysis of switched systems using variational principles: An introduction
Automatica (Journal of IFAC)
Absolute stability of third-order systems: A numerical algorithm
Automatica (Journal of IFAC)
Computation in one-dimensional piecewise maps and planar pseudo-billiard systems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
On the membership of invertible diagonal matrices
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
A constraint sampling approach for multi-stage robust optimization
Automatica (Journal of IFAC)
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
A survey of recursive analysis and Moore's notion of real computation
Natural Computing: an international journal
Using pseudo-stochastic rational languages in probabilistic grammatical inference
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Brief Some applications of randomized algorithms for control system design
Automatica (Journal of IFAC)
Randomized algorithms for robust controller synthesis using statistical learning theory
Automatica (Journal of IFAC)
Complexity of stability and controllability of elementary hybrid systems
Automatica (Journal of IFAC)
Brief Probabilistic solutions to some NP-hard matrix problems
Automatica (Journal of IFAC)
Brief An LMI condition for robust stability of polynomial matrix polytopes
Automatica (Journal of IFAC)
A probabilistic framework for problems with real structured uncertainty in systems and control
Automatica (Journal of IFAC)
Brief Synthesis of H∞ PID controllers: A parametric approach
Automatica (Journal of IFAC)
Soft variable-structure controls: a survey
Automatica (Journal of IFAC)
Uniform stabilization of discrete-time switched and Markovian jump linear systems
Automatica (Journal of IFAC)
A universal planning system for hybrid domains
Applied Intelligence
Fast Calculation of Spectral Bounds for Hessian Matrices on Hyperrectangles
SIAM Journal on Matrix Analysis and Applications
Efficient optimal design of uncertain discrete time dynamical systems
Automatica (Journal of IFAC)
On Rational Stochastic Languages
Fundamenta Informaticae
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
2^N discretisation of biophasor in cancellable biometrics
ICB'07 Proceedings of the 2007 international conference on Advances in Biometrics
PalmHash Code vs. PalmPhasor Code
Neurocomputing
Observability of Boolean networks: A graph-theoretic approach
Automatica (Journal of IFAC)
On finite-horizon ℓ2-induced norms of discrete-time switched linear systems
Automatica (Journal of IFAC)
A computationally faster algorithm to test the stability of characteristic polynomials
International Journal of Systems, Control and Communications
Perron vector optimization applied to search engines
Applied Numerical Mathematics
Technical communique: Policy set iteration for Markov decision processes
Automatica (Journal of IFAC)
Hi-index | 22.19 |
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 fields. 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.