This paper deals with the Multi-robot Exploration (MRE) under communication constraints problem. We propose a novel intermittent rendezvous method that allows robots to explore an unknown environment while sharing maps at rendezvous locations through agreements. In our method, robots update the agreements to spread the rendezvous locations during the exploration and prioritize exploring unknown areas near them. To generate the agreements automatically, we reduced the MRE to instances of the Job Shop Scheduling Problem (JSSP) and ensured intermittent communication through a temporal connectivity graph. We evaluate our method in simulation in various virtual urban environments and a Gazebo simulation using the Robot Operating System (ROS). Our results suggest that our method can be better than using relays or maintaining intermittent communication with a base station since we can explore faster without additional hardware to create a relay network.

翻译：本文研究了通信受限条件下的多机器人探索问题。我们提出了一种新颖的间歇性会合方法，使机器人能够在未知环境中进行探索，同时通过协议在会合地点共享地图。在我们的方法中，机器人更新协议以在探索过程中扩散会合地点，并优先探索这些地点附近的未知区域。为了实现协议自动生成，我们将多机器人探索问题简化为作业车间调度问题的实例，并通过时间连通性图确保间歇性通信。我们在多种虚拟城市环境中以及使用机器人操作系统（ROS）的Gazebo仿真中评估了该方法。结果表明，相比使用中继或与基站保持间歇性通信，我们的方法能在无需额外硬件构建中继网络的情况下实现更快的探索速度。