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

DOI10.1016/j.tcs.2022.09.016OpenAlexW3193317451MaRDI QIDQ5918536

Matthew Connor, Othon Michail, Igor Potapov

Publication date: 21 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.016

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 (3)

On geometric shape construction via growth operations ⋮ Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes ⋮ On geometric shape construction via growth operations

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
• 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
• The canonical amoebot model: algorithms and concurrency control

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