On the complexity of partially observed Markov decision processes

Authors:
Dima Burago;Michel de Rougemont;Anatol Slissenko
Affiliations:
Univ. Paris-Sud, France;Univ. Paris-Sud, Orsay, France;Univ. Paris-12, Cre´teil, France, LITP, Paris, France, SPIIRAN, St. Petersburg, Russia
Venue:
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Year:
1996

Citing 0
Cited 12

Complexity of finite-horizon Markov decision process problems

Journal of the ACM (JACM)
Markov decision processes and deterministic Büchi automata

Fundamenta Informaticae
On the undecidability of probabilistic planning and related stochastic optimization problems

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Optimal replacement under partial observations

Mathematics of Operations Research
Resilient dynamic power management under uncertainty

Proceedings of the conference on Design, automation and test in Europe
Value-function approximations for partially observable Markov decision processes

Journal of Artificial Intelligence Research
Nonapproximability results for partially observable Markov decision processes

Journal of Artificial Intelligence Research
Restricted value iteration: theory and algorithms

Journal of Artificial Intelligence Research
Unifying perceptual and behavioral learning with a correlative subspace learning rule

Neurocomputing
Spatial navigation with uncertain deviations

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Probabilistic ω-automata

Journal of the ACM (JACM)
Markov Decision Processes and Deterministic Büchi Automata

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract