Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
We consider the distributed setting of N autonomous mobile robots that operate in Look-
Compute-Move (LCM) cycles and communicate with other robots using colored lights …
Compute-Move (LCM) cycles and communicate with other robots using colored lights …
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 …
Mutual visibility by asynchronous robots on infinite grid
Consider a set of autonomous, identical, opaque point robots in the Euclidean plane. The
Mutual Visibility problem asks the robots to reposition themselves, without colliding, to a …
Mutual Visibility problem asks the robots to reposition themselves, without colliding, to a …
Constant-time complete visibility for asynchronous robots with lights
We consider the distributed setting of N autonomous mobile robots that operate in Look-
Compute-Move cycles and communicate with other robots using colored lights following the …
Compute-Move cycles and communicate with other robots using colored lights following the …
On fast pattern formation by autonomous robots
We consider the fundamental problem of arranging a set of n autonomous robots (points) on
a real plane according to an arbitrary given pattern. Each robot operates in a, largely …
a real plane according to an arbitrary given pattern. Each robot operates in a, largely …
Optimal randomized complete visibility on a grid for asynchronous robots with lights
We consider the distributed setting of N autonomous mobile robots that operate in Look-
Compute-Move (LCM) cycles and communicate with other robots using colored lights (the …
Compute-Move (LCM) cycles and communicate with other robots using colored lights (the …
Optimum algorithm for mutual visibility among asynchronous robots with lights
S Bhagat, K Mukhopadhyaya - … Safety, and Security of Distributed Systems …, 2017 - Springer
This paper addresses the constrained version of the mutual visibility problem for a set of
asynchronous, opaque robots in the Euclidean plane. The mutual visibility problem asks the …
asynchronous, opaque robots in the Euclidean plane. The mutual visibility problem asks the …
Uniform circle formation for swarms of opaque robots with lights
C Feletti, C Mereghetti, B Palano - … , SSS 2018, Tokyo, Japan, November 4 …, 2018 - Springer
Abstract The Uniform Circle Formation problem requires a swarm of mobile agents,
arbitrarily positioned onto the plane, to move on the vertices of a regular polygon. Each …
arbitrarily positioned onto the plane, to move on the vertices of a regular polygon. Each …
Complete visibility for mobile robots with lights tolerating faults
A Aljohani, G Sharma - International Journal of Networking and …, 2018 - jstage.jst.go.jp
We consider the distributed setting of N autonomous mobile robots that operate in Look-
Compute-Move (LCM) cycles and communicate with other robots using colored lights (the …
Compute-Move (LCM) cycles and communicate with other robots using colored lights (the …
Robots with lights
GA Di Luna, G Viglietta - Distributed Computing by Mobile Entities: Current …, 2019 - Springer
Abstract The classic Look-Compute-Move model of oblivious robots has many strengths:
algorithms designed for this model are inherently resistant to a large set of failures that can …
algorithms designed for this model are inherently resistant to a large set of failures that can …