Collision-Free Multi-Agent Coverage Control for Non-Cooperating Swarms: Preliminary Results

The main contribution of this paper is a methodology for multiple non-cooperating swarms of unmanned aerial vehicles to independently cover a common area. In contrast to previous research on coverage control involving more than one swarm, this paper does not assume cooperation between distinct swarms but considers them as independent units following their own objectives. Using Voronoi tessellation, collision-free motion of agents within the same swarm has been proven before. However, as is shown in Example 1 of this paper, in the case of multiple swarms with inter-swarm but without intra-swarm collaboration, these guarantees do not hold. We address this issue by proposing an algorithm to achieve maximum coverage with multiple swarms while avoiding collisions between agents. More specifically, the Optimal Reciprocal Collision Avoidance method used for safe navigation in multi-agent scenarios is adapted to suit the needs of Voronoi-based coverage control with more than one swarm. The functionality of the proposed technique is validated through Monte Carlo simulations.

Authors

Institutions

Publication Details

Published
2025-06-24
DOI
https://doi.org/10.23919/ecc65951.2025.11187264
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Collision-Free Multi-Agent Coverage Control for Non-Cooperating Swarms: Preliminary Results

Luís Rodrigues, Kerstin Schmidt
Distributed Control Multi-Agent Systems
article

Collision-Free Multi-Agent Coverage Control for Non-Cooperating Swarms: Preliminary Results

Luís Rodrigues, Kerstin Schmidt
article en

Abstract

The main contribution of this paper is a methodology for multiple non-cooperating swarms of unmanned aerial vehicles to independently cover a common area. In contrast to previous research on coverage control involving more than one swarm, this paper does not assume cooperation between distinct swarms but considers them as independent units following their own objectives. Using Voronoi tessellation, collision-free motion of agents within the same swarm has been proven before. However, as is shown in Example 1 of this paper, in the case of multiple swarms with inter-swarm but without intra-swarm collaboration, these guarantees do not hold. We address this issue by proposing an algorithm to achieve maximum coverage with multiple swarms while avoiding collisions between agents. More specifically, the Optimal Reciprocal Collision Avoidance method used for safe navigation in multi-agent scenarios is adapted to suit the needs of Voronoi-based coverage control with more than one swarm. The functionality of the proposed technique is validated through Monte Carlo simulations.

Concordia University (CA)
Openalex Percentile: Top 66%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Collision-Free Multi-Agent Coverage Control for Non-Cooperating Swarms: Preliminary Results — Luís Rodrigues, Kerstin Schmidt · (2025) | TGRS Research Map | TGRS