[HTML][HTML] Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
Abstract The Arbitrary Pattern Formation problem asks to design a distributed algorithm that
allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern …
allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern …
Arbitrary pattern formation on infinite regular tessellation graphs
S Cicerone, A Di Fonso, G Di Stefano… - Proceedings of the 22nd …, 2021 - dl.acm.org
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 …
The geodesic mutual visibility problem for oblivious robots: the case of trees
S Cicerone, A Di Fonso, G Di Stefano… - Proceedings of the 24th …, 2023 - dl.acm.org
The Mutual Visibility is a well-known problem in the context of mobile robots. For a set of n
robots disposed in the Euclidean plane, it asks for moving the robots without collisions so as …
robots disposed in the Euclidean plane, it asks for moving the robots without collisions so as …
[HTML][HTML] The geodesic mutual visibility problem: Oblivious robots on grids and trees
S Cicerone, A Di Fonso, G Di Stefano… - Pervasive and Mobile …, 2023 - Elsevier
Abstract The Mutual Visibility is a well-known problem in the context of mobile robots. For a
set of n robots disposed in the Euclidean plane, it asks for moving the robots without …
set of n robots disposed in the Euclidean plane, it asks for moving the robots without …
Time-optimal geodesic mutual visibility of robots on grids within minimum area
S Cicerone, A Di Fonso, G Di Stefano… - … Symposium on Stabilizing …, 2023 - Springer
For a set of robots disposed on the Euclidean plane, Mutual Visibility is often desirable. The
requirement is to move robots without collisions so as to achieve a placement where no …
requirement is to move robots without collisions so as to achieve a placement where no …
Arbitrary pattern formation by opaque fat robots on infinite grid
Arbitrary Pattern formation (APF) by a swarm of mobile robots is a widely studied problem in
the literature. Many works regarding APF have been proposed on plane and infinite grid by …
the literature. Many works regarding APF have been proposed on plane and infinite grid by …
Arbitrary pattern formation by asynchronous opaque robots with lights
Abstract The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves
a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots …
a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots …
A structured methodology for designing distributed algorithms for mobile entities
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 …
two decades, we consider the need of a structured methodology to tackle the arisen …
Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid
ABSTRACT The Arbitrary Pattern Formation (Apf) is widely studied in distributed computing
for swarm robots. This paper deals with the Apf problem in an infinite grid under an …
for swarm robots. This paper deals with the Apf problem in an infinite grid under an …
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 …