160 search results - page 10 / 32 » Planning Graph Heuristics for Belief Space Search |
AIPS
2000
14 years 11 months ago
2000
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion...
AIPS
2008
14 years 12 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
137
click to vote
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
132
click to vote
IJCAI
1989
14 years 10 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...