hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...