  In this paper, we study the symmetric rendezvous search problem on the line
with n > 2 robots that are unaware of their locations and the initial distances
between them. In the symmetric version of this problem, the robots execute the
same strategy. The multi-robot symmetric rendezvous algorithm, MSR presented in
this paper is an extension our symmetric rendezvous algorithm, SR presented in
[23]. We study both the synchronous and asynchronous cases of the problem. The
asynchronous version of MSR algorithm is called MASR algorithm. We consider
that robots start executing MASR at different times. We perform the theoretical
analysis of MSR and MASR, and show that their competitive ratios are
$O(n^{0.67})$ and $O(n^{1.5})$, respectively. Finally, we confirm our
theoretical results through simulations.
