Unified Approach to Path Planning Algorithm for SMT Inspection Machines Considering Inspection Delay Time

This paper proposes a path planning algorithm to reduce the inspection time of AOI (Automatic Optical Inspection) machines for SMT (Surface Mount Technology) in-line system. Since the field-of-view of the camera attached at the machine is much less than the entire inspection region of board, the inspection region should be clustered to many groups. The image acquisition time depends on the number of groups, and camera moving time depends on the sequence of visiting the groups. The acquired image is processed while the camera moves to the next position, but it may be delayed if the group includes many components to be inspected. The inspection delay has influence on the overall job time of the machine. In this paper, we newly considers the inspection delay time for path planning of the inspection machine. The unified approach using genetic algorithm is applied to generates the groups and visiting sequence simultaneously. The chromosome, crossover operator, and mutation operator is proposed to develop the genetic algorithm. The experimental results are presented to verify the usefulness of the proposed method.

[1]  Javier Del Ser,et al.  A new grouping genetic algorithm for clustering problems , 2012, Expert Syst. Appl..

[2]  Michael J. Laszlo,et al.  A genetic algorithm that exchanges neighboring centers for k-means clustering , 2007, Pattern Recognit. Lett..

[3]  Cheng-Yan Kao,et al.  Some issues of designing genetic algorithms for traveling salesman problems , 2004, Soft Comput..

[4]  Shoudong Huang,et al.  A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms , 2013, Eur. J. Oper. Res..

[5]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[6]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[7]  Tae-Hyoung Park,et al.  Path planning of automatic optical inspection machines for PCB assembly systems , 2005, 2005 International Symposium on Computational Intelligence in Robotics and Automation.

[8]  Tae-Hyoung Park,et al.  Wavelet transform based image template matching for automatic component inspection , 2010 .

[9]  Jaafar Abouchabaka,et al.  A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem , 2011, ArXiv.

[10]  Prasad K. Yarlagadda,et al.  Design and development of automatic visual inspection system for PCB manufacturing , 2011 .

[11]  Jun Gu,et al.  Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP) , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[12]  Taher Niknam,et al.  An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering , 2011, Eng. Appl. Artif. Intell..

[13]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..