Open Research will be updating the system on Tuesday, 14 July 2026, from 8:15 to 9:00 AM. We apologise for any inconvenience caused.

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Minimal Landmarks for Optimal Delete-Free Planning

Thumbnail Image

Date

2012

Authors

Haslum, Patrik
Slaney, John K
Thiebaux, Sylvie

Journal Title

Journal ISSN

Volume Title

Publisher

AAAI Press

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

Description

Keywords

Keywords: Hitting sets; On the flies; Planning problem; Runtimes; Simple and efficient algorithms; Algorithms

Citation

URI

http://hdl.handle.net/1885/64965

Collections

ANU Research Publications

Source

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling

Type

Conference paper

Book Title

Entity type

Access Statement

Open Access

License Rights

DOI

Restricted until

Downloads

File
Description
01_Haslum_Minimal_Landmarks_for_Optimal_2012.pdf (402.18 KB)

DSpace software copyright © 2002-2026 LYRASIS

abcd