Sciweavers

655 search results - page 11 / 131
» Evolving Heuristics for Planning
Sort
View
AAAI
2010
15 years 1 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
95
Voted
ICCBR
2001
Springer
15 years 4 months ago
An Accurate Adaptation-Guided Similarity Metric for Case-Based Planning
In this paper, we present an adaptation-guided similarity metric based on the estimate of the number of actions between states, called ADG (Action Distance-Guided). It is determine...
Flavio Tonidandel, Marcio Rillo
CCCG
1996
15 years 1 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
AIPS
2008
15 years 2 months ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner
PUK
2000
15 years 1 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp