Minimal Landmarks for Optimal Delete-Free Planning
Date
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
Citation
Collections
Source
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling
Type
Book Title
Entity type
Access Statement
Open Access
License Rights
DOI
Restricted until
Downloads
File
Description