[论文解读] Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks

Shunhao Oh, Dana Randall+1 more|arXiv (Cornell University)|Jan 1, 2023

Modular Robots and Swarm Intelligence被引用 1

一句话总结

本文提出了一种稳健、自适应的算法，适用于匿名、动态网络，其中代理通过在本地感知刺激（如食物源）的响应下在“搜索”和“聚集”阶段之间切换，实现自我组织。通过令牌传递和受控的图重构，该算法即使在对抗性刺激动态和竞争消息波的影响下，也能确保在多项式时间内收敛至全局感知状态和α压缩聚类。

ABSTRACT

We develop a framework for self-induced phase changes in programmable matter in which a collection of agents with limited computational and communication capabilities can collectively perform appropriate global tasks in response to local stimuli that dynamically appear and disappear. Agents reside on graph vertices, where each stimulus is only recognized locally, and agents communicate via token passing along edges to alert other agents to transition to an Aware state when stimuli are present and an Unaware state when the stimuli disappear. We present an Adaptive Stimuli Algorithm that is robust to competing waves of messages as multiple stimuli change, possibly adversarially. Moreover, in addition to handling arbitrary stimulus dynamics, the algorithm can handle agents reconfiguring the connections (edges) of the graph over time in a controlled way. As an application, we show how this Adaptive Stimuli Algorithm on reconfigurable graphs can be used to solve the foraging problem, where food sources may be discovered, removed, or shifted at arbitrary times. We would like the agents to consistently self-organize, using only local interactions, such that if the food remains in a position long enough, the agents transition to a gather phase in which many collectively form a single large component with small perimeter around the food. Alternatively, if no food source has existed recently, the agents should undergo a self-induced phase change and switch to a search phase in which they distribute themselves randomly throughout the lattice region to search for food. Unlike previous approaches to foraging, this process is indefinitely repeatable, withstanding competing waves of messages that may interfere with each other. Like a physical phase change, microscopic changes such as the deletion or addition of a single food source trigger these macroscopic, system-wide transitions as agents share information about the environment and respond locally to get the desired collective response.

研究动机与目标

• 使可编程物质系统能够自主响应动态的、本地感知的刺激（如食物源或威胁）
• 设计一种分布式算法，在对抗性刺激动态和消息干扰下仍能保持全局状态一致性（感知/未感知）
• 仅通过本地交互和有限的代理能力，支持在搜索和聚集行为之间无限次切换
• 即使网络拓扑随时间变化，也能确保系统整体收敛至围绕活跃刺激的紧凑、低周长聚类
• 在匿名、动态且可重构网络的实际约束下，形式化并证明多项式时间收敛

提出的方法

• 代理在动态图上运行，其中顶点代表代理，边通过令牌传递实现本地通信
• 令牌传递机制在网络中传播对刺激的感知，当检测到刺激时，代理会进入“感知”状态
• 该算法维护一个状态不变量，确保在收敛后即使发生边重构，也不会有残留的代理仍处于未感知状态
• 代理移动遵循简单的排斥过程，建模为在三角形格子上的随机游走，以确保探索和收敛
• 系统使用分批时间间隔分析收敛性，每批的时间边界由 hitting 时间和几何随机变量确定
• 自适应 α-压缩算法确保在平稳状态下，聚类的周长可达到最小可能周长的 α 倍，且对任意 α > 1，以高概率实现

实验结果

研究问题

• RQ1 在存在对抗性刺激动态的情况下，匿名且计算能力有限的代理分布式系统是否能自组织进入全局‘聚集’阶段，当食物源出现时？
• RQ2 当所有刺激消失时，该系统如何稳健地切换回‘搜索’阶段，而不会留下持久的未感知状态残留？
• RQ3 在存在边重构和竞争消息波的情况下，对收敛时间和聚类紧凑性可提供何种保证？
• RQ4 系统能否仅通过本地交互和有限通信维持全局协调？
• RQ5 在单个食物源周围，达到低周长、α 压缩聚类的期望时间是多少？

主要发现

• 检测食物源并转换至感知状态的期望时间被限制在 O(N²n) 次迭代内，其中 N 是格子点数，n 是代理数量
• 每次收敛批次的期望持续时间最多为 2N²n + 2n + 1，确保了多项式时间收敛
• 在收敛后，代理仍保持未感知状态的概率被成功概率为 pY = 2/n(1 + 2/n) 的几何随机变量 stochastically dominated，导致未感知代理的期望存活时间统一上界为 2/3
• 由于压缩马尔可夫链的不可约性，系统在平稳状态下以高概率实现 α 压缩聚类，对任意 α > 1 成立
• 该算法对对抗性刺激动态和竞争消息波具有鲁棒性，支持在搜索和聚集模式之间无限次、可重复的阶段切换
• 只要感知代理的局部连通性得以保持，该框架即可支持动态边重构，确保持续协调