包含多重嵌套轮廓线的激光切割空移路径规划

Air Moves Planning for Laser Cutting Containing Multi-layered Contour Lines

包含多重嵌套轮廓线的空移路径规划是开发激光切割系统的主要问题之一,在满足嵌套图形由内到外的激光切割工艺要求下,提出启发式排序和网格排序算法,实现优化排序。首先通过射线法,判断多重嵌套轮廓线的位置关系;然后采用最佳适应度优先的启发式排序算法,将空移距离、轮廓线的面积作为评价指标,分别赋值权重得到总体适应度,选择适应度高的轮廓线作为下一个切割图形;最后,为了满足不同应用场景,提出另外一种网格排序方法,根据轮廓线控制点的疏密程度,基于层次聚类算法划分网格,按照规则的路线遍历网格,依次确定定位到每个网格中的轮廓线。仿真与试验结果表明,相比于智能优化排序算法,启发式排序和网格排序在满足激光切割工艺要求的前提下,不仅可以有效缩短空移路径,还大大减少了计算时间,显著提高激光切割效率和质量。

One of the main problems in the development of laser cutting system was the air moves planning containing multi-layered contour lines. In order to meet the requirements of laser cutting process from inside to outside, heuristic sorting and grid sorting algorithms were proposed to achieve optimal sorting. Firstly, the position relationship of multiple nested contours was judged by ray method. Secondly, the best fitness first heuristic sorting algorithm was used. The empty distance and contour area were used as evaluation indexes, and the weight was assigned respectively to get the overall fitness. The contour with high fitness was selected as the next cutting figure. Finally, in order to meet different application scenarios, another grid sorting method was proposed. According to the density of contour control points, the grid was divided based on hierarchical clustering algorithm, and the grid was traversed according to the regular route to get the contour lines in each grid in turn. Simulation and experimental results showed that, compared with the intelligent optimization sorting algorithm, heuristic sorting and grid sorting could not only effectively shorten the air moves, but also greatly reduce the calculation time, and significantly improve the efficiency and quality of laser cutting.