D-MRFTE: A Decentralized Relay-Based Approach for Multi-Robot Unknown Area Exploration

摘要

In this paper, a decentralized relay-based approach (D-MRFTE) for unknown area exploration using a team of autonomous mobile robots is proposed under communication constraints. Using the relay robots, the multi-robot system forms a high-latency decentralized network with distributed copies of exploration information for which eventual consistency and completeness are ensured through meetups. The meetups act as a safety net and set a bound on latency by ensuring data transfer at periodic intervals whenever the multi-robot network gets fragmented. The information exchange related to the robot’s state and the ongoing exploration is facilitated by the relay robots. The robots use timestamps to assimilate the latest available information by using version vectors. To achieve a consistent state of explorer robots, the relays schedule meetups with other relays they come in contact with, creating a tightly-knit group. Our approach, under two communication models, i.e., Disk-based and Line-of-Sight-based, exhibits superior performance compared with two state-of-the-art algorithms in terms of completion time and distance traveled by the robot team. The simulations are conducted in a Player/Stage simulator with different robot team sizes.