Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Bounded deviation joint path algorithms for piecewise cubic polynomial trajectories

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)
Choi, B.K. ; Dept. of Ind. Eng., Chonbuk Nat. Univ., South Korea ; Kim, D.W.

Presented are three bounded deviation joint path (BDJP) algorithms which generate only enough intermediate knots, sampled from a smooth Cartesian path, for piecewise cubic polynomial joint trajectories. The first algorithm is basically the one proposed by R.H. Taylor (1979), and it is based on position transformations. The second algorithm utilizes inverse velocity transformations, and direct velocity transformations are used in the third algorithm. The proposed BDJP algorithms are aimed to be used in process applications of industrial robots, such as arc welding and contour grinding, in which the desired Cartesian paths are smooth free-formed curves and it is necessary to keep the manipulator acceptably close to the desired path

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:20 ,  Issue: 3 )