Incremental Lower Bounds for Additive Cost Planning Problems
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]
|Collections||ANU Research Publications|
|Source:||International Conference on Automated Planning and Scheduling 2011 proceedings|
|01_Haslum_Incremental_Lower_Bounds_for_2011.pdf||184.22 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.