Multi-Agent Coverage Control with High-order Voronoi Partitions in Non-convex Environments

At present, most research on the coverage of multi-agent systems is based on Euclidean distance. This does not consider the existence of obstacles and has great limitations in the application. In this paper, a kind of coverage control problem based on high-order geodesic Voronoi partition is practically investigated. It allows multiple agents to monitor an area with obstacles to achieve the monitoring of the overall environment. As a result, the geodesic distance is introduced as a metric form. Based on the geodesic distance, point-by-point scanning on the layer is taken to achieve high-order Voronoi diagram division. The coverage algorithm can be implemented in a distributed manner through the exchange of location information with each other, and the Lloyd algorithm is added to realize the movement of the sensor toward the optimal position.