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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We initiate the study of a new problem on searching and fetching in adistributed environment concerning treasure-evacuation from a unit disk. Atreasure and an exit are located at unknown positions on the perimeter of adisk and at known arc distance. A team of two robots start from the center ofthe disk, and their goal is to fetch the treasure to the exit. At any time therobots can move anywhere they choose on the disk, independently of each other,with the same speed. A robot detects an interesting point (treasure or exit)only if it passes over the exact location of that point. We are interested indesigning distributed algorithms that minimize the worst-casetreasure-evacuation time, i.e. the time it takes for the treasure to bediscovered and brought (fetched) to the exit by any of the robots.  The communication protocol between the robots is either wireless, whereinformation is shared at any time, or face-to-face (i.e. non-wireless), whereinformation can be shared only if the robots meet. For both models we obtainupper bounds for fetching the treasure to the exit. Our main technicalcontribution pertains to the face-to-face model. More specifically, wedemonstrate how robots can exchange information without meeting, effectivelyachieving a highly efficient treasure-evacuation protocol which is minimallyaffected by the lack of distant communication. Finally, we complement ourpositive results above by providing a lower bound in the face-to-face model.

Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models