Skip navigation
Skip navigation

Minimal Landmarks for Optimal Delete-Free Planning

Request a Copy

link to publisher version

Haslum, Patrik; Slaney, John K; Thiebaux, Sylvie

Description

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

CollectionsANU Research Publications
Date published: 2012
Type: Conference paper
URI: http://hdl.handle.net/1885/64965
Source: Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling

Download

File Description SizeFormat Image
01_Haslum_Minimal_Landmarks_for_Optimal_2012.pdf402.18 kBAdobe PDF    Request a copy
Show full item record


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator