Skip navigation
Skip navigation

Incremental Lower Bounds for Additive Cost Planning Problems

Haslum, Patrik; Slaney, John K; Thiebaux, Sylvie


We present a novel method for computing increasing lower bounds on the cost of solving planning problems, based on repeatedly solving and strengthening the delete relaxation of the problem. Strengthening is done by compiling select conjunctions into new atoms, similar to the P*m construction. Because it does not rely on search in the state space, this method does not suffer some of the weaknesses of admissible search algorithms and therefore is able to prove higher lower bounds for many...[Show more]

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
Source: International Conference on Automated Planning and Scheduling 2011 proceedings


File Description SizeFormat Image
01_Haslum_Incremental_Lower_Bounds_for_2011.pdf184.22 kBAdobe PDF

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

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator