A Gossip-Based Approach for Measurement Task Allocation and Routing in Multi-Robot Systems with Heterogeneous Sensing

This paper presents a decentralized task allocation strategy for heterogeneous multi-robot systems to minimize makespan during mission execution. The approach leverages a Gossip-based consensus mechanism, where robots communicate and exchange task information to optimize task distribution. The problem is modelled as a Multi-Robot Task Allocation (MRTA) challenge with the objective of minimizing task completion time (makespan). The proposed heuristic algorithm operates by iteratively improving task sequences via local exchanges between robots. Simulations demonstrate the algorithm’s effectiveness in assigning tasks while considering various robot capabilities and environmental constraints, resulting in improved mission performance and reduced overall task completion time.

Authors

Institutions

Publication Details

Published
2025-08-17
DOI
https://doi.org/10.1109/case58245.2025.11164022
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

A Gossip-Based Approach for Measurement Task Allocation and Routing in Multi-Robot Systems with Heterogeneous Sensing

Dimitri Lefebvre, Carla Seatzu, Diego Deplano, Mauro Franceschelli et al.
Distributed Control Multi-Agent Systems
article

A Gossip-Based Approach for Measurement Task Allocation and Routing in Multi-Robot Systems with Heterogeneous Sensing

Dimitri Lefebvre, Carla Seatzu, Diego Deplano, Mauro Franceschelli, Hamza Chakraa
article en

Abstract

This paper presents a decentralized task allocation strategy for heterogeneous multi-robot systems to minimize makespan during mission execution. The approach leverages a Gossip-based consensus mechanism, where robots communicate and exchange task information to optimize task distribution. The problem is modelled as a Multi-Robot Task Allocation (MRTA) challenge with the objective of minimizing task completion time (makespan). The proposed heuristic algorithm operates by iteratively improving task sequences via local exchanges between robots. Simulations demonstrate the algorithm’s effectiveness in assigning tasks while considering various robot capabilities and environmental constraints, resulting in improved mission performance and reduced overall task completion time.

Université Le Havre Normandie (FR), University of Cagliari (IT), Normandie Université (FR)
Openalex Percentile: Top 70%
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.