Extending Classical Planning Heuristics to Probabilistic Planning with Dead-Ends.
Florent Teichteil-KönigsbuchVincent VidalGuillaume InfantesPublished in: AAAI (2011)
Keyphrases
- probabilistic planning
- classical planning
- dead ends
- heuristic function
- heuristic search
- heuristic functions
- planning problems
- path planning
- state space
- search tree
- domain independent
- search algorithm
- evaluation function
- search space
- planning domains
- path finding
- planning graph
- initial state
- search methods
- hill climbing
- optimal planning
- planning under uncertainty
- ai planning
- domain specific
- dynamic programming
- admissible heuristics
- dynamic environments
- reinforcement learning
- graph partitioning
- np complete
- search strategies
- np hard