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 …

Consider a set of mobile robots placed on distinct nodes of a discrete, anonymous, and
bidirectional ring. Asynchronously, each robot takes a snapshot of the ring, determining the …

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 …

The paper presents general results about the gathering problem on graphs. A team of robots
placed at the vertices of a graph, have to meet at some vertex and remain there. Robots …

Vehicular ad-hoc network (VANET) is a technology used to create a wireless ad-hoc network
on demand basis using mobile vehicles. In VANET, mobile vehicles behave like a …

We study theoretical models of programmable matter systems, consisting of n spherical
modules kept together by magnetic or electrostatic forces and able to perform two minimal …

The paper considers variants of the gathering problem of oblivious and asynchronous robots
moving in the plane. When n> 2 n> 2 robots are free to gather anywhere in the plane, the …

The task of rendezvous (also called gathering) calls for a meeting of two or more mobile
entities, starting from different positions in some environment. Those entities are called …

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 …