Heuristics for Bounded-Cost Search
DOI:
https://doi.org/10.1609/icaps.v23i1.13597Keywords:
Planning, Heuristic search, bounded-cost searchAbstract
The problem of searching for a plan with cost at most equal to a given absolute bound has attracted interest recently, and several search algorithms tailored specifically to this problem have been proposed. We investigate instead how to adapt planning heuristics to this setting. A few of the resulting heuristics, used in a greedy bounded-cost search, perform better than previous and baseline methods, but only by a small margin. Making effective use of the cost bound in bounded-cost planning, it appears, remains a challenge.
Downloads
Published
2013-06-02
How to Cite
Haslum, P. (2013). Heuristics for Bounded-Cost Search. Proceedings of the International Conference on Automated Planning and Scheduling, 23(1), 312-316. https://doi.org/10.1609/icaps.v23i1.13597
Issue
Section
Short Papers