Distributed Rotary Coverage Control of Multi-Agent Systems in Uncertain Environments
Chao Zhai, Yanlin Li

TL;DR
This paper introduces a beacon-free rotary pointer partition mechanism for multi-agent coverage control in uncertain environments, achieving efficient, balanced, and robust coverage without relying on global positioning.
Contribution
It presents a novel distributed coverage control algorithm based on a rotary partition mechanism that ensures asymptotic consensus and workload balance among agents.
Findings
Significantly improves coverage efficiency in uncertain environments
Ensures workload balance among multiple agents
Demonstrates robustness and adaptability through simulations
Abstract
It is always a challenging task for multi-agent systems to achieve efficient and robust coverage in uncertain environments. The absence of global positioning information on the uncertain environment introduces significant complexity to the spatially distributed design of coverage control algorithms. To address this issue, this paper proposes a coverage control formulation based on beacon-free rotary pointer partition mechanism. A partition dynamics is designed to enable the asymptotical consensus of multi-agent reference points, as well as the workload-balanced subdivision of coverage region. On this basis, a distributed coverage control algorithm is developed to drive each agent toward the optimal deployment of their respective subregions, thereby minimizing the coverage cost. Simulation results demonstrate that the proposed coverage control method can significantly improve overall…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Multi-Agent Systems and Negotiation · Robotic Path Planning Algorithms
