Synchronous Rendezvous for Location-Aware Agents - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Synchronous Rendezvous for Location-Aware Agents

Abstract

We study rendezvous of two anonymous agents, where each agent knows its own initial position in the environment. Their task is to meet each other as quickly as possible. The time of the rendezvous is measured by the number of synchronous rounds that agents need to use in the worst case in order to meet. In each round, an agent may make a simple move or it may stay motionless. We consider two types of environments, finite or infinite graphs and Euclidean spaces. A simple move traverses a single edge (in a graph) or at most a unit distance (in Euclidean space). The rendezvous consists in visiting by both agents the same point of the environment simultaneously (in the same round). In this paper, we propose several asymptotically optimal rendezvous algorithms. In particular, we show that in the line and trees as well as in multi-dimensional Euclidean spaces and grids the agents can rendezvous in time O(d), where d is the distance between the initial positions of the agents. The problem of location-aware rendezvous was studied before in the asynchronous model for Euclidean spaces and multi-dimensional grids, where the emphasis was on the length of the adopted rendezvous trajectory. We point out that, contrary to the asynchronous case, where the cost of rendezvous is dominated by the size of potentially large neighborhoods, the agents are able to meet in all graphs of at most n nodes in time almost linear in d, namely, O(d log^2 n). We also determine an infinite family of graphs in which synchronized rendezvous takes time Ω(d).

Dates and versions

hal-00646907 , version 1 (01-12-2011)

Identifiers

Cite

Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Martin A. Russell. Synchronous Rendezvous for Location-Aware Agents. DISC 2011 - 25th International Symposium on Distributed Computing, Sep 2011, Rome, Italy. pp.447-459, ⟨10.1007/978-3-642-24100-0_42⟩. ⟨hal-00646907⟩
182 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More