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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we have considered two fully synchronous $\mathcal{OBLOT}$robots having no agreement on coordinates entering a finite unoriented gridthrough a door vertex at a corner, one by one. There is a resource that canmove around the grid synchronously with the robots until it gets co-locatedalong with at least one robot. Assuming the robots can see and identify theresource, we consider the problem where the robots must meet at the location ofthis dynamic resource within finite rounds. We name this problem "Rendezvous ona Known Dynamic Point".  Here, we have provided an algorithm for the two robots to gather at thelocation of the dynamic resource. We have also provided a lower bound on timefor this problem and showed that with certain assumption on the waiting time ofthe resource on a single vertex, the algorithm provided is time optimal. Wehave also shown that it is impossible to solve this problem if the schedulerconsidered is semi-synchronous.

Rendezvous on a Known Dynamic Point on a Finite Unoriented Grid