We study the Symmetric Rendezvous Search Problem for a multi-robot system. There are $n>2$ robots arbitrarily located on a line. Their goal is to meet somewhere on the line as quickly as possible. The robots do not know the initial location of any of the other robots or their own positions on the line. The symmetric version of the problem requires the robots to execute the same search strategy to achieve rendezvous. Therefore, we solve the problem in an online fashion with a randomized strategy. In this paper, we present a symmetric rendezvous algorithm which achieves a constant competitive ratio for the total distance traveled by the robots. We validate our theoretical results through simulations.

翻译：我们研究一个多机器人系统的对称共和搜索问题。 在一条线上任意放置了$>2$的机器人。 他们的目标是尽快在线上某个地方相遇。 机器人不知道其他机器人的初始位置或他们自己在线上的位置。 问题的对称版本要求机器人执行相同的搜索策略才能达到会合。 因此, 我们用随机策略以在线方式解决问题。 在本文中, 我们提出了一个对称会合算法, 该算法可以实现机器人总距离的恒定竞争比率。 我们通过模拟验证我们的理论结果 。