Pushing lines helps: efficient universal centralised transformations for programmable matter

DOI10.1007/978-3-030-34405-4_3zbMath1540.68086MaRDI QIDQ6536153

Abdullah Almethen, Othon Michail, Igor Potapov

Publication date: 5 April 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• On the transformation capability of feasible mechanisms for programmable matter
• The computational power of population protocols
• Shape formation by programmable particles
• Forming sequences of geometric patterns with oblivious mobile robots
• Computation in networks of passively mobile finite-state sensors
• Efficient reconfiguration of lattice-based modular robots
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• On the Runtime of Universal Coating for Programmable Matter
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• Distributed Computing by Mobile Robots: Gathering
• The program-size complexity of self-assembled squares (extended abstract)
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
• Keeping Mobile Robot Swarms Connected
• Distributed reconfiguration of metamorphic robot chains
• Pushing squares around
• Brief Announcement
• Simple and efficient local codes for distributed stable network construction
• Particle computation: complexity, algorithms, and logic

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