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 …
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 …
[HTML][HTML] Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
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 …
A comprehensive evaluation of the computational power of robots moving within the …
On the computational power of energy-constrained mobile robots: Algorithms and cross-model analysis
We consider distributed systems of identical autonomous computational entities, called
robots, moving and operating in the plane in synchronous Look-Compute-Move (LCM) …
robots, moving and operating in the plane in synchronous Look-Compute-Move (LCM) …
[HTML][HTML] Gathering robots in graphs: The central role of synchronicity
The Gathering task for k robots disposed on the n vertices of a graph G requires robots to
move toward a common vertex from where they do not move anymore. When dealing with …
move toward a common vertex from where they do not move anymore. When dealing with …
“semi-asynchronous”: a new scheduler in distributed computing
The study of mobile entities that based on local information have to accomplish global tasks
is of main interest for the scientific community. Classic models for the activation and …
is of main interest for the scientific community. Classic models for the activation and …
Separating bounded and unbounded asynchrony for autonomous robots: Point convergence with limited visibility
We consider distributed computations, by identical autonomous mobile entities, that solve
the Point Convergence problem: given an arbitrary initial configuration of entities, disposed …
the Point Convergence problem: given an arbitrary initial configuration of entities, disposed …
Asynchronous robots on graphs: Gathering
Gathering a swarm of robots is one of the basic tasks in distributed computing. Varying of the
robots' capabilities as well as on the environments where robots move lead to very different …
robots' capabilities as well as on the environments where robots move lead to very different …
Gathering
P Flocchini - Distributed Computing by Mobile Entities: Current …, 2019 - Springer
In this Chapter, we focus on the Gathering problem: that is, the problem of having the robots,
initially located in arbitrary distinct points of the plane, gather in the exact same location. In …
initially located in arbitrary distinct points of the plane, gather in the exact same location. In …
Time optimal gathering of myopic robots on an infinite triangular grid
This work deals with the problem of gathering n oblivious mobile entities, called robots, at a
point (not known beforehand) placed on an infinite triangular grid. The robots are …
point (not known beforehand) placed on an infinite triangular grid. The robots are …