An efficient retraction-based RRT planner

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2008, Pages 3743-3750

  Zhang, Liangjun ^a   Manocha, Dinesh ^a  

^a CB 3175 Sitterson Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; INDUSTRIAL ENGINEERING; OPTIMIZATION; ROBOTICS; THREE DIMENSIONAL; WAVE FUNCTIONS;

INTERNATIONAL CONFERENCES; NARROW PASSAGES;

ROBOTS;

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

References (33)

1. L. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Trans. Robot. Automat., pp. 12(4):566-580, 1996.
2. J. Kuffner and S. LaValle, "RRT-connect: An efficient approach to single-query path planning," in Proc. IEEE International Conference on Robotics and Automation, 2000.
3. S. M. LaValle, Planning Algorithms. Cambridge University Press (also available at http://msl.cs.uiuc.edu/planning/), 2006.
4. D. Hsu, J. Latombe, and H. Kurniawati, "On the probabilistic foundations of probabilistic roadmap planning," Int. J. Robotics Research, vol. 25, no. 7, pp. 627-643, 2006.
5. L. Zhang, Y. Kim, and D. Manocha, "A fast and practical algorithm for generalized penetration depth computation," in Proceedings of Robotics: Science and Systems, Atlanta, GA, USA, June 2007.
6. H. Kurniawati and D. Hsu, "Workspace-based connectivity oracle: An adaptive sampling strategy for prm planning," in Proc. of 7th International Workshop on the Algorithmic Foundations of Robotics, 2006.
7. J. van den Berg and M. Overmars, "Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners," The International Journal of Robotics Research, vol. 24, no. 12, pp. 1055-1071, Jan 2005.
8. V. Boor, M. H. Overmars, and A. F. van der Stappen, "The gaussian sampling strategy for probabilistic roadmap planners," in Proc. IEEE International Conference on Robotics and Automation, 1999, pp. 1018-1023.
9. T. Simeon, J. P. Laumond, and C. Nissoux, "Visibility based probabilistic roadmaps for motion planning," Advanced Robotics Journal, vol. 14, no. 6, 2000.
10. Z. Sun, D. Hsu, T. Jiang, H. Kurniawati, and J. Reif, "Narrow passage sampling for probabilistic roadmap planners," IEEE Trans. on Robotics, vol. 21, no. 6, pp. 1105-1115, 2005.
11. M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. M. Amato, "C-space subdivision and integration in feature-sensitive motion planning," in Proc. IEEE International Conference on Robotics and Automation, 2005.
12. N. Amato, O. Bayazit, L. Dale, C. Jones, and D. Vallejo, "Obprm: An obstacle-based prm for 3d workspaces," Proceedings of WAFR, pp. 197-204, 1998.
13. D. Hsu, L. Kavraki, J. Latombe, R. Motwani, and S. Sorkin, "On finding narrow passages with probabilistic roadmap planners," in Robotics: The Algorithmic Perspective-Proc. Workshop on the Algorithmic Foundations of Robotics (WAFR), 1998, pp. 141-154.
14. S. Redon and M. Lin, "A fast method for local penetration depth computation," Journal of Graphics Tools, vol. 11, no. 2, pp. 37-50, 2006.
15. S. Rodriguez, X. Tang, J. Lien, and N. Amato, "An obstacle-based rapidly-exploring random tree," in Proc. IEEE International Conference on Robotics and Automation, 2006, pp. 895-900.
16. S. A. Wilmarth, N. M. Amato, and P. F. Stiller, "Motion planning for a rigid body using random networks on the medial axis of the free space," in Symposium on Computational Geometry, 1999, pp. 173-180.
17. M. Foskey, M. Garber, M. Lin, and D. Manocha, "A voronoi-based hybrid planner," Proc. of IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2001.
18. K. Hoff, T. Culver, J. Keyser, M. Lin, and D. Manocha, "Interactive motion planning using hardware accelerated computation of generalized voronoi diagrams," Proceedings of IEEE Conference of Robotics and Automation, 2000.
19. S. Redon and M. Lin, "Practical local planning in the contact space," ICRA, 2005.
20. M. Saha, J. Latombe, Y. Chang, Lin, and F. Prinz, "Finding narrow passages with probabilistic roadmaps: the small step retraction method," Intelligent Robots and Systems, vol. 19, no. 3, pp. 301-319, Dec 2005.
21. H.-L. Cheng, D. Hsu, J.-C. Latombe, and G. Sánchez-Ante, "Multilevel free-space dilation for sampling narrow passages in PRM planning," in Proc. IEEE Int. Conf. on Robotics & Automation, 2006, pp. 1255-1260.
22. E. Ferr and J.-P. Laumond, "An iterative diffusion algorithm for part disassembly," in Proc. IEEE International Conference on Robotics and Automation, April 2004, pp. 3149-3154.
23. B. R. Donald, "A search algorithm for motion planning with six degrees of freedom," Artif. Intell., vol. 31, no. 3, pp. 295-353, 1987.
24. H. Hirukawa, Y. Papegay, and H. Tsukune, "A motion planning algorithm of polyhedra in contact for mechanicalassembly," in 20th International Conference on Industrial Electronics, Control and Instrumentation, vol. 2, 1994, pp. 924-929.
25. X. Ji and J. Xiao, "Planning motion compliant to complex contact states," International Journal of Robotics Research, vol. 20, no. 6, pp. 446-465, 2001.
26. J. Xiao and X. Ji, "On automatic generation of high-level contact state space," International Journal of Robotics Research, vol. 20, no. 7, pp. 584-606, July 2001.
27. A. Yershova, L. Jaillet, T. Simeon, and S. M. LaValle, "Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain," in Proc. IEEE International Conference on Robotics and Automation, 2005, pp. 3856-3861.
28. C. Pisula, K. Hoff, M. C. Lin, and D. Manocha, "Randomized path planning for a rigid body based on hardware accelerated voronoi sampling," Proc. of International Workshop on Algorithmic Foundation of Robotics, 2000.
29. E. Larsen, S. Gottschalk, M. Lin, and D. Manocha, "Fast proximity queries with swept sphere volumes," Department of Computer Science, University of North Carolina, Tech. Rep. TR99-018, 1999.
30. L. Zhang, X. Huang, Y. Kim, and D. Manocha, "D-plan: Efficient collision-free path computation for part removal and disassembly," Department of Computer Science, University of North Carolina at Chapel Hill, Tech. Rep. 08-002, 2008.
31. L. Zhang and D. Manocha, "Motion interpolation with distance constraints," Department of Computer Science, University of North Carolina at Chapel Hill, Tech. Rep. 08-001, 2008.
32. M. Strandberg, "Augmenting RRT-planners with local trees," in Proc. IEEE International Conference on Robotics and Automation, vol. 4, April 2004, pp. 3258-3262.
33. C. J. Ong and E. Huang, "An incremental version of growth distance," in Proc. of Int'l Conf. on Robotics and Automation, 1998.