An Assembly Sequence Planning Algorithm For A Multi-Robot Cell

A computationally eftKcient assembly sequence planning algorithm for a multi-robot cell Is presented. A compact diagrammatic representation of the problem accounting for constraints which avoid collisions between the robots is introduced. The algorithm is based on dynamic programming. The computational complexity of the algorithm is O(logn/k) for m robots to assemble n elements in k groups.

[1]  Arthur C. Sanderson,et al.  AND/OR graph representation of assembly plans , 1986, IEEE Trans. Robotics Autom..

[2]  Karl G. Kempf,et al.  Opportunistic Scheduling for Robotic Machine Tending , 1985, CAIA.

[3]  Hirokazu Osaki,et al.  The Method of Analysis of Assembly Work Based on the Fastener Method , 1980 .

[4]  Helen C. Shen,et al.  Resource allocation in a flexible manufacturing system by graph matching , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[5]  Karl G. Kempf,et al.  Opportunistic scheduling for robotic assembly , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[6]  D. Dutta,et al.  Automatic Disassembly and Total Ordering in Three Dimensions , 1991 .