226 search results - page 22 / 46 » Heuristic Search Planning with BDDs |
77
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
111
click to vote
ICGA
2007
14 years 11 months ago
2007
This article presents a new real-time heuristic search method for planning problems with distinct stages. Our multistage nested rollout algorithm allows the user to apply separate...
190
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
AIPS
2000
15 years 1 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
161
click to vote
AIPS
2011
14 years 3 months ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...