Heuristics for Bounded-Cost Search
The problem of searching for a plan with cost at most equal to a given absolute bound has attracted interest recently, and several search algorithms tailored specifically to this problem have been proposed. We investigate instead how to adapt planning heu
|Collections||ANU Research Publications|
|Source:||International Conference on Automated Planning & Scheduling|
|01_Haslum_Heuristics_for_Bounded-Cost_2013.pdf||491.69 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.