This work presents a novel method for deriving an efficient collision-free-path in a configuration space. The proposed algorithm combines a Network Planning. Algorithm (NPA) with the Dijkstra algorithm to determine the path. This study also proposes a joint configuration space, where the motion freedom constrained by the obstacles maps to the degree of freedom of the joint configuration. As proposed herein, the most efficient means of generating the shortest path in the configuration space is to plan a straight line from the starting point to the goal point via segments with the shortest length, which cross the surface patches of the obstacles. Thus, this work concentrates on a local shortest distance path-planning task for a freeform surface model. Finally, several illustrative examples demonstrate the shortest path for the PUMA type robot, confirming that the proposed method works in different environments.
|頁（從 - 到）||85-93|
|期刊||International Journal of Robotics Research|
|出版狀態||Published - 1 十二月 1996|