Efficient pruning of operators in planning domains

• Jonsson, Anders ^[1]
  1. [1] Universitat Pompeu Fabra

     Universitat Pompeu Fabra

     Barcelona, España

     
• Localización: XII Conferencia de la Asociación Española para la Inteligencia Artificial: (CAEPIA 2007). Actas / coord. por Daniel Borrajo Millán, Luis Castillo Vidal, Juan Manuel Corchado Rodríguez, Vol. 1, 2007, ISBN 978-84-611-8847-5, págs. 7-16
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

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