Skip navigation
Skip navigation

Heuristics for Bounded-Cost Search

Haslum, Patrik


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

CollectionsANU Research Publications
Date published: 2013
Type: Conference paper
Source: International Conference on Automated Planning & Scheduling
Access Rights: Open Access


File Description SizeFormat Image
01_Haslum_Heuristics_for_Bounded-Cost_2013.pdf491.69 kBAdobe PDF

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator