163 search results - page 4 / 33 » A New Approach to Heuristic Estimations for Cost-Based Plann... |
AAAI
2010
13 years 9 months ago
2010
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...
AIPS
2009
13 years 8 months ago
2009
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...
KI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
CAEPIA
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
IJCAI
2007
13 years 9 months ago
2007
Many current state-of-the-art planners rely on forward heuristic search. The success of such search typically depends on heuristic distance-to-the-goal estimates derived from the ...