arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.02425cs.DC
收藏

可编程物质中的随机桥接方法

A Stochastic Approach to Shortcut Bridging in Programmable Matter

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

摘要:

在自组织粒子系统中,可编程物质的抽象,称为粒子的简单计算元素具有有限的内存和通信自组织,以解决系统范围内的运动,协调和配置问题。在本文中,我们考虑了一个随机的,分布式的,本地的,异步算法的“捷径桥接”,其中粒子自组装桥梁的差距,同时平衡最小化的长度和成本的桥梁。已观察到的属Eciton的行军蚁表现出类似的行为,在他们的觅食路径,动态调整他们的桥梁,以满足效率的权衡使用本地的相互作用。使用马尔可夫链分析技术,我们严格分析了我们的算法,表明它在路径长度和桥梁成本等竞争因素之间实现了近乎最佳的平衡,并证明它对间隙角度的依赖性类似于“捷径”。蚂蚁桥。我们还提出了模拟结果,定性比较我们的算法与军队蚂蚁桥接行为。我们的工作给出了一个合理的解释,即如何通过简单生物体的局部相互作用(例如,蚂蚁)具有有限的计算能力和对随机比特的访问。所提出的算法还证明了可编程物质的算法的随机方法的鲁棒性,因为它是一个令人惊讶的简单扩展我们以前的随机算法压缩。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑