Haslum, PatrikSlaney, John KThiebaux, Sylvie2015-12-10June 25-299781577355625http://hdl.handle.net/1885/64965We 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 theAuthor/s retain copyrightKeywords: Hitting sets; On the flies; Planning problem; Runtimes; Simple and efficient algorithms; Algorithms20122016-02-24