A Discrete Algorithm for Fixed-path ’Ikajevctory Generation at Kinematic Singularities

lloyd @ cs.ubc.ca An algorithm is presented for computing the necessary time-scaling to allow a non-redundant manipulator to fol-low a fixed Cartesian path containing kinematic singular-ities. The resulting trajectory is close to minimum-time, subject to bounds on joint velocities and accelerations. The algorithm assigns a series of knot points along the path, increasing the knot density in the vicinity of singularities. Appropriate path velocities are then computed for each knot point. Two experiments involving the PUMA manipulator are shown. 1