A Novel Nash-Based Matching Approach for Multirobot Task Allocation in Distributed Robotic Networks

Efficiency is paramount in distributed robotic networks, where multiple autonomous robots collaborate to perform complex tasks. In this context, the identification of the most efficient path for robots, considering both distance and cost, plays a crucial role in the development of an effective matching algorithm for addressing multirobot task allocation (MRTA) challenges. This study presents a novel cooperative Nash game framework that serves as a distributed matching method for addressing the task allocation problem in a distributed robotic network consisting of robots and tasks. A particular MRTA problem is investigated where each robot moves at a constant speed determined by maximizing energy harvesting while minimizing energy consumption during the motion. In this framework, Nash equilibrium is established as a near-optimal approach for matching based on distance. In the numerical experiments, the performances are assessed for various scenarios involving 10 robots and 20 robots with the same number of tasks. Here, the Hungarian algorithm is used as an optimal benchmark algorithm to demonstrate the reliability of the theoretical findings and the robustness of the proposed model.