Multi-robot exploration is a field which tackles the challenge of exploring a previously unknown environment with a number of robots. This is especially relevant for search and rescue operations where time is essential. Current state of the art approaches are able to explore a given environment with a large number of robots by assigning them to frontiers. However, this assignment generally favors large frontiers and hence omits potentially valuable medium-sized frontiers. In this paper we showcase a novel multi-robot exploration algorithm, which improves and adapts the existing approaches. Through the addition of information gain based ranking we improve the exploration time for closed urban environments while maintaining similar exploration performance compared to the state-of-the-art for open environments. Accompanying this paper, we further publish our research code in order to lower the barrier to entry for further multi-robot exploration research. We evaluate the performance in three simulated scenarios, two urban and one open scenario, where our algorithm outperforms the state of the art by 5\% overall.
翻译:多机器人探索是一个领域,涉及利用多个机器人探索先前未知的环境。这在搜救行动中尤为重要,因为时间至关重要。目前最先进的方法可以通过将机器人分配到frontiers来使用大量机器人探索给定环境。但是,该分配通常偏向于大型frontiers,并因此忽略了可能有价值的中等大小的frontiers。本文展示了一种新颖的多机器人探索算法,该算法改进和调整了现有方法。通过增加基于信息增益的排名,我们在维持类似于开放环境的探索性能的同时,改进了封闭城市环境的探索时间。随着本文的发表,我们进一步发布了我们的研究代码,以降低进一步多机器人探索研究的障碍。我们在三个模拟场景中评估了性能,其中包括两个城市场景和一个开放场景,我们的算法总体上优于现有技术5%以上。