Complete path planning for a planar 2-R manipulator with point obstacles

In this paper we develop a systematic topological approach to motion planning for a planar 2-R manipulator with point obstacles. By considering components in the free space for the second joint as the first joint varies, we build a two-dimensional array representing the cells of the free space and an associated graph representing the boundaries of those cells. Using this graph, we derive a closed formula for the number of components of the free space. At the same time we solve the motion existence problem, namely, when are two arbitrary configurations in the same component? If so, we develop two explicit algorithms for constructing the path - a middle path method and a linear interpolation method. These algorithms give complete solutions to the path planning problem. Extensive examples are worked out which verify the correctness and efficiency of the resulting program. Then we briefly discuss how these methods generalize to a 3-R planar manipulator.