Haslum, PatrikSlaney, John K.Thiébaux, Sylvie2026-02-282026-02-28dblp:conf/aips/HaslumST12ORCID:/0000-0002-8464-7690/work/206761188https://hdl.handle.net/1885/733806807We 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.5DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.2012