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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bäckström, C., Nebel, B.: Complexity results for SAS + planning. Computational Intelligence 11(4), 625–655 (1995)
Nebel, B., Dimopoulos, Y., Koehler, J.: Ignoring irrelevant facts and operators in plan generation. In: Proceedings of the 4th European Conference on Planning, pp. 338–350 (1997)
Scholz, U.: Action constraints for planning. In: Proceedings of the 5th European Conference on Planning, pp. 148–158 (1999)
Haslum, P., Jonsson, P.: Planning with Reduced Operator Sets. In: Proceedings of the 5th International Conference on Automated Planning and Scheduling, pp. 150–158 (2000)
Scholz, U.: Reducing Planning Problems by Path Reduction. Ph.D Thesis, Darmstadt University of Technology, Darmstadt, Germany (2004)
Vidal, V., Geffner, H.: Solving Simple Planning Problems with More Inference and No Search. In: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, pp. 682–696 (2005)
Helmert, M.: Solving Planning Tasks in Theory and Practice. Ph.D Thesis, Albert-Ludwigs-Universität, Freiburg, Germany (2006)
Helmert, M.: The Fast Downward Planning System. Journal of Artificial Intelligence Research 26, 191–246 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jonsson, A. (2007). Efficient Pruning of Operators in Planning Domains. In: Borrajo, D., Castillo, L., Corchado, J.M. (eds) Current Topics in Artificial Intelligence. CAEPIA 2007. Lecture Notes in Computer Science(), vol 4788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75271-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-75271-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75270-7
Online ISBN: 978-3-540-75271-4
eBook Packages: Computer ScienceComputer Science (R0)