Sampling-based motion planning under kinematic loop-closure constraints

Springer Tracts in Advanced Robotics

Volumn 17, Issue , 2005, Pages 75-90

  Cortés, Juan ^a   Siméon, Thierry ^a  

^a LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

KINEMATICS; MECHANISMS;

CLOSED CHAIN MECHANISM; CLOSED-CHAINS; KINEMATIC CHAIN; KINEMATIC LOOPS; SAMPLING-BASED; SAMPLING-BASED MOTION PLANNING;

MOTION PLANNING;

EID: 84880177767     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/10991541_7     Document Type: Article

References (30)

1. Basu S., Pollack R., Roy M.-F. (2000). Computing Roadmaps of Semi-algebraic Sets on a Variety. J. Am. Math. Soc. 13(1), 55-82
2. Burdick J.W. (1988). Kinematic Analysis and Design of Redundant Robot Manipulators. PhD Thesis, Stanford University.
3. Burdick J.W. (1989). On the Inverse Kinematics of Redundant Manipulators: Characterization of the Self-Motion Manifold. Proc. IEEE Int. Conf. Rob. & Autom., 264-270
4. Canny J.F. (1988). The Complexity of Robot Motion Planning. MIT Press, Cambridge
5. Cortes J., Simeon T., Laumond J.-P. (2002). A Random Loop Generator for Planning the Motions of Closed Kinematic Chains using PRM Methods. Proc. IEEE Int. Conf. Rob. & Autom., 2141-2146
6. Cortes J., Simeon T. (2003). Probabilistic Motion Planning for Parallel Mechanisms. Proc. IEEE Int. Conf. Rob. & Autom., 4354-4359
7. Cortes J. (2003). Motion Planning Algorithms for General Closed-Chain Mechanisms. PhD Thesis, Institut National Polytechnique de Toulouse
8. Cortes J., Simeon T., Remaud-Simeon M., Tran V. (2004). Geometric Algorithms for the Conformational Analysis of Long Protein Loops. J. Comp. Chem. 25(7), 956-967
9. Finn P.W., Kavraki L.E., Latombe J.-C. et al. (1998). RAPID: Randomized Pharmacophore Identification. Comp. Geom.: Theory & Appl. 10(4), 263-272
10. Gosselin C. (1988). Kinematic Analysis, Optimization and Programming of Parallel Robotic Manipulators. PhD Thesis, McGill University
11. Han L., Amato N.M. (2001). A Kinematics-Based Probabilistic Roadmap Method for Closed Kinematic Chains. In: Donald B.R., Lynch K.M., Rus D. (Eds.) Algorithmic and Computational Robotics: New Directions (WAFR2000). A.K. Peters, Boston, 233-245
12. Kavraki L.E., Svestka P., Latombe J.-C., Overmars M.H. (1996). Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces. IEEE Trans. Rob. & Autom. 12(4), 566-580
13. Latombe J.-C. (1991). Robot Motion Planning. Kluwer Academic Publishers
14. Latombe J.-C. (1999). Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts. Int. J. Rob. Res. 18(11), 1119-1128
15. LaValle S.M., Yakey J.H., Kavraki L.E. (1999). A Probabilistic Roadmap Approach for Systems with Closed Kinematic Chains. Proc. IEEE Int. Conf. Rob. & Autom., 473-479
16. LaValle S.M., Kuffner, J.J. (2001). Rapidly-Exploring Random Trees: Progress and Prospects. In: Donald B.R., Lynch K.M., Rus D. (Eds.) Algorithmic and Computational Robotics: New Directions (WAFR2000). A.K. Peters, Boston, 293-308
17. LaValle S.M., Branicky M.S. (2004). On the Relationship Between Classical Grid Search and Probabilistic Roadmaps. In: Boissonnat J.-D., Burdick J., Goldberg K., Hutchinson S. (Eds.). Algorithmic Foundations of Roadmaps V (WAFR2002). Springer-Verlag, Berlin, 59-75
18. Lin M.C., Manocha D. (2004). Collision and Proximity Queries. In: Handbook of Discrete and Computational Geometry: Collision Detection. To appear. Available at http://www.cs.unc.edu/~dm/
19. Lozano-Perez, T. (1983). Spatial Planning: A Configuration Space Approach. IEEE Trans. Computers 32(2), 108-120
20. McCarthy J.M. (2000). Geometric Design of Linkages. Springer-Verlag, New York
21. Merlet J.-P. (2001). A Parser for the Interval Evaluation of Analytical Functions and its Applications to Engineering Problems. J. Symb. Comp. 31, 475-486
22. Nielsen J., Roth B. (1997). Formulation and Solution for the Direct and Inverse Kinematics Problem for Mechanisms and Mechatronic Systems. Proc. NATO Adv. Study Inst, on Comp. Meth. in Mech. 1, 233-252
23. Porta J.M., Ros L., Thomas F., Torras C. (2003). A Branch-and-Prune Algorithm for Solving Systems of Distance Constraint. Proc. IEEE Int. Conf. Rob. & Autom., 342-348
24. Simeon T., Laumond J.-P., Nissoux C. (2000). Visibility-Based Probabilistic Roadmaps for Motion Planning. Adv. Rob. J. 14(6), 477-494
25. Simeon T., Laumond J.-P., Lamiraux F. (2001). Move3D: a Generic Platform for Path Planning. Proc. IEEE Int. Symp. Assembly & Task Planning, 25-30
26. Simeon T., Laumond J.-P., Cortes J., Sahbani A. (2004). Manipulation Planning with Probabilistic Roadmaps. Int. J. Rob. Res., in press
27. Thomas F. (1993). The Self-Motion Manifold of the N-bar Mechanism. In: Angeles J., Hommel G., Kovacs P. (Eds.) Computational Kinematics. Kluwer Academic Publishers, Dordrecht, 95-107
28. Trinkle J.C., Milgram R.J. (2002). Complete Path Planning for Closed Kinematic Chains with Spherical Joints. Int. J. Rob. Res. 21(9), 773-789
29. Yakey J.H. (2000). Randomized Path Planning for Linkages with Closed Kinematic Chains. MA Thesis, Iowa State University
30. Yakey J.H., LaValle S.M., Kavraki L.E. (2001). Randomized Path Planning for Linkages with Closed Kinematic Chains. IEEE Trans. Rob. & Autom. 17(6), 951-958