基于零件形心的数控火焰切割路径的规划  

The road planing for NC flame cutting based on centroid of parts

作　　者：朱灯林[1] 陈俊伟[1] 俞洁[1] 董世昌[1] 

机构地区：[1]河海大学(常州校区)机电工程学院,常州213022

出　　处：《机械设计与制造》2006年第9期88-90,共3页Machinery Design & Manufacture

摘　　要：研究了数控火焰切割中多边形零件切割路径规划、打孔点的位置选择、带有内轮廓的零件打孔点位置选择和内轮廓的切割路径规划等关键问题,提出了一种基于零件外轮廓多边形形心的规划算法。首先根据零件外轮廓多边形计算零件的形心,然后把各个零件的形心作为TSP问题中的城市,采用蚁群算法对零件的切割路径进行分析。在此基础上,应用改进的局部优化算法研究了多边形零件切割打孔点的位置和内外轮廓的切割路径规划。In this paper, the key problems in NC flame cutting, including cutting road planning of torch path, decision of the pierce points with no inner contours, the planning of the pierce points with inner co.ours and the cutting road of these inner contours, are studied. A planning technique of the cutting road based on polygon centroids of outer contour of parts is presented. Firstly, the centroids of outer contours of perts are calculated. Secondly, the cutting planning is carried out using ant colony algorithms by regarding the centroids of parts as cities in TSP（ Traveling Salesman Problem） . Based above, decision of the pierce points with no inner contours, the planning of the pierce points with inner contours and the cutting road of these, inner contours are investigated using a modified local optimal methods.

关 键 词：切割路径规划 零件形心 蚁群算法 局部优化技术 

分 类 号：TG43[金属学及工艺—焊接]