PATH PLANNING FOR A MANIPULATOR WITH CONSTRAINTS ON ORIENTATION

This paper discusses the work undertaken at the U.K. National Advanced Robotics Research Centre in the area of path planning. Experiments ha ve been undertaken with the Best First Planner (BFP) and Random Path P lanner (RPP) algorithms developed at Stanford University by Barraquand and Latombe. These look particularly suitable for solving a wide rang e of motion planning problems and for providing the basic mechanism fo r path planning in an advanced robotic architecture. From this basic m echanism higher level functional primitives have been developed to ena ble paths to be planned with a pre-defined orientation of the end effe ctor at the goal location or maintaining an orientation throughout the whole path. These functions are achieved through placing additional c onstraints on the search through configuration space and modifying the workspace potential.