Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired Robots

摘要

In this paper, we develop a decentralized algorithm to coord inate a group of mobile robots to search for unknown and transient radio sources. In addition to limited mobility and ranges of communication and sensing, the robot team has to deal with challenges from signal source anonymity, short transmission duration, and variable transmission power. We propose a two-step approach: First, we decentralize belief functions that robots use to track source locations using checkpoint-based synchronization, and second, we propose a decentralized planning strategy to coordinate robots to ensure the existence of checkpoints. We analyze memory usage, data amount in communication, and searching time for the proposed algorithm. We have implemented the proposed algorithm and compared it with two heuristics. The experimental results show that our algorithm successfully trades a modest amount of memory for the fastest searching time among the three methods.