The geodesic mutual visibility problem for oblivious robots: the case of trees
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
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
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 …
[HTML][HTML] 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 …
[HTML][HTML] 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 …
Time-optimal uniform scattering in a grid
We consider the distributed setting of K=(k+ 1)×(k+ 1) autonomous mobile robots operating
on a grid graph of N=(n+ 1)×(n+ 1) nodes with n= k⊙ d, d≥ 2, k≥ 2, following Look …
on a grid graph of N=(n+ 1)×(n+ 1) nodes with n= k⊙ d, d≥ 2, k≥ 2, following Look …
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 …
O (log n)-time complete visibility 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 …
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 …