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

The robot task-sequencing planning problem

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

1 Author(s)
Maimon, O. ; Dept. of Ind. Eng., Tel-Aviv Univ., Israel

The problem of how to utilize some robot task flexibility characteristics efficiently is addressed. For a given set of robots and a set of tasks which can be accomplished through several alternative sequences of motions and operations, the robot task-sequencing planning problem is to determine the optimal sequence of paths for each robot such that all the tasks are executed with a total minimum cost (e.g. time). A framework and a classification for such types of problems are provided, and one class of problems is studied. The problems are solved according to the proposed decomposition scheme. Special considerations, such as the capacity of the robot end effector and coordination planning among several robots, are included in the algorithms. An example illustrates the problem and the solution

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:6 ,  Issue: 6 )