226 search results - page 7 / 46 » Heuristic Search Planning with BDDs |
PAAMS
2010
Springer
14 years 5 days ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
AIPS
2009
13 years 8 months ago
2009
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
ICCBR
2001
Springer
13 years 12 months ago
2001
Springer
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...
JAIR
2007
13 years 7 months ago
2007
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
AIPS
2008
13 years 9 months ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...