TY - GEN
T1 - Heuristics for bounded-cost search
AU - Haslum, Patrik
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84889849800&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9781577356097
T3 - ICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling
SP - 312
EP - 316
BT - ICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling
T2 - 23rd International Conference on Automated Planning and Scheduling, ICAPS 2013
Y2 - 10 June 2013 through 14 June 2013
ER -