AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the International Conference on Automated Planning and Scheduling, 22

Minimal Landmarks for Optimal Delete-Free Planning

Authors

Patrik Haslum,John Slaney,Sylvie Thiebaux

Australian National University and National ICT Australia,Australian National University and National ICT Australia,Australian National University and National ICT Australia


Proceedings:

Vol. 22 (2012): Twenty-Second International Conference on Automated Planning and Scheduling

Volume

Issue:

Vol. 22 (2012): Twenty-Second International Conference on Automated Planning and Scheduling

Track:

Short Papers

Downloads:

Download PDF

Abstract:

We present a simple and efficient algorithm to solve delete-free planning problems optimally and calculate the h+ heuristic. The algorithm efficiently computes a minimum-cost hitting set for a complete set of disjunctive action landmarks generated on the fly. Unlike other recent approaches, the landmarks it generates are guaranteed to be set-inclusion minimal. In almost all delete-relaxed IPC domains, this leads to a significant coverage and runtime improvement.

DOI:

10.1609/icaps.v22i1.13534


ICAPS

Vol. 22 (2012): Twenty-Second International Conference on Automated Planning and Scheduling