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]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.