On the transformation capability of feasible mechanisms for programmable matter

DOI10.4230/LIPICS.ICALP.2017.136zbMATH Open1442.68238OpenAlexW2605357398MaRDI QIDQ5111468FDOQ5111468

George Skretas, Othon Michail, P. G. Spirakis

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.136

Recommendations

• On the transformation capability of feasible mechanisms for programmable matter
• Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
• Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
• Pushing lines helps: efficient universal centralised transformations for programmable matter
• Shape formation by programmable particles

zbMATH Keywords

complexitydistributed algorithmstransformationprogrammable mattershape formationreconfigurable robotics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Cited In (7)

• Pushing lines helps: efficient universal centralised transformations for programmable matter
• On the transformation capability of feasible mechanisms for programmable matter
• Shape formation by programmable particles
• Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
• Programmable reconfiguration of Physarum machines
• Terminating distributed construction of shapes and patterns in a fair solution of automata
• Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes

This page was built for publication: On the transformation capability of feasible mechanisms for programmable matter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111468)