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 …

A team consisting of an unknown number of mobile agents, starting from different nodes of
an unknown network, have to meet at the same node. Agents move in synchronous rounds …

Two mobile agents starting at different nodes of an unknown network have to meet. This task
is known in the literature as rendezvous. Each agent has a different label which is a positive …

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 …

This paper considers the problem of Byzantine dispersion and extends previous work along
several parameters. The problem of Byzantine dispersion asks: given n robots, up to f of …

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 …

This paper investigates an open problem introduced in Dieudonné et al.(ACM Trans
Algorithms 11 (1): 1, 2014). Two or more mobile agents start from nodes of a network and …

In this paper we study the computational power of mobile robots without global coordination.
A comprehensive evaluation of the computational power of robots moving within the …

We study the problem of map** an unknown environment represented as an unlabelled
undirected graph. A robot (or automaton) starting at a single vertex of the graph G has to …

The aim of rendezvous in a graph is meeting of two mobile agents at some node of an
unknown anonymous connected graph. In this article, we focus on rendezvous in trees, and …