Search-based planning for manipulation with motion primitives

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2010, Pages 2902-2908

  Cohen, Benjamin J ^a   Chitta, Sachin ^b   Likhachev, Maxim ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Willow Garage Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC ACTIONS; EXPERIMENTAL ANALYSIS; HEURISTIC SEARCH; MOBILE MANIPULATION; MOTION PRIMITIVES; MOTION TRAJECTORIES; OPTIMALITY; PLANNING PROBLEM; ROBOTIC MANIPULATION; ROBOTIC MANIPULATORS; SEARCH-BASED; SUBOPTIMALITY;

COST BENEFIT ANALYSIS; PLANNING; ROBOTICS; ROBOTS;

ROBOT PROGRAMMING;

EID: 77955798119     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2010.5509685     Document Type: Conference Paper

References (19)

1. R. Bohlin and L. Kavraki. Path planning using lazy prm. In IEEE International Conference on Robotics and Automation, VOL.1, 2007.
2. Pang C. Chen and Yong K. Hwang. Sandros: A dynamic graph search algorithm for motion planning. In IEEE Transactions on Robtics and Automation, VOL. 14, 1998.
3. Howard Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki, and Sebastian Thrun. In Principles of Robot Motion, pages 203-215. Cambridge, MA: MIT Press, 2005.
4. A. Kanehiro et al. Whole body locomotion planning of humanoid robots based on a 3d grid map. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2005.
5. D. Furcy. Chapter 5 of Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search. PhD thesis, Georgia Institute of Technology, 2004.
6. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science, and Cybernetics, SSC-4(2):100-107, 1968.
7. Nazareth Bedrossian Jeff M. Phillips and Lydia E. Kavraki. Guided expansive spaces trees: A search strategy for motion- and cost-constrained state spaces. In Proceedings of the International Conference on Robotics and Automation (ICRA), 2004.
8. L. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4):566-580, 1996.
9. S. Koenig and M. Likhachev. Incremental A*. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems (NIPS) 14. Cambridge, MA: MIT Press, 2002.
10. J.J. Kuffner and S.M. LaValle. RRT-connect: An efficient approach to single-query path planning. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2000.
11. M. Likhachev and D. Ferguson. Planning long dynamically-feasible maneuvers for autonomous vehicles. International Journal of Robotics Research (IJRR), 2009.
12. M. Likhachev, G. Gordon, and S. Thrun. ARA*: Anytime A* with provable bounds on sub-optimality. In Advances in Neural Information Processing Systems (NIPS) 16. Cambridge, MA: MIT Press, 2003.
13. Richard M. Murray, Zexiang Li, and S. Shankar Sastry. A Mathematical Introduction to Robotic Manipulation. CRC Press, 1994.
14. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1984.
15. Nathan Ratliff, Matt Zucker, J. Andrew Bagnell, and Siddhartha Srinivasa. Chomp: Gradient optimization techniques for efficient motion planning. In IEEE International Conference on Robotics and Automation, 2009.
16. A. Stentz. The focussed D* algorithm for real-time replanning. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 1652-1659, 1995.
17. Ioan Alexandru Sucan and Lydia E. Kavraki. Kinodynamic motion planning by interior-exterior cell exploration. In International Workshop on the Algorithmic Foundations of Robotics, 2008.
18. R. Zhou and E. A. Hansen. Multiple sequence alignment using A*. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2002. Student abstract.
19. R. Zhou and E. A. Hansen. Beam-stack search: Integrating backtracking with beam search. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), pages 90-98, 2005.