Planning for manipulation with adaptive motion primitives

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2011, Pages 5478-5485

  Cohen, Benjamin J ^a   Subramanian, Gokul ^a   Chitta, Sachin ^b   Likhachev, Maxim ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Willow Garage Inc   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE MOTION; HIGH DIMENSIONALITY; MOBILE MANIPULATION; MOTION PLANNING ALGORITHMS; MOTION TRAJECTORIES; ON-THE-FLY; SEARCH-BASED; SUBOPTIMALITY;

ROBOTICS;

EID: 84862286092     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2011.5980550     Document Type: Conference Paper

References (14)

1. R. Bohlin and L. Kavraki. Path planning using lazy prm. In IEEE International Conference on Robotics and Automation, VOL. 1, 2007.
2. B. Cohen, S. Chitta, and M. Likhachev. Search-based planning for manipulation with motion primitives. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2010.
3. 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.
4. E. Frazzoli and S. Karaman. Incremental sampling-based algorithms for optimal motion planning. Int. Journal of Robotics Research, 2010.
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. 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.
8. 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), pages 995-1001, 2000.
9. M. Likhachev and D. Ferguson. Planning long dynamically-feasible maneuvers for autonomous vehicles. International Journal of Robotics Research (IJRR), 2009.
10. 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.
11. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1984.
12. 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.
13. R. Zhou and E. A. Hansen. Multiple sequence alignment using A*. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2002. Student abstract.
14. 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.