A stochastic approach to shortcut bridging in programmable matter

Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude, Dana Randall, Andrea Richa

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to solve system-wide problems of movement, coordination, and configuration. In this paper, we consider a stochastic, distributed, local, asynchronous algorithm for “shortcut bridging”, in which particles self-assemble bridges over gaps that simultaneously balance minimizing the length and cost of the bridge. Army ants of the genus Eciton have been observed exhibiting a similar behavior in their foraging trails, dynamically adjusting their bridges to satisfy an efficiency trade-off using local interactions. Using techniques from Markov chain analysis, we rigorously analyze our algorithm, show it achieves a near-optimal balance between the competing factors of path length and bridge cost, and prove that it exhibits a dependence on the angle of the gap being “shortcut” similar to that of the ant bridges. We also present simulation results that qualitatively compare our algorithm with the army ant bridging behavior. Our work gives a plausible explanation of how convergence to globally optimal configurations can be achieved via local interactions by simple organisms (e.g., ants) with some limited computational power and access to random bits. The proposed algorithm also demonstrates the robustness of the stochastic approach to algorithms for programmable matter, as it is a surprisingly simple extension of our previous stochastic algorithm for compression.

Original languageEnglish (US)
JournalNatural Computing
DOIs
StateAccepted/In press - Jan 1 2018

Fingerprint

Markov processes
Costs
Data storage equipment
Communication

Keywords

  • Bio-inspired algorithms
  • Distributed algorithms
  • Markov chains
  • Programmable matter
  • Self-organizing particle systems
  • Shortcut bridging

ASJC Scopus subject areas

  • Computer Science Applications

Cite this

A stochastic approach to shortcut bridging in programmable matter. / Andrés Arroyo, Marta; Cannon, Sarah; Daymude, Joshua J.; Randall, Dana; Richa, Andrea.

In: Natural Computing, 01.01.2018.

Research output: Contribution to journalArticle

Andrés Arroyo, Marta ; Cannon, Sarah ; Daymude, Joshua J. ; Randall, Dana ; Richa, Andrea. / A stochastic approach to shortcut bridging in programmable matter. In: Natural Computing. 2018.
@article{4d110fc1531345b299b47d8edadea656,
title = "A stochastic approach to shortcut bridging in programmable matter",
abstract = "In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to solve system-wide problems of movement, coordination, and configuration. In this paper, we consider a stochastic, distributed, local, asynchronous algorithm for “shortcut bridging”, in which particles self-assemble bridges over gaps that simultaneously balance minimizing the length and cost of the bridge. Army ants of the genus Eciton have been observed exhibiting a similar behavior in their foraging trails, dynamically adjusting their bridges to satisfy an efficiency trade-off using local interactions. Using techniques from Markov chain analysis, we rigorously analyze our algorithm, show it achieves a near-optimal balance between the competing factors of path length and bridge cost, and prove that it exhibits a dependence on the angle of the gap being “shortcut” similar to that of the ant bridges. We also present simulation results that qualitatively compare our algorithm with the army ant bridging behavior. Our work gives a plausible explanation of how convergence to globally optimal configurations can be achieved via local interactions by simple organisms (e.g., ants) with some limited computational power and access to random bits. The proposed algorithm also demonstrates the robustness of the stochastic approach to algorithms for programmable matter, as it is a surprisingly simple extension of our previous stochastic algorithm for compression.",
keywords = "Bio-inspired algorithms, Distributed algorithms, Markov chains, Programmable matter, Self-organizing particle systems, Shortcut bridging",
author = "{Andr{\'e}s Arroyo}, Marta and Sarah Cannon and Daymude, {Joshua J.} and Dana Randall and Andrea Richa",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/s11047-018-9714-x",
language = "English (US)",
journal = "Natural Computing",
issn = "1567-7818",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - A stochastic approach to shortcut bridging in programmable matter

AU - Andrés Arroyo, Marta

AU - Cannon, Sarah

AU - Daymude, Joshua J.

AU - Randall, Dana

AU - Richa, Andrea

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to solve system-wide problems of movement, coordination, and configuration. In this paper, we consider a stochastic, distributed, local, asynchronous algorithm for “shortcut bridging”, in which particles self-assemble bridges over gaps that simultaneously balance minimizing the length and cost of the bridge. Army ants of the genus Eciton have been observed exhibiting a similar behavior in their foraging trails, dynamically adjusting their bridges to satisfy an efficiency trade-off using local interactions. Using techniques from Markov chain analysis, we rigorously analyze our algorithm, show it achieves a near-optimal balance between the competing factors of path length and bridge cost, and prove that it exhibits a dependence on the angle of the gap being “shortcut” similar to that of the ant bridges. We also present simulation results that qualitatively compare our algorithm with the army ant bridging behavior. Our work gives a plausible explanation of how convergence to globally optimal configurations can be achieved via local interactions by simple organisms (e.g., ants) with some limited computational power and access to random bits. The proposed algorithm also demonstrates the robustness of the stochastic approach to algorithms for programmable matter, as it is a surprisingly simple extension of our previous stochastic algorithm for compression.

AB - In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to solve system-wide problems of movement, coordination, and configuration. In this paper, we consider a stochastic, distributed, local, asynchronous algorithm for “shortcut bridging”, in which particles self-assemble bridges over gaps that simultaneously balance minimizing the length and cost of the bridge. Army ants of the genus Eciton have been observed exhibiting a similar behavior in their foraging trails, dynamically adjusting their bridges to satisfy an efficiency trade-off using local interactions. Using techniques from Markov chain analysis, we rigorously analyze our algorithm, show it achieves a near-optimal balance between the competing factors of path length and bridge cost, and prove that it exhibits a dependence on the angle of the gap being “shortcut” similar to that of the ant bridges. We also present simulation results that qualitatively compare our algorithm with the army ant bridging behavior. Our work gives a plausible explanation of how convergence to globally optimal configurations can be achieved via local interactions by simple organisms (e.g., ants) with some limited computational power and access to random bits. The proposed algorithm also demonstrates the robustness of the stochastic approach to algorithms for programmable matter, as it is a surprisingly simple extension of our previous stochastic algorithm for compression.

KW - Bio-inspired algorithms

KW - Distributed algorithms

KW - Markov chains

KW - Programmable matter

KW - Self-organizing particle systems

KW - Shortcut bridging

UR - http://www.scopus.com/inward/record.url?scp=85054301946&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054301946&partnerID=8YFLogxK

U2 - 10.1007/s11047-018-9714-x

DO - 10.1007/s11047-018-9714-x

M3 - Article

JO - Natural Computing

JF - Natural Computing

SN - 1567-7818

ER -