TY - GEN
T1 - Potential search
T2 - 21st International Conference on Automated Planning and Scheduling, ICAPS 2011
AU - Stern, Roni
AU - Puzis, Rami
AU - Felner, Ariel
PY - 2011
Y1 - 2011
N2 - In this paper we address the following search task: find a goal with cost smaller than or equal to a given fixed constant. This task is relevant in scenarios where a fixed budget is available to execute a plan and we would like to find such a plan while minimizing the search effort. We introduce an algorithm called Potential search (PTS) which is specifically designed to solve this problem. PTS is a best-first search that expands nodes according to the probability that they will be part of a plan whose cost is less than or equal to the given budget. We show that it is possible to implement PTS even without explicitly calculating these probabilities, when a heuristic function and knowledge about the error of this heuristic function are given. In addition, we also show that PTS can be modified to an anytime search algorithm. Experimental results show that PTS outperforms other relevant algorithms in most cases, and is more robust.
AB - In this paper we address the following search task: find a goal with cost smaller than or equal to a given fixed constant. This task is relevant in scenarios where a fixed budget is available to execute a plan and we would like to find such a plan while minimizing the search effort. We introduce an algorithm called Potential search (PTS) which is specifically designed to solve this problem. PTS is a best-first search that expands nodes according to the probability that they will be part of a plan whose cost is less than or equal to the given budget. We show that it is possible to implement PTS even without explicitly calculating these probabilities, when a heuristic function and knowledge about the error of this heuristic function are given. In addition, we also show that PTS can be modified to an anytime search algorithm. Experimental results show that PTS outperforms other relevant algorithms in most cases, and is more robust.
UR - http://www.scopus.com/inward/record.url?scp=80054832437&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:80054832437
SN - 9781577355038
T3 - ICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling
SP - 234
EP - 241
BT - ICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling
Y2 - 11 June 2011 through 16 June 2011
ER -