914 search results - page 3 / 183 » The Computational Complexity of Probabilistic Planning |
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...
AAAI
2000
13 years 6 months ago
2000
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
AI
2008
Springer
13 years 5 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...
AIPS
2006
13 years 6 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...
JAIR
2008
13 years 5 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...