Fast collision avoidance for manipulator arms: a sequential search strategy

A sequential strategy is presented for planning collision-free motions for a manipulator arm. The basic idea behind the approach is to plan the motion of each link successively, starting from the base link. Suppose that the motion of links to link i (including link i) has been planned. This already determines the path of one end (the proximal end) of link i+1. The motion of link i+1 is now planned along this path by controlling the degree of freedom associated with it, which is a 2-D motion planning problem. This strategy results in one 1-D (the first link is degenerate) and (n-1) 2-D planning problems. The 2-D motion planning problem is to plan the motion of a single link as one end of this link moves along a fixed path. This problem is posed in t* theta space, where t is the parameter along the path and theta the angle to be planned. The obstacles in t* theta space are approximated by discretizing t. Fast and efficient techniques are then used to plan a path in t* theta space. Thus, the strategy leads to fast and efficient algorithms and is especially suited for highly redundant arms. >

[1]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[2]  B. Donald.  Motion Planning with Six Degrees of Freedom , 1984 .

[3]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[4]  L. Gouzenes.  Strategies for Solving Collision-free Trajectories Problems for Mobile and Manipulator Robots , 1984 .

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

[6]  J. Schwartz,et al.  On the Piano Movers''Problem V: The Case of a Rod Moving in Three-Dimensional Space amidst Polyhedra , 1984 .

[7]  Bernard Faverjon,et al.  Obstacle avoidance using an octree in the configuration space of a manipulator , 1984, ICRA.

[8]  Sue Whitesides,et al.  Computational Geometry and Motion Planning , 1985 .

[9]  John E. Hopcroft,et al.  On the movement of robot arms in 2-dimensional bounded regions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  S. M. Udupa,et al.  Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

[11]  R. Paul.  Robot manipulators : mathematics, programming, and control : the computer control of robot manipulators , 1981 .

[12]  V. Hayward,et al.  The use of 3-D sensing techniques for on-line collision-free path planning , 1987 .

[13]  Jean-Claude Latombe,et al.  Motion planning in the presence of moving obstacles , 1992 .

[14]  R. Brooks.  Planning Collision- Free Motions for Pick-and-Place Operations , 1983 .

[15]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[16]  James U. Korein,et al.  A geometric investigation of reach , 1985 .