Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach

DOI10.1007/978-3-030-89240-1_4zbMath1498.68328arXiv2108.09250OpenAlexW3208942503MaRDI QIDQ5918710

Igor Potapov, Matthew Connor, Othon Michail

Publication date: 24 June 2022

Published in: Algorithms for Sensor Systems (Search for Journal in Brave)

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

zbMATH Keywords

transformationprogrammable mattershape formationreconfigurable roboticscentralised algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Other nonclassical models of computation (68Q09)

Related Items (1)

Distributed transformations of Hamiltonian shapes based on line moves

Uses Software

• AmoebotSim

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)
• Timing in chemical reaction networks
• Simple and efficient local codes for distributed stable network construction

This page was built for publication: Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach