179 search results - page 6 / 36 » Using Classical Planners to Solve Nondeterministic Planning ... |
125
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
109
click to vote
AIPS
2000
15 years 3 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...
140
Voted
AIPS
2006
15 years 3 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...
117
Voted
AI
2008
Springer
15 years 2 months 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...
118
click to vote
AIPS
2011
14 years 5 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...