202 search results - page 7 / 41 » Admissible Heuristics for Optimal Planning |
NIPS
2004
15 years 1 months ago
2004
We investigate an approach for simultaneously committing to multiple activities, each modeled as a temporally extended action in a semi-Markov decision process (SMDP). For each ac...
ICDE
2010
IEEE
15 years 5 months ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
100
click to vote
JAIR
2006
15 years 9 days ago
2006
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
125
click to vote
IJCAI
1989
15 years 1 months ago
1989
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par tially ordered plan is an operator precondition that is not yet achieved; operators,...
AIPS
2009
15 years 1 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...