Leader Election and Shape Formation with Self-organizing Programmable Matter
From MaRDI portal
Publication:2948412
DOI10.1007/978-3-319-21999-8_8zbMath1404.68045arXiv1503.07991OpenAlexW1632525963MaRDI QIDQ2948412
Zahra Derakhshandeh, Thim Strothmann, Robert Gmyr, Rida A. Bazzi, Christian Scheideler, Andréa W. Richa
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.07991
Related Items (18)
Improved Leader Election for Self-organizing Programmable Matter ⋮ 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 ⋮ Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes ⋮ Molecular pattern formation on grids in the \textsc{Moblot} model ⋮ Shape formation by programmable particles ⋮ Improved Tradeoffs for Leader Election ⋮ CADbots: algorithmic aspects of manipulating programmable matter with finite automata ⋮ Tilt assembly: algorithms for micro-factories that build objects with uniform external forces ⋮ Universal coating for programmable matter ⋮ Unnamed Item ⋮ 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 ⋮ Deterministic Leader Election in Programmable Matter ⋮ On the Runtime of Universal Coating for Programmable Matter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Local spreading algorithms for autonomous robot systems
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Computation in networks of passively mobile finite-state sensors
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation
- Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles
- On the convergence of the Hegselmann-Krause system
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID
- Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
- Distributed Computing by Mobile Robots: Gathering
- Distributed reconfiguration of metamorphic robot chains
- Parallel Computation Using Active Self-assembly
- A distributed algorithm for gathering many fat mobile robots in the plane
- On the computational power of oblivious robots
- Memory-efficient and self-stabilizing network RESET (extended abstract)
- On the computational power of DNA
This page was built for publication: Leader Election and Shape Formation with Self-organizing Programmable Matter
