TY - GEN
T1 - G-value plateaus
T2 - 20th International Conference on Automated Planning and Scheduling, ICAPS 2010
AU - Benton, J.
AU - Talainadupula, Kartik
AU - Eyerich, Patrick
AU - Mattmüller, Robert
AU - Kambhampati, Subbarao
PY - 2010
Y1 - 2010
N2 - While the string of successes found in using heuristic, best-first search methods have provided positive reinforcement for continuing work along these lines, fundamental problems arise when handling objectives whose value does not change with search operations. An extreme case of this occurs when handling the objective of generating a temporal plan with short makespan. Typically used heuristic search methods assume strictly positive edge costs for their guarantees on completeness and optimality, while the usual "fattening" and "advance time" steps of heuristic search for temporal planning have the potential of resulting in "g-value plateaus". In this paper we point out some underlying difficulties with using modern heuristic search methods when operating over g-value plateaus and discuss how the presence of these problems contributes to the poor performance of heuristic search planners. To further illustrate this, we show empirical results on recent benchmarks using a planner made with makespan optimization in mind.
AB - While the string of successes found in using heuristic, best-first search methods have provided positive reinforcement for continuing work along these lines, fundamental problems arise when handling objectives whose value does not change with search operations. An extreme case of this occurs when handling the objective of generating a temporal plan with short makespan. Typically used heuristic search methods assume strictly positive edge costs for their guarantees on completeness and optimality, while the usual "fattening" and "advance time" steps of heuristic search for temporal planning have the potential of resulting in "g-value plateaus". In this paper we point out some underlying difficulties with using modern heuristic search methods when operating over g-value plateaus and discuss how the presence of these problems contributes to the poor performance of heuristic search planners. To further illustrate this, we show empirical results on recent benchmarks using a planner made with makespan optimization in mind.
UR - http://www.scopus.com/inward/record.url?scp=78650589384&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650589384&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:78650589384
SN - 9781577354499
T3 - ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling
SP - 259
EP - 262
BT - ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling
Y2 - 12 May 2010 through 16 May 2010
ER -