Efficient Pruning of Operators in Planning Domains

Authors:
Anders Jonsson
Affiliations:
Dept. of Information and Communication Technologies, Universitat Pompeu Fabra, Passeig de Circumval.lació, 8, 08003 Barcelona, Spain
Venue:
Current Topics in Artificial Intelligence
Year:
2007

Citing 3
Cited 0

Ignoring Irrelevant Facts and Operators in Plan Generation

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Action Constraints for Planning

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
The fast downward planning system

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove redundant operators. We present a domain-independent algorithm for efficiently pruning redundant operators prior to search. The algorithm operates in the domain transition graphs of multi-valued state variables, so its complexity is polynomial in the size of the state variable domains. We prove that redundant operators can always be replaced in a valid plan with other operators. Experimental results in standard planning domains demonstrate that our algorithm can reduce the number of operators as well as speed up search.