The Path Planning for multi-probe Coordinate Measuring Machine on the Genetic Algorithm

• Main Authors: Kai-Sheng Chang, 張凱勝
• Other Authors: 李吉群
• Format: Others
• Language: zh-TW
• Published: 2009
• Online Access: http://ndltd.ncl.edu.tw/handle/06744030266004886417

碩士 === 國立中興大學 === 機械工程學系所 === 97 === This research focuses on CMM with planning of route, the CMM with contact-type probe have high precision, and it is convenient for person to write procedure. It also revise examine route that make elastic application even usefully. We solve the Traveling Salesman Problem with a general idea of Genetic Algorithm, and perform of Genetic algorithm. We can extend examine original simple distance matrix for considering multi-probe with the design of new matrix, and show the rule of shorting path. With the development of scientific and technological industry, the parts are more careful and attentive. We usually use coordinate measuring machines to examine to the process parts on industry. This research is divided into two parts, one part is write a form to solve Traveling Salesman Problem by Genetic algorithm, and we use the idea of greedy algorithm to modify the crossover operator. We check the result of algorithm by the case of TSPLIB. The Second part, we plan the measure points with the rule of geometry, and we count the distance between measure points. Then we put the result into the algorithm to find the best route of measuring and path value. Finally we analysis the result and discuss.