Sokoban: enhancing general single-agent search methods using domain knowledge
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Macro-FF: improving AI planning with automatically learned macro-operators
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
The detection and exploitation of symmetry in planning problems
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Reducing accidental complexity in planning problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.00 |
This paper focuses on efficient methods for pruning the state space in cost-optimal planning. The use of heuristics to guide search and prune irrelevant branches has been widely and successfully explored. However, heuristic computation at every node in the search space is expensive, and even near perfect heuristics still leave a large portion of the search space to be explored [9]. Using up-front analysis to reduce the number of nodes to be considered therefore has great potential. Our contributions are not concerned with heuristic guidance, rather, with orthogonal completeness-preserving pruning techniques that reduce the number of states a planner must explore to find an optimal solution. We present results showing that our techniques can improve upon state-of-the-art optimal planners, both when using blind search and importantly in conjunction with modern heuristics, specifically hLM-CUT [8]. Our techniques are not limited to optimal planning and can also be applied in satisfycing planning.