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.Comment: Published in Proc. of DNA23: DNA Computing and Molecular Programming
- 23rd International Conference, 2017. An updated journal version will appear
in the DNA23 Special Issue of Natural Computin