A stochastic approach to shortcut bridging in programmable matter

DOI10.1007/978-3-319-66799-7_9zbMath1496.68145arXiv1709.02425OpenAlexW2745872868MaRDI QIDQ1694423

Dana Randall, Marta Andrés Arroyo, Joshua J. Daymude, Andréa W. Richa, Sarah M. Cannon

Publication date: 2 February 2018

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.02425

zbMATH Keywords

Markov chainsdistributed algorithmsbio-inspired algorithmsprogrammable matterself-organizing particle systemsshortcut bridging

Mathematics Subject Classification ID

Animal behavior (92D50) Distributed algorithms (68W15) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items

The canonical amoebot model: algorithms and concurrency control ⋮ A stochastic approach to shortcut bridging in programmable matter ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• Universal coating for programmable matter
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• A stochastic approach to shortcut bridging in programmable matter
• Improved mixing condition on the grid for counting and sampling independent sets
• Parallel computation using active self-assembly
• Computation in networks of passively mobile finite-state sensors
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• Distributed Computing by Mobile Robots: Gathering
• Improved Leader Election for Self-organizing Programmable Matter
• Distributed reconfiguration of metamorphic robot chains
• Phase Coexistence for the Hard-Core Model on ℤ²
• A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
• Monte Carlo sampling methods using Markov chains and their applications