Minimal Landmarks for Optimal Delete-Free Planning.

Patrik Haslum; John K. Slaney; Sylvie Thiébaux

Minimal Landmarks for Optimal Delete-Free Planning.

Patrik Haslum, John K. Slaney, Sylvie Thiébaux

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › peer-review

Abstract

We present a simple and efficient algorithm to solve deletefree 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 fly. Unlike other recent approaches, the
landmarks it generates are guaranteed to be set-inclusion minimal. In almost all delete-relaxed IPC domains, this leads to
a significant coverage and runtime improvement.

Original language	Undefined/Unknown
Title of host publication	ICAPS
Number of pages	5
Publication status	Published - 2012

Access to Document

Cite this

@inproceedings{75c99dddce7c4743befb1bf1addb2737,

title = "Minimal Landmarks for Optimal Delete-Free Planning.",

abstract = "We present a simple and efficient algorithm to solve deletefree 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 fly. Unlike other recent approaches, the landmarks it generates are guaranteed to be set-inclusion minimal. In almost all delete-relaxed IPC domains, this leads to a significant coverage and runtime improvement. ",

author = "Patrik Haslum and Slaney, \{John K.\} and Sylvie Thi{\'e}baux",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2012",

language = "Undefined/Unknown",

booktitle = "ICAPS",

}

TY - GEN

T1 - Minimal Landmarks for Optimal Delete-Free Planning.

AU - Haslum, Patrik

AU - Slaney, John K.

AU - Thiébaux, Sylvie

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2012

Y1 - 2012

N2 - We present a simple and efficient algorithm to solve deletefree 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 fly. Unlike other recent approaches, the landmarks it generates are guaranteed to be set-inclusion minimal. In almost all delete-relaxed IPC domains, this leads to a significant coverage and runtime improvement.

AB - We present a simple and efficient algorithm to solve deletefree 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 fly. Unlike other recent approaches, the landmarks it generates are guaranteed to be set-inclusion minimal. In almost all delete-relaxed IPC domains, this leads to a significant coverage and runtime improvement.

M3 - Conference Paper

BT - ICAPS

ER -