547 search results - page 2 / 110 » A Planning Algorithm not based on Directional Search |
97
Voted
JAIR
2000
15 years 28 days ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
125
Voted
CI
2006
15 years 1 months ago
2006
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
124
Voted
JAIR
2006
15 years 1 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
98
Voted
PAAMS
2010
Springer
15 years 6 months 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...
103
Voted
MATES
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Searching for information in large rather unstructured realworld data sets is a di cult task, because the user expects immediate responses as well as high-quality search ...