Sciweavers

226 search results - page 9 / 46
» Heuristic Search Planning with BDDs
Sort
View
JAIR
2006
93views more  JAIR 2006»
13 years 7 months ago
Planning Graph Heuristics for Belief Space Search
Daniel Bryce, Subbarao Kambhampati, David E. Smith
CI
2005
57views more  CI 2005»
13 years 7 months ago
Hybrid ACE: Combining Search Directions for Heuristic Planning
Dimitris Vrakas, Ioannis P. Vlahavas
AIPS
2000
13 years 8 months ago
Admissible Heuristics for Optimal Planning
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...
Patrik Haslum, Hector Geffner
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
14 years 1 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
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...
Rüdiger Ebendt, Rolf Drechsler
AAAI
2007
13 years 9 months ago
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
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...