Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra · 2020
Given a set R of robots, each one located at a different vertex of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a multiset F of grid vertices such that |R| = |F|, APF asks for a distributed algorithm that moves robots so as to reach a configuration similar to F. Similarity means that robots must be disposed as F regardless of translations, rotations, reflections.