On the Runtime of Universal Coating for Programmable Matter
From MaRDI portal
Publication:2835712
DOI10.1007/978-3-319-43994-5_10zbMath1451.68118arXiv1606.03642OpenAlexW2780527697MaRDI QIDQ2835712
Zahra Derakhshandeh, Alexandra Porter, Thim Strothmann, Robert Gmyr, Christian Scheideler, Andréa W. Richa, Joshua J. Daymude
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science, Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03642
Related Items (20)
Search by a metamorphic robotic system in a finite 2D square grid ⋮ Improved Leader Election for Self-organizing Programmable Matter ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Shape formation by programmable particles ⋮ Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021 ⋮ The canonical amoebot model: algorithms and concurrency control ⋮ On geometric shape construction via growth operations ⋮ Molecular robots with chirality on grids ⋮ Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes ⋮ Shape formation by programmable particles ⋮ Network Constructors: A Model for Programmable Matter ⋮ Building a nest by an automaton ⋮ CADbots: algorithmic aspects of manipulating programmable matter with finite automata ⋮ Forming tile shapes with simple robots ⋮ Unnamed Item ⋮ On efficient connectivity-preserving transformations in a grid ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach ⋮ Distributed transformations of Hamiltonian shapes based on line moves ⋮ The Synergy of Finite State Machines
Uses Software
Cites Work
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Universal coating for programmable matter
- Parallel computation using active self-assembly
- Computation in networks of passively mobile finite-state sensors
- \textit{Physarum} can compute shortest paths
- Leader Election and Shape Formation with Self-organizing Programmable Matter
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Simple and efficient local codes for distributed stable network construction
This page was built for publication: On the Runtime of Universal Coating for Programmable Matter
