The Computational Complexity of Probabilistic Planning.
Michael L. LittmanJudy GoldsmithMartin MundhenkPublished in: J. Artif. Intell. Res. (1998)
Keyphrases
- probabilistic planning
- computational complexity
- heuristic search
- planning problems
- decision theoretic planning
- planning under uncertainty
- special case
- markov decision processes
- np complete
- decision problems
- partially observable
- np hard
- finite automata
- learning algorithm
- state space
- markov decision process
- search algorithm
- multi agent