1589 search results - page 47 / 318 » Multiple-Goal Heuristic Search |
AIPS
2006
13 years 11 months ago
2006
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...
ICCBR
2007
Springer
14 years 4 months ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
CCCG
1996
13 years 11 months ago
1996
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...
EOR
2008
13 years 10 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
CP
2008
Springer
13 years 11 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...