Sciweavers

122 search results - page 16 / 25
» An Algorithm for Probabilistic Least-Commitment Planning
Sort
View
ATAL
2010
Springer
14 years 12 months ago
Incremental plan aggregation for generating policies in MDPs
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...
Florent Teichteil-Königsbuch, Ugur Kuter, Gui...
AAAI
2010
15 years 1 months ago
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs
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...
Andrey Kolobov, Mausam, Daniel S. Weld
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
15 years 5 months ago
HPRM: a hierarchical PRM
— 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...
Anne D. Collins, Pankaj K. Agarwal, John Harer
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
15 years 5 months ago
Toward Interactive Reaching in Static Environments for Humanoid Robots
— 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...
Evan Drumwright, Victor Ng-Thow-Hing
IJCAI
2007
15 years 1 months ago
A Hybridized Planner for Stochastic Domains
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...
Mausam, Piergiorgio Bertoli, Daniel S. Weld