A Study of Optimal Path Coverage Algorithms for Unmanned Systems for Industrial Inspection

In this paper, a coverage path planning algorithm is proposed for unmanned industrial inspection systems. The algorithm is designed to solve the problem of achieving time-optimal path coverage in complex polygonal regions, regardless of whether the region is convex or concave or contains obstacles. The algorithm is designed to ensure that the unmanned system can complete the inspection tasks autonomously and effectively through efficient path planning, so as to improve the efficiency and accuracy of industrial inspection. By optimizing the path coverage strategy, the algorithm is expected to provide strong support for the practical application of unmanned industrial inspection systems.