Skip navigation
Skip navigation
A change is coming. Click to see a sneak peek of the new Open Research Repository.

Minimal Landmarks for Optimal Delete-Free Planning

Open Access

Download (402.18 kB)

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

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.identifier.isbn9781577355625
dc.identifier.urihttp://hdl.handle.net/1885/64965
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.publisherAAAI Press
dc.relation.ispartofseriesInternational Conference on Automated Planning and Scheduling (ICAPS 2012)
dc.rightsAuthor/s retain copyright
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
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2012
local.identifier.absfor080199 - Artificial Intelligence and Image Processing not elsewhere classified
local.identifier.ariespublicationu4334215xPUB1029
local.type.statusPublished Version
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.bibliographicCitation.startpage353
local.bibliographicCitation.lastpage357
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
dc.date.updated2016-02-24T10:56:58Z
local.identifier.scopusID2-s2.0-84866465087
dcterms.accessRightsOpen Access
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Haslum_Minimal_Landmarks_for_Optimal_2012.pdf402.18 kBAdobe PDF
Show simple item record


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

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator