基于DXF文件的数字模切路径优化算法研究  

Research on Digital Die-Cutting Path Optimization Algorithm Based on DXF File

作　　者：陈林林[1,2] 董竞哲 徐晓 徐宏伟 CHEN Lin-in;DONG Jing-zhe;XU Xiao;XU Hong-wei(School of Mechanical Engineering,Zhengzhou University of Science and Technology,Zhengzhou 450064,China;Faculty of Printing,Packaging Engineering and Digital Media Technology,Xi’an University of Technology,Xi’an 710048,China)

机构地区：[1]郑州科技学院机械工程学院,郑州450064 [2]西安理工大学印刷包装与数字媒体学院,西安710048

出　　处：《印刷与数字媒体技术研究》2024年第4期245-252,共8页Printing and Digital Media Technology Study

摘　　要：针对数字模切直接提取刀线文件数据时图元模切顺序的无序性,即直接按刀线文件所给出的图元路径规划的先后次序进行路径模切,则会出现空刀路径太长的问题,本研究提出了一种基于遗传算法的改进型路径规划方法。首先分析了刀线文件数据特点,将各图元模切起始点分解为由图元序号和各图元内初始模切点对应的锚点序号组成的染色体,将染色体分割为头部和尾部分别进行变换处理。其中针对图元序号的唯一性特点进行遗传和交叉变换,针对初始模切点对应的锚点序号不能大于该图元中锚点的个数这一特点进行遗传和变异的变换。为了提高效率,避免局部优化,该算法是首先通过一维优化的方法对图元顺序进行了优化,以图元顺序优化结果作为初始染色体序列,然后利用遗传算法进行了再次优化。通过实例计算将该算法和刀线模切的直接路径规划算法进行计算对比,结果表明经该算法优化后的模切路径中空刀程路径长度远小于直接路径规划中的空刀程路径长度,节约运行时间,数字模切效率得到了较大的提高。When directly extracting tool line data from digital die-cutting,there will be resulting in the problem of empty tool paths being too long.In this study,an improved path planning method based on genetic algorithm was proposed to address the disorder in the order of die-cutting.Firstly,the characteristics of the knife line file data were analyzed,and the starting points of each element’s die-cutting were decomposed into chromosomes composed of element numbers and initial die-cutting point numbers within each element.The chromosomes were divided into head and tail for separate transformation processing.Among them,genetic and crossover transformations were carried out to address the uniqueness of the element number,while genetic and mutation transformations were carried out to address the fact that the initial die-cutting point whose number cannot be greater than the total number of die-cutting points in the element.In order to improved efficiency and avoided local optimization,this algorithm first optimized the order of primitives through a one-dimensional optimization method,the result of the optimization was used as the initial chromosome sequence,and then the genetic algorithm was used for further optimization.By comparing this algorithm with the direct path planning algorithm for tool line die-cutting through example calculation,the results showed that the optimized empty path length of the die-cutting path is much smaller than the empty path length in direct path planning.It means that this algorithm save running time,and greatly improve the efficiency of digital die-cutting.

关 键 词：数字模切 路径规划 遗传算法优化 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程] TP391.7[自动化与计算机技术—控制科学与工程]