Shape formation by programmable particles
From MaRDI portal
Publication:3300834
DOI10.4230/LIPICS.OPODIS.2017.31zbMATH Open1478.68017OpenAlexW2940319467MaRDI QIDQ3300834FDOQ3300834
Authors: Yukiko Yamauchi, Giuseppe Antonio Di Luna, P. Flocchini, N. Santoro, G. Viglietta 
Publication date: 30 July 2020
Full work available at URL: https://arxiv.org/abs/1705.03538
Recommendations
- Shape formation by programmable particles
- Leader election and shape formation with self-organizing programmable matter
- On the transformation capability of feasible mechanisms for programmable matter
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Line reconfiguration by programmable particles maintaining connectivity
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- An introduction to tile-based self-assembly and a survey of recent results
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Forming sequences of geometric patterns with oblivious mobile robots
- Leader election and shape formation with self-organizing programmable matter
- Universal coating for programmable matter
- On the transformation capability of feasible mechanisms for programmable matter
- Pattern formation by oblivious asynchronous mobile robots
- Distributed reconfiguration of metamorphic robot chains
- A Markov chain algorithm for compression in self-organizing particle systems
- Universal computation and optimal construction in the chemical reaction network-controlled tile assembly model
Cited In (14)
- Deterministic Leader Election in Programmable Matter
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Leader election and shape formation with self-organizing programmable matter
- Search by a metamorphic robotic system in a finite 2D square grid
- Line reconfiguration by programmable particles maintaining connectivity
- 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
- Geometric self-assembly of rigid shapes: a simple Voronoi approach
- Particle computation: complexity, algorithms, and logic
- A Markov chain algorithm for compression in self-organizing particle systems
- Stationary and deterministic leader election in self-organizing particle systems
- Universal coating for programmable matter
- Full tilt: universal constructors for general shapes with uniform external forces
This page was built for publication: Shape formation by programmable particles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300834)
