최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기제어·로봇·시스템학회 논문지 = Journal of institute of control, robotics and systems, v.21 no.8, 2015년, pp.788 - 793
이철희 (충북대학교 제어로봇공학과) , 박태형 (충북대학교 제어로봇공학과)
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 ins...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
N. S. S. Mar and P. K. D. V. Yarlagadda, "Design and development of automatic visual inspection system for PCB manufacturing," Robotics and Computer-Integrated Manufacturing, vol. 27, no. 5, pp. 949-962, 2011.
H. J. Cho and T. H. Park, "Wavelet transform based image template matching for automatic component inspection," The International Journal of Advanced Manufacturing Technology, vol. 50, no. 17, pp. 1033-1039, 2010.
J. S. Lee and T. H. Park, "Identification of component packaging region for electronic Assembly system," Institute of Control, Robotics and Systems, vol. 2013, no. 5, pp. 562-563, 2013.
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.
T. Niknam, E. T. Fard, N. Pourjafarian, and A. Rousta, "An Efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering," Engineering Applications of Artificial Intelligence, vol. 24, no 2, pp. 306-317, 2011.
U. Maulik, "Genetic algorithm-based clustering technique," Pattern Recognition, vol. 33, no. 5, pp. 1455-1465, 2000.
J. Gu, "Efficient local search with search space smoothing: a case study of the traveling salesman problem (TSP)," Man and Cybernetics, vol. 24, no. 5, pp. 728-735, 1994.
M. Bellmore and G. Nemhauser, "The traveling-salesman problem: a survey," Operation Research, vol. 16, no. 6 pp. 538-558, 1968.
A. Otman and A. Jaafar, "A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem," International Journal of Computer Applications, vol. 31, no. 11, pp. 49-57, 2011.
H. J. Lin, F. W. Yang, and Y. T. Kao, "An efficient GA-based clustering technique," Tamkang Journal of Science and Engineering, vol. 8, no. 2, pp. 113-122, 2005.
M. Laszlo and S. Mukherjee, "A genetic algorithm that exchanges neighboring centers for k-means clustering," Pattern Recognition, vol. 28, no. 16, pp. 2359-2366, 2007.
L. E. Agustin-Blas and S. Salcedo-Sanz, "A new grouping genetic algorithm for clustering problems," Expert Systems with Applications, vol. 39, no. 120, pp. 9695-9703, 2012.
H. K. Tsai and J. M. Yang, "Some issues of designing genetic algorithms for traveling salesman problems," Soft Computing, vol. 8, no. 8, pp. 689-697, 2003.
S. Yuan and B. Skinner, "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, vol. 228, no. 7, pp. 72-82, 2013.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.