Toward Complete Path Planning for Planar 3R-Manipulators Among Point Obstacles

The problem of planning a collision-free motions of a planar 3R-manipulator among point obstacles is studied using techniques from topology and homology. By completely characterizing the set of singular configurations (the points in configuration space corresponding to an intersection of the chain with itself or a point obstacle), the complementary space, the free space, is also completely characterized. This characterization dictates an exact, complete, motion planning algorithm that builds on the authors’ algorithm developed for 2R-manipulators [13]. Results obtained with a preliminary version of the algorithm are given.

[1]  Jeffrey C. Trinkle,et al.  Complete path planning for a planar 2-R manipulator with point obstacles , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[2]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[3]  Koichi Kondo,et al.  Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..

[4]  Yong K. Hwang,et al.  SANDROS: a dynamic graph search algorithm for motion planning , 1998, IEEE Trans. Robotics Autom..

[5]  Dan Halperin,et al.  On the complexity of a single cell in certain arrangements of surfaces related to motion planning , 1994, Discret. Comput. Geom..

[6]  Jeffrey C. Trinkle,et al.  Complete Path Planning for Closed Kinematic Chains with Spherical Joints , 2002, Int. J. Robotics Res..

[7]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[8]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[9]  Narendra Ahuja,et al.  A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..

[10]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[11]  Kamal K. Gupta,et al.  Fast collision avoidance for manipulator arms: a sequential search strategy , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[12]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

[13]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[14]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[15]  Lydia E. Kavraki,et al.  Randomized path planning for linkages with closed kinematic chains , 2001, IEEE Trans. Robotics Autom..

[16]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.