122 search results - page 16 / 25 » An Algorithm for Probabilistic Least-Commitment Planning |
72
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
63
Voted
AAAI
2010
14 years 11 months ago
2010
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
67
Voted
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
— We introduce a hierarchical variant of the probabilistic roadmap method for motion planning. By recursively refining an initially sparse sampling in neighborhoods of the C-obs...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— Reaching is a critical task for humanoid robots, requiring the application of state-of-the-art algorithms for motion planning and inverse kinematics. Practical algorithms for s...
IJCAI
2007
14 years 11 months ago
2007
Markov Decision Processes are a powerful framework for planning under uncertainty, but current algorithms have difficulties scaling to large problems. We present a novel probabil...