Application of a model-free algorithm for the packing of irregular shaped objects in semiconductor manufacture

A robotic system has been developed to automate the crucible packing process in the CZ semiconductor wafer production. It requires the delicate manipulation and packing of highly irregular shaped polycrystalline silicon nuggets, into a fragile glass crucible. An online algorithm is presented to plan the packing. It uses a method called virtual trial and error. The online algorithm handles large numbers of highly irregularly shaped object of different sizes without requiring the object models. Working with the 3D range maps of objects, it is computationally fast enough to be applied in real-time to practical industrial applications, such as the CZ wafer manufacture. Simulation results show that it compares well with the human performance. The integrated system is shown to achieve high production rates, required precision and cost effectiveness.

[1]  Gerhard J. Woeginger,et al.  A Lower Bound for On-Line Vector-Packing Algorithms , 1993, Acta Cybern..

[2]  Yossi Azar,et al.  On Two Dimensional Packing , 1997, J. Algorithms.

[3]  Mary P. Harper,et al.  A tight lower bound for optimal bin packing , 1995, Oper. Res. Lett..

[4]  R. P. Pargas,et al.  A parallel stochastic optimization algorithm for solving 2D bin packing problems , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.

[5]  P. P. Chakrabarti,et al.  Improving Greedy Algorithms by Lookahead-Search , 1994, J. Algorithms.

[6]  Vivek Anand Sujan.  The sensor based manipulation of irregularly shaped objects with special application to the semiconductor industry , 1998 .

[7]  Cheng-Yan Kao,et al.  On solving rectangle bin packing problems using genetic algorithms , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[8]  J. O. Berkey,et al.  A Systolic-Based Parallel Bin Packing Algorithm , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  Harry H. Cheng,et al.  Stacking irregular-sized packages by a robot manipulator , 1995, IEEE Robotics Autom. Mag..

[10]  Kam-Hoi Cheng,et al.  Heuristic Algorithms for On-Line Packing in Three Dimensions , 1992, J. Algorithms.

[11]  M. V. Novozhilova,et al.  Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem , 1996 .

[12]  Mohan S. Kankanhalli,et al.  Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis , 1993, Inf. Process. Lett..

[13]  Anthony Christopher Leier,et al.  The grasping and manipulation of irregularly shaped objects with application to semiconductor industry , 1998 .

[14]  Edward F. Grove.  Online bin packing with lookahead , 1995, SODA '95.

[15]  Paul F. Whelan,et al.  Flexible packing of arbitrary two-dimensional shapes , 1993 .

[16]  Bernard T. Han,et al.  Multiple-type, two-dimensional bin packing problems: Applications and algorithms , 1994, Ann. Oper. Res..

[17]  A. Mühlbauer,et al.  Float-Zone Grown Silicon , 1981 .