Pushing lines helps: efficient universal centralised transformations for programmable matter

DOI10.1007/978-3-030-34405-4_3MaRDI QIDQ6536153zbMATH OpenFDO

Authors Abdullah Almethen, Othon Michail, Igor Potapov

Publication date 5 April 2024

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Recommendations

• Pushing lines helps: efficient universal centralised transformations for programmable matter
• 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
• On the transformation capability of feasible mechanisms for programmable matter

Cites work

• scientific article; zbMATH DE number 1834637 (Why is no real title available?)
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional Euclidean space
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Computation in networks of passively mobile finite-state sensors
• Controlled module density helps reconfiguration planning
• Distributed computing by mobile robots: gathering
• Distributed reconfiguration of metamorphic robot chains
• Efficient reconfiguration of lattice-based modular robots
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Forming sequences of geometric patterns with oblivious mobile robots
• Keeping Mobile Robot Swarms Connected
• On the transformation capability of feasible mechanisms for programmable matter
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• Particle computation: complexity, algorithms, and logic
• Pushing squares around
• Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
• Shape formation by programmable particles
• The computational power of population protocols
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(1)

• Distributed transformations of Hamiltonian shapes based on line moves

This page was built for publication: Pushing lines helps: efficient universal centralised transformations for programmable matter

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