Sciweavers

16 search results - page 1 / 4
» Extracting Effective and Admissible State Space Heuristics f...
Sort
View
AAAI
2000
13 years 5 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
AIPS
2000
13 years 5 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
AIPS
2004
13 years 6 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal
AAAI
2007
13 years 6 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...
AIPS
2004
13 years 6 months ago
Heuristic Guidance Measures for Conformant Planning
Scaling conformant planning is a problem that has received much attention of late. Many planners solve the problem as a search in the space of belief states, and some heuristic gu...
Daniel Bryce, Subbarao Kambhampati