Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs

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. So far, as possible discretization of the Euclidean plane only the standard square grid has been considered in the context of the classical Look-Compute-Move model. However, it is natural to consider the other regular tessellation graphs, that are triangular and hexagonal grids. For any regular tessellation graph, we provide a resolution algorithm for APF when the initial configuration is asymmetric.

[1]  Alfredo Navarra,et al.  On Gathering of Semi-synchronous Robots in Graphs , 2019, SSS.

[2]  Kaustav Bose,et al.  Arbitrary Pattern Formation by Opaque Fat Robots with Lights , 2020, CALDAM.

[3]  Alfredo Navarra,et al.  Embedded pattern formation by asynchronous robots without chirality , 2018, Distributed Computing.

[4]  Sébastien Tixeuil,et al.  Arbitrary Pattern Formation with Four Robots , 2018, SSS.

[5]  Alfredo Navarra,et al.  Leader Election and Compaction for Asynchronous Silent Programmable Matter , 2020, AAMAS.

[6]  Alfredo Navarra,et al.  Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring , 2010, Theor. Comput. Sci..

[7]  Mattia D'Emidio,et al.  Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane , 2018, Inf. Comput..

[8]  Sruti Gan Chaudhuri,et al.  Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement , 2016, WALCOM.

[9]  Alfredo Navarra,et al.  Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings , 2016, Distributed Computing.

[10]  Christian Scheideler,et al.  Forming tile shapes with simple robots , 2018, Natural Computing.

[11]  Kaustav Bose,et al.  Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots , 2018, WALCOM.

[12]  Alfredo Navarra,et al.  MinMax-Distance Gathering on Given Meeting Points , 2015, CIAC.

[13]  Masafumi Yamashita,et al.  Characterizing geometric patterns formable by oblivious anonymous mobile robots , 2010, Theor. Comput. Sci..

[14]  Eugen J. Ionascu.  HALF DOMINATION ARRANGEMENTS IN REGULAR AND SEMI-REGULAR TESSELLATION TYPE GRAPHS , 2012 .

[15]  Ajay D. Kshemkalyani,et al.  Dispersion of Mobile Robots on Grids , 2020, WALCOM.

[16]  Alfredo Navarra,et al.  Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach , 2018, Distributed Computing.

[17]  Alfredo Navarra,et al.  Gathering of robots on meeting-points: feasibility and optimal resolution algorithms , 2018, Distributed Computing.

[18]  Alfredo Navarra,et al.  Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies , 2019, SIROCCO.

[19]  Yukiko Yamauchi,et al.  Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots , 2014, DISC.

[20]  Nicola Santoro,et al.  Autonomous mobile robots with lights , 2016, Theor. Comput. Sci..

[21]  Alfredo Navarra,et al.  Gathering of robots on anonymous grids and trees without multiplicity detection , 2016, Theor. Comput. Sci..

[22]  Yukiko Yamauchi,et al.  Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space , 2017, J. ACM.

[23]  Alfredo Navarra,et al.  Asynchronous Robots on Graphs: Gathering , 2019, Distributed Computing by Mobile Entities.

[24]  Nicolas Nisse,et al.  A unified approach for gathering and exclusive searching on rings under weak assumptions , 2016, Distributed Computing.

[25]  Koichi Wada,et al.  A pattern formation algorithm for a set of autonomous distributed robots with agreement on orientation along one axis , 2006, Systems and Computers in Japan.

[26]  Franck Petit,et al.  Leader Election Problem versus Pattern Formation Problem , 2010, DISC.

[27]  Alfredo Navarra,et al.  "Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems , 2018, 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS).

[28]  Alfredo Navarra,et al.  Gathering on rings under the Look–Compute–Move model , 2014, Distributed Computing.

[29]  Nicola Santoro,et al.  Distributed Computing by Mobile Robots: Gathering , 2012, SIAM J. Comput..

[30]  Pavan Poudel,et al.  Time-optimal uniform scattering in a grid , 2019, ICDCN.

[31]  Nicola Santoro,et al.  Arbitrary pattern formation by asynchronous, anonymous, oblivious robots , 2008, Theor. Comput. Sci..

[32]  Nicolas Nisse,et al.  Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks , 2014, Algorithmica.

[33]  Alfredo Navarra,et al.  Gathering of oblivious robots on infinite grids with minimum traveled distance , 2017, Inf. Comput..

[34]  Krishnendu Mukhopadhyaya,et al.  A Distributed Algorithm for Pattern Formation by Autonomous Robots, with No Agreement on Coordinate Compass , 2010, ICDCIT.

[35]  Christian Scheideler,et al.  Computing by Programmable Particles , 2019, Distributed Computing by Mobile Entities.

[36]  Alfredo Navarra,et al.  A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study , 2020, ArXiv.

[37]  Serafino Cicerone.  Breaking Symmetries on Tessellation Graphs via Asynchronous Robots , 2020, ICTCS.

[38]  Nicola Santoro,et al.  Gathering of asynchronous robots with limited visibility , 2005, Theor. Comput. Sci..

[39]  Masafumi Yamashita,et al.  Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 2006, SIAM J. Comput..

[40]  Nicola Santoro,et al.  Forming sequences of geometric patterns with oblivious mobile robots , 2015, Distributed Computing.