Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach

We study a model of programmable matter systems consisting of n devices lying on a 2-dimensional square grid which are able to perform the minimal mechanical operation of rotating around each other. The goal is to transform an initial shape A into a target shape B. We investigate the class of shapes which can be constructed in such a scenario under the additional constraint of maintaining global connectivity at all times. We focus on the scenario of transforming nice shapes, a class of shapes consisting of a central line L where for all nodes u in S either u ∈ L or u is connected to L by a line of nodes perpendicular to L. We prove that by introducing a minimal 3-node seed it is possible for the canonical shape of a line of n nodes to be transformed into a nice shape of n−1 nodes. We use this to show that a 4-node seed enables the transformation of nice shapes of size n into any other nice shape of size n in O(n) time. We leave as an open problem the expansion of the class of shapes which can be constructed using such a seed to include those derived from nice shapes.

[1]  Paul G. Spirakis,et al.  On the transformation capability of feasible mechanisms for programmable matter , 2019, J. Comput. Syst. Sci..

[2]  M. Sahani,et al.  Algorithmic Self-Assembly of DNA , 2006 .

[3]  David Doty,et al.  Theory of algorithmic self-assembly , 2012, CACM.

[4]  Christian Scheideler,et al.  An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems , 2015, NANOCOM.

[5]  Neil Gershenfeld,et al.  The Milli-Motein: A self-folding chain of programmable matter with a one centimeter module pitch , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Esther M. Arkin,et al.  Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers , 2019, ESA.

[7]  Paul G. Spirakis,et al.  Simple and efficient local codes for distributed stable network construction , 2013, Distributed Computing.

[8]  Christian Scheideler,et al.  Amoebot - a new model for programmable matter , 2014, SPAA.

[9]  Erik Winfree,et al.  Active self-assembly of algorithmic shapes and patterns in polylogarithmic time , 2013, ITCS '13.

[10]  David Doty,et al.  Timing in chemical reaction networks , 2013, SODA.

[11]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[12]  J. Bourgeois,et al.  3D Coating Self-Assembly for Modular Robotic Scaffolds , 2020, 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[13]  Radhika Nagpal,et al.  Programmable self-assembly in a thousand-robot swarm , 2014, Science.

[14]  P. Rothemund.  Folding DNA to create nanoscale shapes and patterns , 2006, Nature.

[15]  Christian Scheideler,et al.  On the runtime of universal coating for programmable matter , 2016, Natural Computing.

[16]  Hong Xu,et al.  Magnetochromatic polydiacetylene by incorporation of Fe3O4 nanoparticles. , 2011, Angewandte Chemie.

[17]  Paul G. Spirakis,et al.  On the Transformation Capability of Feasible Mechanisms for Programmable Matter , 2017, ICALP.

[18]  Othon Michail,et al.  Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter , 2019, ALGOSENSORS.

[19]  Christian Scheideler,et al.  Universal Shape Formation for Programmable Matter , 2016, SPAA.

[20]  Othon Michail,et al.  Pushing lines helps: Efficient universal centralised transformations for programmable matter , 2020, Theor. Comput. Sci..

[21]  Erik Winfree,et al.  The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.

[22]  Esther M. Arkin,et al.  Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers , 2021, Algorithmica.

[23]  Julien Bourgeois,et al.  Distributed Self-Reconfiguration using a Deterministic Autonomous Scaffolding Structure , 2019, AAMAS.

[24]  Daniela Rus,et al.  Robot pebbles: One centimeter modules for programmable matter through self-disassembly , 2010, 2010 IEEE International Conference on Robotics and Automation.

[25]  Matthew Cook,et al.  Computation with finite stochastic chemical reaction networks , 2008, Natural Computing.