Proceedings:
Vol. 20 (2010): Twentieth International Conference on Automated Planning and Scheduling
Volume
Issue:
Vol. 20 (2010): Twentieth International Conference on Automated Planning and Scheduling
Track:
Short Technical Papers
Downloads:
Abstract:
We empirically examine several ways of exploiting the information of multiple heuristics in a satisficing best-first search algorithm, comparing their performance in terms of coverage, plan quality, speed, and search guidance. Our results indicate that using multiple heuristics for satisficing search is indeed useful. Among the combination methods we consider, the best results are obtained by the alternation method of the "Fast Diagonally Downward" planner.
DOI:
10.1609/icaps.v20i1.13435
ICAPS
Vol. 20 (2010): Twentieth International Conference on Automated Planning and Scheduling