By Topic

Scheduling approaches for robotic assembly tasks

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)
Sutdhiraksa, S. ; Lab. for Robotics & Intelligent Syst., Swinburne Univ. of Technol., Melbourne, Vic., Australia ; Zurawski, R.

In this paper, we present an approach to robotic assembly task scheduling which yields suboptimal solutions. The robotic assembly system involves two robot arms working in the same workspace. The collision free operation of the two robot arms is guaranteed by the use of the uniform cell decomposition approach. Timed Petri nets are used to model the assembly activities. The execution times of the assembly activities are determined during the generation of the reachability graph. Several approaches used to generate the reachability graph and determine the minimum-time paths are proposed

Published in:

Emerging Technologies and Factory Automation, 1996. EFTA '96. Proceedings., 1996 IEEE Conference on  (Volume:2 )

Date of Conference:

18-21 Nov 1996