By Topic

Constrained time-efficient and smooth cubic spline trajectory generation for industrial robots

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
$33 $33
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

3 Author(s)
B. Cao ; Dept. of Electr. & Electron. Eng., Queen's Univ., Belfast, UK ; G. I. Dodds ; G. W. Irwin

An approach to constrained time-efficient and smooth cubic spline trajectory generation is presented. A function to combine the minimisation of travelling time with smoothness of the robot trajectories is proposed. Cubic splines are used to describe the joint trajectories which satisfy constraints on velocity, acceleration and jerk. The algorithm combining the penalty function and polytope method is developed and used to find the globally optimal solution to the optimisation problems. Minimisation of the energy, the vibrations and the mechanical wear of the robotic system is also explained intuitively. The effects of the weights in the objective function and of control knots on smoothness, time optimality and path deviation errors are shown mainly by simulation. The simulation results also show that path deviation errors can be reduced through suitably choosing the weights in the objective function, whereas a solely time-efficient trajectory generation scheme only fully utilises the slowest joint capabilities. The feasibility of the method is further illustrated by experimental results with a SCARA type robot

Published in:

IEE Proceedings - Control Theory and Applications  (Volume:144 ,  Issue: 5 )