By Topic

Determining the collision-free joint space graph for two cooperating robot manipulators

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

3 Author(s)
Q. Xue ; Purdue Univ., West Lafayette, IN, USA ; A. A. Maciejewski ; P. C. -Y. Sheu

The problem of path planning for two planar robot manipulators that cooperate in carrying a rectangular object from an initial position and orientation to a destination position and orientation in a 2-D environment is investigated. The two robot arms, the carried object, and the straight line connecting the two robot bases are modeled as a 6-link closed chain. The problem of path planning for the chain is solved by two major algorithms: a collision-free feasible-configuration-finding algorithm and a collision-free path-finding algorithm. The former maps the free space in the Cartesian world space to the robot's joint space in which all the collision-free feasible configuratiions (CFFCs) for the 6-link closed chain are found. The latter builds a connection graph representing the CFFCs and the transitions between any two groups of CFFCs at adjacent joint intervals. A graph search method is employed to find a collision-free path for each joint of both manipulators

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:23 ,  Issue: 1 )