By Topic

Dynamic Point-to-Point Trajectory Planning of a Two-DOF Cable-Suspended Parallel Robot

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)
Gosselin, C. ; Dept. of Mech. Eng., Univ. Laval, Quebec City, QC, Canada ; Foucault, S.

This paper presents two trajectory-planning approaches for the point-to-point motion of planar two-degree-of-freedom (dof) cable-suspended parallel mechanisms. The proposed techniques can be used to plan trajectories that extend beyond the static workspace of the mechanism. Trajectories are specified as a list of target points that must be reached in sequence, with a zero velocity at each of the target points. In the first technnique, polynomial trajectories are designed to connect the target points, while the second approach uses trigonometric functions. Both techniques ensure continuity of the accelerations. Based on the dynamic model of the robot, algebraic inequalities are obtained that represent the constraints on cable tensions. These inequalities are used to determine the feasibility of the planned trajectories. Polynomial trajectories must be discretized in order to verify feasibility, while trajectories that are based on trigonometric functions can be verified globally, based on a set of simple algebraic equations. Example trajectories are given in order to illustrate the approach. An experimental validation is also presented using a two-dof prototype, and two video extensions are provided to demonstrate the results.

Published in:

Robotics, IEEE Transactions on  (Volume:30 ,  Issue: 3 )