How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite,
unknown connected graph or in an unknown connected terrain in the plane. Agents are …
unknown connected graph or in an unknown connected terrain in the plane. Agents are …
Arbitrary pattern formation on infinite regular tessellation graphs
Given a set R of robots, each one located at a different vertex of an infinite regular
tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a …
tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a …
A Markov chain algorithm for compression in self-organizing particle systems
We consider programmable matter as a collection of simple computational elements (or
particles) with limited (constant-size) memory that self-organize to solve system-wide …
particles) with limited (constant-size) memory that self-organize to solve system-wide …
Computing without communicating: Ring exploration by asynchronous oblivious robots
We consider the problem of exploring an anonymous unoriented ring by a team of k
identical, oblivious, asynchronous mobile robots that can view the environment but cannot …
identical, oblivious, asynchronous mobile robots that can view the environment but cannot …
[HTML][HTML] Gathering of robots on anonymous grids and trees without multiplicity detection
The paper studies the gathering problem on grid and tree networks. A team of robots placed
at different nodes of the input graph, has to meet at some node and remain there. Robots …
at different nodes of the input graph, has to meet at some node and remain there. Robots …
Gathering on rings under the look–compute–move model
A set of robots arbitrarily placed on different nodes of an anonymous ring have to meet at
one common node and there remain. This problem is known in the literature as the …
one common node and there remain. This problem is known in the literature as the …
A unified approach for gathering and exclusive searching on rings under weak assumptions
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 …
bidirectional ring. Asynchronously, each robot takes a snapshot of the ring, determining the …
Embedded pattern formation by asynchronous robots without chirality
Abstract We consider the Embedded Pattern Formation (epf) problem introduced in Fu**aga
et al.(SIAM J Comput 44 (3): 740–785, 2015). Given a set F of distinct points in the Euclidean …
et al.(SIAM J Comput 44 (3): 740–785, 2015). Given a set F of distinct points in the Euclidean …
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
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 …
placed at the vertices of a graph, have to meet at some vertex and remain there. Robots …
[HTML][HTML] Gathering of oblivious robots on infinite grids with minimum traveled distance
A largely studied version of the gathering problem asks to move a set of robots initially
placed at different vertices of an anonymous graph toward a common vertex, and to let them …
placed at different vertices of an anonymous graph toward a common vertex, and to let them …