基于平面不封闭图形切割的路径规划

在平面切割环节中,如何确定更短切割路径以减少加工成本、降低设备损耗和提升切割质量是工业应用和学术研究的重点。目前国内外对平面切割路径的研究主要集中于封闭图形,为此,针对在激光刀模行业中不封闭图形的问题,提出一种基于禁忌搜索的贪婪算法和贪婪准则的局部优化。首先使用构建型的贪婪算法和改进型的禁忌搜索算法相结合的方式对加工过程中的图元路径进行优化排序,随后提出贪婪准则的局部优化系数,削弱贪婪算法的“贪心”思想,解决加工路径的规划和优化问题。实验数据表明,禁忌搜索的贪婪算法和局部优化在对切割路径的规划和空行程优化上有显著效果,空行程减少50%以上,并且其优化性能和图元数量成正比,能有效地解决刀模行业以及其他激光雕刻行业中图形不封闭的切割难题。

Path Planning Based on Plane Unclosed Graphic Cutting

In the plane cutting process, how to confirm shorter cutting paths to reduce processing costs, reduce equipment wear and improve cutting quality is the focus of industrial applications and academic research.At present, the research on planar cutting path at home and abroad mainly focuses on closed graphics. For this reason, a greedy algorithm based on tabu search and   local   optimization of greedy criteria is proposed for the problem of unclosed graphics in the laser die-cutting industry. Firstly, the constructed greedy algorithm and the improved tabu search algorithm are combined to optimize the order of the primitives in the process, and then the local optimization coefficients of the greedy criterion are proposed to weaken the greedy algorithms “  greedy  ” idea to solve planning and optimization of processing paths. The experimental data show that the greedy algorithm and local optimization of tabu search have significant effects on the planning of the cutting path and the optimization of the idle path. The idle stroke is reduced by more than 50%, and its optimization performance is proportional to the number of primitives, which can   effectively   solve the cutting problem of unclosed primitives in the knife mold industry and other laser engraving industries.