Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in
an infinite grid of dimension δ> 0, starting from two arbitrary positions at distance at most d …

Following the wide investigation in distributed computing issues by mobile entities of the last
two decades, we consider the need of a structured methodology to tackle the arisen …

Among fundamental problems in the context of distributed computing by mobile robots, the
Pattern Formation (PF) is certainly the most representative. Given a multi-set F of points in …

Given an arbitrary partial anonymous grid (a finite grid with possibly missing vertices or
edges), this paper focuses on the exploration of such a grid by a set of mobile anonymous …

Considering autonomous mobile robots moving on a finite anonymous graph, this paper
focuses on the Constrained Perpetual Graph Exploration problem (CPGE). That problem …

Efficient exploration of unknown or unmapped environments has become one of the
fundamental problem domains in algorithm design. Its applications range from robot …

We consider the problem of periodic exploration of all nodes in undirected graphs by using a
finite state automaton called later a robot. The robot, using a constant number of states …

We study the following problem in elementary robotics: can a mobile agent with $ b $ bits of
memory, which is able to sense only locations at Manhattan distance $ V $ or less from itself …

The paper considers a team of robots which has to explore a graph G, where some nodes
can be harmful. Robots are initially located at the so-called home base node. The …

We consider a general framework in which a memoryless robot periodically explores all the
nodes of a connected anonymous graph by following local information available at each …