LIPIcs.SAND.2024.14.pdf
- Filesize: 1.04 MB
- 20 pages
In the arbitrary pattern formation problem, n autonomous, mobile robots must form an arbitrary pattern P ⊆ R². The (deterministic) robots are typically assumed to be indistinguishable, disoriented, and unable to communicate. An important distinction is whether robots have memory and/or a limited viewing range. Previous work managed to form P under a natural symmetry condition if robots have no memory but an unlimited viewing range [Masafumi Yamashita and Ichiro Suzuki, 2010] or if robots have a limited viewing range but memory [Yukiko Yamauchi and Masafumi Yamashita, 2013]. In the latter case, P is only formed in a shrunk version that has constant diameter. Without memory and with limited viewing range, forming arbitrary patterns remains an open problem. We provide a partial solution by showing that P can be formed under the same symmetry condition if the robots' initial diameter is ≤ 1. Our protocol partitions P into rotation-symmetric components and exploits the initial mutual visibility to form one cluster per component. Using a careful placement of the clusters and their robots, we show that a cluster can move in a coordinated way through its component while "drawing" P by dropping one robot per pattern coordinate.
Feedback for Dagstuhl Publishing