Hybrid probabilistic RoadMap - Monte Carlo motion planning for closed chain systems with spherical joints

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2004, Issue 1, 2004, Pages 920-926

  Han, Li ^a  

^a CLARK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED CHAIN SYSTEMS; HYBRID PROBABILISTIC ROADMAP-MONTE CARLO (PRM-MC) MOTION PLANNER; PIVOT MOTION; SPHERICAL JOINTS;

ANIMATION; COLLISION AVOIDANCE; DEGREES OF FREEDOM (MECHANICS); KINEMATICS; MONTE CARLO METHODS; PROBLEM SOLVING; ROTATION;

MOTION PLANNING;

EID: 3042535868     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. J. C. Latombe, Robot Motion Planning. Boston, MA: Kluwer Academic Publishers, 1991.
2. J. F. Canny, "On computability of fine motion plans," in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 1989, pp. 177-182.
3. N. M. Amato, O. B. Bayazit, L. K. Dale, C. V. Jones, and D. Vallejo, "OBPRM: An obstacle-based PRM for 3D workspaces," in Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 1998, pp. 155-168.
4. N. M. Amato and L. K. Dale, "Probabilistic roadmap methods are embarrassingly parallel," in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 1999, pp. 688-694.
5. N. M. Amato and Y. Wu, "A randomized roadmap method for path and manipulation planning," in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 1996, pp. 113-120.
6. V. Boor, M. H. Overmars, and A. F. van der Stappen, "The Gaussian sampling strategy for probabilistic roadmap planners," in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 1999, pp. 1018-1023.
7. L. Kavraki and J. C. Latombe, "Randomized preprocessing of configuration space for fast path planning," in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 1994, pp. 2138-2145.
8. L. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Trans. Robot. Automat., vol. 12, no. 4, pp. 566-580, August 1996.
9. 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 Proc. ACM Symp. on Computational Geometry (SoCG), 1999, pp. 173-180.
10. M. Apaydin, D. Brutlag, C. Guestrin, D. Hsu, and J.-C. Latombe, "Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion," in Proc. Int. Conf. Comput. Molecular Biology (RECOMB), 2002, pp. 12-21.
11. G. Song, S. L. Thomas, and N. M. Amato, "A general framework for prm motion planning," in Proc. IEEE Int. Conf. Robot, Autom. (ICRA), 2003.
12. D. Stewart, "A platform with six degrees of freedom," Proc. of the Institute of Mechanical Engineering, vol. 180, no. part I(5), pp. 171-186, 1954.
13. A. Singh, J. Latombe, and D. Brutlag, "A motion planning approach to flexible ligand binding," in 7th Int. Conf. on Intelligent Systems for Molecular Biology (ISMB), 1999, pp. 252-261.
14. K. Kotay, D. Rus, M. Vona, and C. McGray, "The self-reconfiguring robotic molecule: Design and control algorithms," in Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 1998, pp. 375-386.
15. A. Nguyen, L. J. Guibas, and M. Yim, "Controlled module density helps reconfiguration planning," in Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 2000.
16. J. Trinkle, A.O.Farahat, and P. Stiller, "First-order stability cells of active multi-rigid-body systems," IEEE Trans. Robot. Automat., vol. 11, no. 4, pp. 545-557, 1995.
17. O. Khatib, K. Yokoi, K. Chang, D. Ruspini, R. Holmberg, and A. Casal, "Vehicle/arm coordination and multiple mobile manipulator decentralized cooperation," in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 1996, pp. 546-553.
18. L. Han, "A hybrid probabilistic roadmap - monte carlo motion planner for articulated robots and proteins," Clark University, Tech. Rep., 2003.
19. L. Han and N. M. Amato, "A kinematics-based probabilistic roadmap method for closed chain systems," in Algorithmic and Computational Robotics - New Directions (WAFR 2000), 2000, pp. 233-246.
20. L. Kavraki, F. Lamiraux, and C. Holleman, 'Towards planning for elastic objects," in Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 1998.
21. S. LaValle, J. Yakey, and L. Kavraki, "A probabilistic roadmap approach for systems with closed kinematic chains," in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 1999.
22. W. Lenhart and S. Whitesides, "Reconfiguring closed polygon chains in euclidean d-space," Discrete and Computational Geometry, vol. 13, pp. 123-140, 1995.
23. R. Milgram and J. Trinkle, "The geometry of configuration spaces for closed chains in two and three dimensions," Homology Homotopy and Applications, 2002, to appear.
24. I. Trinkle and R. Milgram, "Complete path planning for closed kinematic chains with spherical joints," Int. J. Robot. Res., vol. 21, no. 9, pp. 773-789, 2002.
25. P. Erdos, "Problem 3763," Amer. Math. Monthly, vol. 42, p. 627, 1935.
26. B. de. Sz.Nagy, "Solution to problem 3763," Amer. Math. Monthly, vol. 46, pp. 176-177, 1939.
27. G. T. Toussaint, "The Erdos-Nagy theorem and its ramifications," Proc. ACM Symp. on Computational Geometry (SoCG), 1999.
28. T. C. Biedl, E. D. Demaine, M. L. Demaine, S. Lazard, A. Lubiw, J. OŔourke, M. H. Overmas, S. Robbins, I. Streinu, G. T. Toussaint, and S. Whitesides, "Locked and unlocked polygonal chains in three dimensions," Discrete and Computational Geometry, vol. 26, pp. 269-281, 2001, one of the papers that showed the existence of multiple components, in the collision-free space of polygonal chains.
29. E. Demaine, S. Langerman, J. OŔourke, and J. Snoeyink. "Interlocked open linkages with few joints," in Proc. ACM Symp. on Computational Geometry (SoCG), 2002, pp. 189-198.
30. H. Alt, C. Knauer, G. Rote, and S. Whitesides, "The complexity of (un)folding," in Proc. ACM Symp. on Computational Geometry (SoCG), 2003, pp. 164-170.
31. D. Hsu, L. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin, "On finding narrow passages with probabilistic roadmap planners," in Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 1998.
32. S. M. LaValle and J. J. Kuffner, "Rapidly-Exploring Random Trees: Progress and Prospects," in Proc. Int. Workshop on Algorithmic: Foundations of Robotics (WAFR), 2000, pp. SA45-SA59.
33. C. Holleman and L. E. Kavraki, "A framework for using the workspace medial axis in prm planners," in Proceedings of the 2000 International Conference on Robotics and Automation (ICRA 2000 ). San Fransisco, CA: IEEE Press, 2000, pp. 1408-1413.
34. N. M. Amato, "Motion planning group webpage," http://parasol-www.cs.tamu.edu/people/amato/.
35. R. Sedgewick, Algorithms in C++, Part V: Graph Algorithms. Addison-Wesley, 2001.
36. S. Gottschalk, M. Lin, and D. Manocha, "Obb-tree: A hierarchical structure for rapid interference detection," University of N. Carolina, Chapel Hill, CA, Technical Report TR96-013, 1996.
37. W. Lenhart and S. Whitesides, "Reconfiguring closed polygon chains in euclidean d-space," Discrete and Computational Geometry, vol. 13, pp. 123-140, 1995.