This paper aims to improve the processing efficiency of lattice structural components additive manufacturing. After the lattice structure is layered and sliced

each layer will generate a large number of polygons to be filled. By abstracting these polygons into discrete points

solving the traveling salesman problem at the slice level

carrying out the planning of the connection path

a highly efficient dot matrix model filling path is obtained. The algorithm takes into account the calculation efficiency of the traveling salesman problem and the total length of the calculation of the connection path: the ant colony algorithm is used to obtain a cross-connected trajectory. The calculation of the connection plan of 2000 points takes less than 3.5s and the total path length only increases by 0.2% compared to the international advanced algorithm. When some abstract points are too far apart

the abstract point set is divided into subsets by distance clustering

and then the path planning is performed separately. Simulation and experimental verification results show that this method can obtain an efficient non-cross-connection path

effectively reducing the total length of the connection path and the processing time: the total printing time is reduced by 17.52% and the total connection length is reduced by 17.38%

meeting the actual additive manufacturing needs.