English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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

Multi-robot Symmetric Rendezvous Search on the Line with an Unknown Initial Distance