TY - GEN
T1 - Safe, strong and tractable relevance analysis for planning
AU - Haslum, Patrik
AU - Helmert, Malte
AU - Jonsson, Anders
PY - 2013
Y1 - 2013
N2 - In large and complex planning problems, there will almost inevitably be aspects that are not relevant to a specific problem instance. Thus, identifying and removing irrelevant parts from an instance is one of the most important techniques for scaling up automated planning. We examine the path-based relevance analysis method, which is safe (preserves plan existence and cost) and powerful but has exponential time complexity, and show how to make it run in polynomial time with only a minimal loss of pruning power.
AB - In large and complex planning problems, there will almost inevitably be aspects that are not relevant to a specific problem instance. Thus, identifying and removing irrelevant parts from an instance is one of the most important techniques for scaling up automated planning. We examine the path-based relevance analysis method, which is safe (preserves plan existence and cost) and powerful but has exponential time complexity, and show how to make it run in polynomial time with only a minimal loss of pruning power.
UR - http://www.scopus.com/inward/record.url?scp=84889830864&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9781577356097
T3 - ICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling
SP - 317
EP - 321
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 -