Universal coating for programmable matter
From MaRDI portal
Abstract: The idea behind universal coating is to have a thin layer of a specific substance covering an object of any shape so that one can measure a certain condition (like temperature or cracks) at any spot on the surface of the object without requiring direct access to that spot. We study the universal coating problem in the context of self-organizing programmable matter consisting of simple computational elements, called particles, that can establish and release bonds and can actively move in a self-organized way. Based on that matter, we present a worst-case work-optimal universal coating algorithm that uniformly coats any object of arbitrary shape and size that allows a uniform coating. Our particles are anonymous, do not have any global information, have constant-size memory, and utilize only local interactions.
Recommendations
Cites work
- \textit{Physarum} can compute shortest paths
- An introduction to tile-based self-assembly and a survey of recent results
- Computation in networks of passively mobile finite-state sensors
- Intrinsic universality and the computational power of self-assembly
- Leader election and shape formation with self-organizing programmable matter
- Local spreading algorithms for autonomous robot systems
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- On the computational power of oblivious robots
- Universal coating for programmable matter
Cited in
(12)- Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
- Shape formation by programmable particles
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Shape formation by programmable particles
- Shape recognition by a finite automaton robot
- Deterministic Leader Election in Programmable Matter
- Universal coating for programmable matter
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- The canonical amoebot model: algorithms and concurrency control
- On geometric shape construction via growth operations
- On geometric shape construction via growth operations
- Stationary and deterministic leader election in self-organizing particle systems
This page was built for publication: Universal coating for programmable matter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529029)
