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

Simple item page
dc.contributor.authorHaslum, Patrik
dc.contributor.authorSlaney, John K
dc.contributor.authorThiebaux, Sylvie
dc.coverage.spatialSao Paulo Brazil
dc.date.accessioned2015-12-10T23:16:12Z
dc.date.createdJune 25-29 2012
dc.date.issued2012
dc.date.updated2016-02-24T10:56:58Z
dc.description.abstractWe 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
dc.identifier.isbn9781577355625
dc.identifier.urihttp://hdl.handle.net/1885/64965
dc.publisherAAAI Press
dc.relation.ispartofseriesInternational Conference on Automated Planning and Scheduling (ICAPS 2012)
dc.rightsAuthor/s retain copyrighten_AU
dc.sourceProceedings of the Twenty-Second International Conference on Automated Planning and Scheduling
dc.source.urihttp://www.aiconferences.org/ICAPS/2012/icaps12.html
dc.subjectKeywords: Hitting sets; On the flies; Planning problem; Runtimes; Simple and efficient algorithms; Algorithms
dc.titleMinimal Landmarks for Optimal Delete-Free Planning
dc.typeConference paper
dcterms.accessRightsOpen Accessen_AU
local.bibliographicCitation.lastpage357
local.bibliographicCitation.startpage353
local.contributor.affiliationHaslum, Patrik , College of Engineering and Computer Science, ANU
local.contributor.affiliationSlaney, John K, College of Engineering and Computer Science, ANU
local.contributor.affiliationThiebaux, Sylvie, College of Engineering and Computer Science, ANU
local.contributor.authoruidHaslum, Patrik , u1818590
local.contributor.authoruidSlaney, John K, u8800435
local.contributor.authoruidThiebaux, Sylvie, u4033066
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080199 - Artificial Intelligence and Image Processing not elsewhere classified
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationu4334215xPUB1029
local.identifier.scopusID2-s2.0-84866465087
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Haslum_Minimal_Landmarks_for_Optimal_2012.pdf
Size:
402.18 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS

abcd