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.
翻译:多机器人探索是一个解决利用多台机器人探索未知环境的挑战的领域。这对于搜索和救援行动尤为重要,时间至关重要。现有的最先进方法能够利用大量机器人来探索给定环境,将它们分配到边界。然而,该分配通常偏向于大边界,因此忽略了中等大小的边界,而这可能是有价值的。在本文中,我们展示了一种新颖的多机器人探索算法,它改进了并适应了现有方法。通过添加基于信息增益的排名,我们提高了城市封闭环境下的探索时间,同时在维持类似于开放环境下的探索性能方面。随着本文的发表,我们进一步发布了研究代码,以降低进一步的多机器人探索研究的准入门槛。我们在三个模拟场景中评估了性能,其中包括两个城市场景和一个开放场景,我们的算法总体上超越现有最先进的算法5%。