复杂轮廓激光切割路径优化算法的研究

Study on optimization algorithm of laser cutting path for complex contours

激光切割的加工路径优化问题实质上是如何缩短激光头在轮廓间移动的空行程距离.复杂轮廓的切割顺序的生成必须考虑轮廓的嵌套问题.本文以轮廓位置关系为约束条件,根据图论原理将加工路径优化问题归结为广义旅行商问题(GTSP).提出了先按照轮廓位置关系构造树形结构,然后以加工起点为基准点按照从内向外的顺序遍历树形结构的优化算法,并给出应用实例.实验统计表明,使用该算法可将激光头空行程距离减少10%以上,明显的提高了激光切割的效率和质量.

Optimization of laser cutting path is the problem how to shorten the invalid journey of laser torch between contours. The nesting problem must be considered in creating a cutting sequence of complex contours. According to the restriction of the relations between contours, optimization of machining path can be formulated as a generalized traveling salesman problem （GTSP） by graph theory. Proposed an optimal algorithmic： first building an arborization according to the ubiety of contours ; then taking the machining starting point as the datum mark and searching all of the nodes on the tree from the inside to the outside. Finally, an instance of application is given. The performance of the algorithm shows that the invalid distance of this algorithmic can be shortened more than 10 percent, the efficiency and quality of laser cutting can be obviously improved.