7 research outputs found
Circle formation by asynchronous opaque robots on infinite grid
This paper presents a distributed algorithm for circle formation problem under the infinite grid environment by asynchronous mobile opaque robots. Initially all the robots are acquiring distinct positions and they have to form a circle over the grid. Movements of the robots are restricted only along the grid lines. They do not share any global co-ordinate system. Robots are controlled by an asynchronous adversarial scheduler that operates in Look-Compute-Move cycles. The robots are indistinguishable by their nature, do not have any memory of their past configurations and previous actions. We consider the problem under luminous model, where robots communicate via lights, other than that they do not have any external communication system. Our protocol solves the circle formation problem using seven colors. A subroutine of our algorithm also solves the line formation problem using three colors
Circle Formation by Asynchronous Opaque Fat Robots on an Infinite Grid
This study addresses the problem of "Circle Formation on an Infinite Grid by
Fat Robots" (). Unlike prior work focused solely on point robots
in discrete domain, it introduces fat robots to circle formation on an infinite
grid, aligning with practicality as even small robots inherently possess
dimensions. The algorithm, named , resolves the
problem using a swarm of fat luminous robots. Operating under an asynchronous
scheduler, it achieves this with five distinct colors and by leveraging
one-axis agreement among the robots
Arbitrary pattern formation by asynchronous opaque robots on infinite grid
Arbitrary pattern formation () by mobile robots is studied by
many in literature under different conditions and environment. Recently it has
been studied on an infinite grid network but with full visibility. In opaque
robot model, circle formation on infinite grid has also been studied. In this
paper, we are solving on infinite grid with asynchronous opaque
robots with lights. The robots do not share any global co-ordinate system. The
main challenge in this problem is to elect a leader to agree upon a global
co-ordinate where the vision of the robots are obstructed by other robots.
Since the robots are on a grid, their movements are also restricted to avoid
collisions. In this paper, the aforementioned hardness are overcome to produce
an algorithm that solves the problem