|
Abstract : |
This paper describes the application of a recent approach to path planning for robots with many degrees of freedom (dof) to articulated robots moving in two or three dimensional static environments. The planning approach, which itself is not restricted to articulated robots, consists of a preprocessing and a planning stage. Preprocessing is done only once for a given environment and generates a connected network of randomly, but properly selected, collision-free configurations (nodes). Planning then connects any given initial and final configurations of the robot to two nodes of the network and computes a path through the network between these two nodes. We show that af-ter paying the preprocessing cost (on the order of minutes on a DEC Alpha workstation), planning is extremely fast (ranging from a fraction of a second to, at most, a few seconds) for many difficult examples involving 7-dof and 12-dof robots. The approach is particularly attractive for many-dof robots which have to perform many successive point-to-point motions in the same environment., |
