Rapid Coverage Control with Multi-agent Systems Based on K-Means Algorithm

摘要

This paper presents a strategy for covering particles in a specific region with multi-agent systems. Previous strategies that study on partitioning regions, have struggled to cover complex regions. The proposed approach in this paper, based on k-Means algorithm, can partition particles in some complex regions and calculate the locations of agents which have limited range of detection. And then the agents can cooperate to monitor the whole particles. Simulation results show that the particles in different regions can be covered well by multi-agent systems based on k-Means algorithm.