160 search results - page 9 / 32 » Planning Graph Heuristics for Belief Space Search |
NIPS
2007
14 years 11 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
AAAI
2010
14 years 11 months ago
2010
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
AIPS
2000
14 years 11 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
TKDE
2008
14 years 9 months ago
2008
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
UAI
1996
14 years 11 months ago
1996
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...