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 …

Mobile agent computing is being used in fields as diverse as artificial intelligence,
computational economics and robotics. Agents' ability to adapt dynamically and execute …

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 …

We consider a new type of asymmetric rendezvous search problem in which player II needs
to give player I a 'gift'which can be in the form of information or material. The gift can either …

This paper studies the well-known problem of gathering multiple mobile agents moving in a
graph, but unlike previous results, we consider the problem in the presence of an …

We consider the problem of gathering a set of autonomous, identical, oblivious,
asynchronous, mobile robots at a vertex of an anonymous hypercube. The robots operate in …

Two mobile agents, starting from different nodes of an unknown network, have to meet at a
node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has …

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 …

We investigate the relation between the (ideal) time and space complexities for the
gathering problem with k anonymous agents in asynchronous anonymous tree networks …