1639 search results - page 10 / 328 » Anytime Heuristic Search |
AIPS
2006
13 years 9 months ago
2006
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
IJAMCIGI
2010
13 years 2 months ago
2010
In recent years a lot of novel (mostly naturally inspired) search heuristics have been
IJCAI
1989
13 years 8 months ago
1989
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, an...
ECAI
2004
Springer
14 years 26 days ago
2004
Springer
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
IJCAI
2001
13 years 8 months ago
2001
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...