,
Jonas Harbig
,
Peter Kling
Creative Commons Attribution 4.0 International license
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.
@InProceedings{hahn_et_al:LIPIcs.SAND.2024.14,
author = {Hahn, Christopher and Harbig, Jonas and Kling, Peter},
title = {{Forming Large Patterns with Local Robots in the OBLOT Model}},
booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-315-7},
ISSN = {1868-8969},
year = {2024},
volume = {292},
editor = {Casteigts, Arnaud and Kuhn, Fabian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.14},
URN = {urn:nbn:de:0030-drops-198924},
doi = {10.4230/LIPIcs.SAND.2024.14},
annote = {Keywords: Swarm Algorithm, Swarm Robots, Distributed Algorithm, Pattern Formation, Limited Visibility, Oblivious}
}