Consensus-based Fast and Energy-Efficient Multi-Robot Task Allocation

TL;DR

This paper introduces a novel decentralized multi-robot task allocation algorithm leveraging synchronous-transmission wireless communication to improve energy efficiency and reduce latency in dynamic, infrastructure-less environments.

Contribution

It is the first to utilize synchronous-transmission protocols for multi-robot task allocation, enhancing communication efficiency in ad hoc networks.

Findings

The proposed algorithm reduces communication energy consumption.

It achieves faster consensus in task allocation.

Simulation results show improved latency and energy efficiency.

Abstract

In a multi-robot system, the appropriate allocation of the tasks to the individual robots is a very significant component. The availability of a centralized infrastructure can guarantee an optimal allocation of the tasks. However, in many important scenarios such as search and rescue, exploration, disaster-management, war-field, etc., on-the-fly allocation of the dynamic tasks to the robots in a decentralized fashion is the only possible option. Efficient communication among the robots plays a crucial role in any such decentralized setting. Existing works on distributed Multi-Robot Task Allocation (MRTA) either assume that the network is available or a naive communication paradigm is used. On the contrary, in most of these scenarios, the network infrastructure is either unstable or unavailable and ad-hoc networking is the only resort. Recent developments in synchronous-transmission (ST) based wireless communication protocols are shown to be more efficient than the traditional asynchronous transmission-based protocols in ad hoc networks such as Wireless Sensor Network (WSN)/Internet of Things (IoT) applications. The current work is the first effort that utilizes ST for MRTA. Specifically, we propose an algorithm that efficiently adapts ST-based many-to-many interaction and minimizes the information exchange to reach a consensus for task allocation. We showcase the efficacy of the proposed algorithm through an extensive simulation-based study of its latency and energy-efficiency under different settings.