By Topic

Generating robust trajectories in the presence of ordinary and linear-self-motion singularities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lloyd, J.E. ; Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada ; Hayward, V.

An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to minimum time, given an inverse kinematic solution for the path and bounds on joint velocities and accelerations. The algorithm has complexity O(M log M), with respect to the number of joint coordinates M, and works using “coordinate pivoting”, in which the path timing is generated locally with respect to whichever joint coordinate is changing the fastest. This allows the handling of singularities, including linear self-motions (e.g., wrist singularities), where the path speed is zero but other joint velocities are non-zero. Examples involving the PUMA manipulator are shown

Published in:

Robotics and Automation, 1998. Proceedings. 1998 IEEE International Conference on  (Volume:4 )

Date of Conference:

16-20 May 1998