160 search results - page 2 / 32 » Planning Graph Heuristics for Belief Space Search |
AIPS
2011
12 years 9 months ago
2011
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
AAAI
2000
13 years 6 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
AAAI
2004
13 years 6 months ago
2004
We present a general framework for studying heuristics for planning in the belief space. Earlier work has focused on giving implementations of heuristics that work well on benchma...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
ECP
1997
Springer
13 years 9 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...