Arbitrary pattern formation by opaque fat robots on infinite grid
share
Arbitrary Pattern formation (𝒜𝒫ℱ) by a swarm of mobile robots is a widely studied problem in the literature. Many works regarding 𝒜𝒫ℱ have been proposed on plane and infinite grid by point robots. But in practical application, it is impossible to design point robots. In <cit.>, the robots are assumed opaque fat robots but the environment is plane. To the best of our knowledge, no work till now ever considered the 𝒜𝒫ℱ problem assuming opaque fat robots on infinite grid where movements are restricted. In this paper, we have provided a collisionless distributed algorithm and solved 𝒜𝒫ℱ using 9 colors.
READ FULL TEXT