平面切割路径规划与优化研究

发布时间：2018-09-05 10:03

【摘要】：平面切割在制造业的材料加工中占有很大的比重,随着人口红利的消退、制造业生产成本在逐年上升,倒逼一些传统制造业考虑将其落后的生产工艺往智能化生产方向改造。作为板材加工中涉及的平面切割环节,如何自主地对已经确定的切割部件规划出一条更短的切割路径,从而降低生产加工时间,减少设备损耗,提升切割加工质量等问题,此即平面切割路径规划与优化问题,已然成了工业界以及学术界研究的热点。本论文在总结前人工作的基础上,根据平面切割图文件的特点,提出了平面切割图切割路径规划与优化的一些改进算法和方案。本文的工作主要由以下几部分组成:1)在平面切割图数据初始化处理方面:基于DXF文件的特殊格式,提出了平面切割图读取与存储的接口函数与数据结构;基于存储的基本图元数据,提出了封闭环的识别与存储算法;并提出一种适用于单批次多切割图纸的自动切割路径规划算法框架。2)在平面切割路径规划与优化方面:基于切割部件的几何特征,构建了切割路径的数学模型;然后提出将此种平面切割路径转化为动态旅行商问题模型;提出采用禁忌贪婪算法对切割路径空行程进行优化,并研究了贪婪准则权重系数对空行程优化的影响;并利用禁忌贪婪算法分别在不同模型下对同一组平面切割图的切割路径求解。3)在包含多重嵌套封闭环的平面切割路径建模与优化方面:提出了封闭环嵌套识别算法;构建四向链表对包含多重嵌套封闭环的平面切割图进行建模;最后提出采用逐层多次调用禁忌贪婪算法(n-GR-DTSP)对此种平面切割路径进行求解,并给出仿真案例进行分析说明。4)在某些平面切割中出于对切割部件的保护,而提出的需要添加切割引导线方面:提出了板材语义信息判断算法;提出了切割引导线自动添加、干涉判断、自动调整算法。
[Abstract]:Plane cutting occupies a large proportion in the material processing of manufacturing industry. With the decline of population dividend, the production cost of manufacturing industry is rising year by year, forcing some traditional manufacturing industries to consider transforming their backward production technology to the direction of intelligent production. As a plane-cutting link involved in sheet metal processing, how to plan a shorter cutting path for certain cutting parts independently, so as to reduce production processing time, reduce equipment loss, and improve cutting quality, etc. The problem of plane cutting path planning and optimization has become a hot topic in industry and academia. On the basis of summing up the previous work and according to the characteristics of plane cutting graph file, this paper puts forward some improved algorithms and schemes for cutting path planning and optimization of plane cutting graph. The main work of this paper is composed of the following parts: (1) in the aspect of data initialization of plane cutting graph: based on the special format of DXF file, the interface function and data structure of reading and storing plane cutting graph are put forward; Based on the stored basic graph metadata, the recognition and storage algorithm of closed loop is proposed. An algorithm framework of automatic cutting path planning for single batch and multiple cutting drawings is proposed. In the aspect of plane cutting path planning and optimization, a mathematical model of cutting path is built based on the geometric characteristics of cutting parts. Then, this paper puts forward a dynamic traveling salesman problem model, proposes a Tabu greedy algorithm to optimize the path empty travel, and studies the influence of the weight coefficient of greedy criterion on the empty travel optimization. And using Tabu greedy algorithm to solve the cutting path of the same set of plane cutting graph under different models respectively. 3) in the aspect of modeling and optimization of the plane cutting path including multiple nested closed rings, a closed ring nested recognition algorithm is proposed. A four-direction list is constructed to model the planar cutting graph which contains multiple nested closed rings. Finally, a layer by layer multiple invocations Tabu greedy algorithm (n-GR-DTSP) is proposed to solve the planar cutting path. A simulation case is given to illustrate how to protect the cutting parts in some plane cutting, but the need to add the cutting guide line is put forward: the algorithm for judging the semantic information of the plate, the automatic adding of the cutting guide line are put forward. Interference judgment, automatic adjustment algorithm.
【学位授予单位】：广东工业大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TG48

【参考文献】