Sciweavers

179 search results - page 2 / 36
» An LP-Based Heuristic for Optimal Planning
Sort
View
AIPS
2006
13 years 6 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AAAI
2007
13 years 7 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
2000
13 years 6 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
AAAI
2010
13 years 6 months ago
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
Carmel Domshlak, Erez Karpas, Shaul Markovitch
AIPS
2010
13 years 7 months ago
The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning
The problem of effectively combining multiple heuristic estimators has been studied extensively in the context of optimal planning, but not in the context of satisficing planning....
Gabriele Röger, Malte Helmert