Haslum, Patrik; Botea, Adi; Helmert, Malte; Bonet, Blai; Koenig, Sven
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively guide the search. Pattern database heuristics (PDBs), which are based on abstractions of the search space, are currently one of the most promising approaches to developing better admissible heuristics. The informedness of PDB heuristics depends crucially on the selection of appropriate abstractions (patterns). Although...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.