Solving Non-deterministic Planning Problems with Pattern Database Heuristics.
Pascal BercherRobert MattmüllerPublished in: KI (2009)
Keyphrases
- planning problems
- heuristic search
- fully observable
- solving planning problems
- deterministic domains
- optimal planning
- domain independent planning
- domain independent
- admissible heuristics
- stochastic domains
- state space
- partial observability
- planning domains
- conformant planning
- plan generation
- ai planning
- causal graph
- markov decision problems
- pattern databases
- classical planning
- machine learning
- symbolic model checking
- binary decision diagrams
- planning systems
- np complete
- search space
- search algorithm