Minimal Landmarks for Optimal Delete-Free Planning.

Abstract

We present a simple and efficient algorithm to solve deletefree 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. Show more