Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes

DOI10.1007/978-3-031-22050-0_5arXiv2207.03062OpenAlexW4313117429MaRDI QIDQ6111997

Othon Michail, Matthew Connor

Publication date: 4 August 2023

Published in: Algorithmics of Wireless Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.03062

zbMATH Keywords

transformationprogrammable mattershape formationreconfigurable roboticscentralised algorithms

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Computation with finite stochastic chemical reaction networks
• On the transformation capability of feasible mechanisms for programmable matter
• Pushing lines helps: efficient universal centralised transformations for programmable matter
• Computation in networks of passively mobile finite-state sensors
• Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
• On the Runtime of Universal Coating for Programmable Matter
• Leader Election and Shape Formation with Self-organizing Programmable Matter
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• The program-size complexity of self-assembled squares (extended abstract)
• On the Transformation Capability of Feasible Mechanisms for Programmable Matter
• Timing in chemical reaction networks
• Simple and efficient local codes for distributed stable network construction
• Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach