Efficient Pruning of Operators in Planning Domains

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 domainindependent 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.

• Type: Conference
• Year: 2007
• Where: CAEPIA
• Authors: Anders Jonsson
• Keywords: Algorithm, Artificial Intelligence, CAEPIA 2007, Redundant Operators, Valid Plan