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

This paper revisits the widely researched \textit{gathering} problem for tworobots in a scenario which allows randomization in the asynchronous schedulingmodel. The scheduler is considered to be the adversary which determines theactivation schedule of the robots. The adversary comes in two flavors, namely,oblivious and adaptive, based on the knowledge of the outcome of random bits.The robots follow \textit{wait-look-compute-move} cycle.  In this paper, we classify the problems based on the capability of theadversary to control the parameters such as wait time, computation delay andthe speed of robots and check the feasibility of gathering in terms ofadversarial knowledge and capabilities. The main contributions include thepossibility of gathering for an oblivious adversary with (i) zero computationdelay; (ii) the sum of wait time and computation delay is more than a positivevalue. We complement the possibilities with an impossibility.  We show that it is impossible for the robots to gather against an adaptiveadversary with non-negative wait time and non-negative computation delay.Finally, we also extend our algorithm for multiple robots with merging.

Randomized Gathering of Asynchronous Mobile Robots