Browse > Article

Path Planning of Automated Optical Inspection Machines for PCB Assembly Systems  

Park Tae-Hyoung (School of Electrical and Computer Engineering, Chungbuk National University)
Kim Hwa-Jung (R&D Center, KEC Mechatronics Co., Ltd.)
Kim Nam (School of Electrical and Computer Engineering, Chungbuk National University)
Publication Information
International Journal of Control, Automation, and Systems / v.4, no.1, 2006 , pp. 96-104 More about this Journal
Abstract
We propose a path planning method to improve the productivity of AOI (automated optical inspection) machines in PCB (printed circuit board) assembly lines. The path-planning problem is the optimization problem of finding inspection clusters and the visiting sequence of cameras to minimize the overall working time. A unified method is newly proposed to determine the inspection clusters and visiting sequence simultaneously. We apply a hybrid genetic algorithm to solve the highly complicated optimization problem. Comparative simulation results are presented to verify the usefulness of the proposed method.
Keywords
AOI machine; genetic algorithm; path planning; optimization; PCB assembly;
Citations & Related Records

Times Cited By Web Of Science : 3  (Related Records In Web of Science)
Times Cited By SCOPUS : 3
연도 인용수 순위
1 H. H. Loh and M. S. Lu, 'Printed circuit board inspection using image analysis,' IEEE Trans. on Industry Applications, vol. 35, no. 2, pp. 426-432, 1999   DOI   ScienceOn
2 A. K. Jain, M. N. Murty, and P. J. Flynn, 'Data clustering: A review,' ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, 1999   DOI   ScienceOn
3 M. Bellmore and G. Nemhauser, 'The travelingsalesman problem: A survey,' Operation Research, vol. 16, pp. 538-558, 1968   DOI   ScienceOn
4 T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, 'An efficient k-means clustering algorithm: Analysis and implementation,' IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 24, pp. 881-892, 2002   DOI   ScienceOn
5 Z. Michalewicz, Genetic Algorithms+Data Structures=Evolution Programs, Springer-Verlag, 1996
6 R. Baraglia, J. I. Hidalgo, and R. Perego, 'A hybrid heuristic for the traveling salesman problem,' IEEE Trans. on Evolutionary Computation, vol. 5, no. 6, pp. 613-622, 2001   DOI   ScienceOn
7 G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications, Springer-Verlag, 1994
8 L. Y. Tseng and S. B. Yang, 'A genetic approach to the automatic clustering problem,' Pattern Recognition, vol. 34, pp. 415-424, 2001   DOI   ScienceOn
9 H. S. Kim and S. B. Cho, 'An efficient genetic algorithm with less fitness evaluation by clustering,' IEEE Trans. on Evolutionary Computation, vol. 2, pp. 887-894, 2001
10 Y. Hara, N. Akiyama, and K. Karasaki, 'Automatic inspection system for printed circuit boards,' IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. PAMI-5, no. 6, pp. 623-630, 1983   DOI   ScienceOn
11 E. Dahlhaus, 'Fast parallel algorithm for the single link heuristics of hierarchical clustering,' IEEE Symposium on Parallel and Distributed Processing, vol. 1, no. 4, pp. 184 -187, 1992
12 T. S. Newman and A. K. Jain, 'A survey of automated visual inspection,' Computer Vision and Image Understanding, vol. 61, no. 2, pp. 231-261, 1995   DOI   ScienceOn
13 B. S. Everitt, S. Landau, and M. Leese, Cluster Analysis, Fourth Edition, Arnold, 2001
14 Samsung Techwin Co., LTD, 'SMT Inspection equipment - AI400,' http://www.samsungtechwin.com
15 J. Gu, 'Efficient local search with search space smoothing: A case study of the traveling salesman problem,' IEEE Trans. on Systems, Man and Cybernetics, vol. 24, no. 5, pp. 728-735, 1994   DOI   ScienceOn