160 search results - page 4 / 32 » Planning Graph Heuristics for Belief Space Search |
ICTAI
2005
IEEE
15 years 6 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
AIPS
2000
15 years 2 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...
109
Voted
AI
2008
Springer
15 years 24 days ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
130
Voted
AIPS
2006
15 years 2 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
99
Voted
PUK
2003
15 years 2 months ago
2003