By Topic

Sequence optimization for high speed robotic assembly using simulated annealing

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

2 Author(s)
Park, Jahng-Hyon ; Dept. of Mech. Eng., MIT, Cambridge, MA, USA ; Asada, H.

Optimal task sequence planning using a simulated annealing technique is developed for a high throughput chip placement machine. To minimize tact time, chips are mounted by multiple robots on moving PC boards being transferred by a precision conveyer. To avoid both geometric and dynamic interferences among multiple robots, while minimizing the tact time, the sequence of operations as well as the allocation of the multiple robots are optimized by using simulated annealing. The optimization problem is a type of traveling salesman problem, but is highly complicated because the target destinations for placing individual chips keep moving together with the PC board. First, the configuration of the new chip placement system is described. The task sequence optimization problem is then formulated, followed by the application of simulated annealing to solving the problem. An efficient algorithm for perturbing a task sequence is developed and applied to practical chip placement tasks

Published in:

Robotics and Automation, 1994. Proceedings., 1994 IEEE International Conference on

Date of Conference:

8-13 May 1994