AAAI Publications, Twenty-Seventh International Conference on Automated Planning and Scheduling

Font Size: 
Unsolvability Certificates for Classical Planning
Salomé Eriksson, Gabriele Röger, Malte Helmert

Last modified: 2017-06-05

Abstract


The plans that planning systems generate for solvable planning tasks are routinely verified by independent validation tools. For unsolvable planning tasks, no such validation capabilities currently exist. We describe a family of certificates of unsolvability for classical planning tasks that can be efficiently verified and are sufficiently general for a wide range of planning approaches including heuristic search with delete relaxation, critical-path, pattern database and linear merge-and-shrink heuristics, symbolic search with binary decision diagrams, and the Trapper algorithm for detecting dead ends. We also augmented a classical planning system with the ability to emit certificates of unsolvability and implemented a planner-independent certificate validation tool. Experiments show that the overhead for producing such certificates is tolerable and that their validation is practically feasible.

Full Text: PDF