Arbitrary pattern formation by opaque fat robots on infinite grid
Abstract
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 point robots. But in practical application, it is impossible to design point robots. In BoseAKS20, 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 APF problem assuming opaque fat robots on infinite grid where movements are restricted. In this paper, we have provided a collisionless distributed algorithm and solved APF using 9 colors.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.