Pushing lines helps: efficient universal centralised transformations for programmable matter
From MaRDI portal
Publication:6536153
DOI10.1007/978-3-030-34405-4_3zbMATH Open1540.68086MaRDI QIDQ6536153FDOQ6536153
Authors: Abdullah Almethen, Othon Michail, Igor Potapov 
Publication date: 5 April 2024
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
Other nonclassical models of computation (68Q09) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Cites Work
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- The program-size complexity of self-assembled squares (extended abstract)
- Computation in networks of passively mobile finite-state sensors
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Distributed computing by mobile robots: gathering
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- The computational power of population protocols
- Title not available (Why is that?)
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Forming sequences of geometric patterns with oblivious mobile robots
- Keeping Mobile Robot Swarms Connected
- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
- Controlled module density helps reconfiguration planning
- On the transformation capability of feasible mechanisms for programmable matter
- Efficient reconfiguration of lattice-based modular robots
- Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional Euclidean space
- Distributed reconfiguration of metamorphic robot chains
- Pushing squares around
- Shape formation by programmable particles
- Particle computation: complexity, algorithms, and logic
Cited In (1)
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)
