Two or more mobile entities, called agents or robots, starting at distinct initial positions, have
to meet. This task is known in the literature as rendezvous. Among many alternative …

The gathering (or multi-agent rendezvous) problem requires a set of mobile agents,
arbitrarily positioned at different nodes of a network to group within finite time at the same …

LNCS 4056 - Mobile Agent Rendezvous: A Survey Page 1 Mobile Agent Rendezvous: A Survey
Evangelos Kranakis1, Danny Krizanc2, and Sergio Rajsbaum3 1 School of Computer Science …

In this paper, we consider the uniform deployment problem of mobile agents in
asynchronous unidirectional rings, which requires the agents to uniformly spread in the ring …

A group of identical mobile agents moving asynchronously among the nodes of an
anonymous network have to gather together in a single node of the graph. This problem …

At the core of distributed computing there is the necessity to coordinate a group of entities in
face of the uncertainty present in the environment. Classically, such uncertainty was mainly …

We consider the problem of Rendezvous or gathering of multiple autonomous entities
(called mobile agents) moving in an unlabelled environment (modelled as a graph). The …

We present a tradeoff between the expected time for two identical agents to rendez-vous on
a synchronous, anonymous, oriented ring and the memory requirements of the agents. In …

Rendezvous with detection differs from the usual rendezvous problem in that two mobile
agents not only accomplish rendezvous whenever this is possible, but can also detect the …

We consider the problem of transforming any weakly connected overlay network of
polylogarithmic degree into a topology of logarithmic diameter. The overlay network is …