Skip navigation
Skip navigation

New Admissible Heuristics for Domain-Independent Planning

Haslum, Patrik; Bonet, Blai; Geffner, Hector


Admissible heuristics are critical for effective domain-independent planning when optimal solutions must be guaranteed. Two useful heuristics are the hm heuristics, which generalize the reachability heuristic underlying the planning graph, and pattern database heuristics. These heuristics, however, have serious limitations: reachability heuristics capture only the cost of critical paths in a relaxed problem, ignoring the cost of other relevant paths, while PDB heuristics, additive or not,...[Show more]

CollectionsANU Research Publications
Date published: 2005
Type: Conference paper
Source: Proceedings of American Association for Artificial Intelligence Conference 2006


File Description SizeFormat Image
01_Haslum_New_Admissible_Heuristics_for_2005.pdf675.05 kBAdobe PDF    Request a copy

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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator