Adaptive collective responses to local stimuli in anonymous dynamic networks

IF 0.9 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Shunhao Oh , Dana Randall , Andréa W. Richa
{"title":"Adaptive collective responses to local stimuli in anonymous dynamic networks","authors":"Shunhao Oh ,&nbsp;Dana Randall ,&nbsp;Andréa W. Richa","doi":"10.1016/j.tcs.2024.114904","DOIUrl":null,"url":null,"abstract":"<div><div>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 are represented by vertices in a dynamic graph <span><math><mi>G</mi></math></span> whose edge set changes over time, and stimuli are placed adversarially on the vertices of <span><math><mi>G</mi></math></span> where each agent is only capable of recognizing a co-located stimulus. Agents communicate via token passing along edges to alert other agents to transition to an <span>Aware</span> state when stimuli are present and an <span>Unaware</span> state when the stimuli disappear. We present an Adaptive Stimuli Algorithm that can handle arbitrary adversarial stimulus dynamics, while an adversary (or the agents themselves) reconfigures the connections (edges) of <span><math><mi>G</mi></math></span> over time in a controlled way. This algorithm can be used to solve the <em>foraging problem</em> on reconfigurable graphs where, in addition to food sources (stimuli) being discovered, removed, or shifted arbitrarily, 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 <em>gather phase</em> 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 collective phase change and switch to a <em>search phase</em> in which they distribute themselves randomly throughout the graph to search for food. Unlike previous approaches to foraging, this process is indefinitely repeatable, withstanding competing broadcast waves of state transition that may interfere with each other. Like a physical phase change, such as the ferromagnetic models underlying the gather and search algorithms used for foraging, microscopic changes in the environment trigger these macroscopic, system-wide transitions as agents share information and respond locally to get the desired collective response.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1024 ","pages":"Article 114904"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005218","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

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 are represented by vertices in a dynamic graph G whose edge set changes over time, and stimuli are placed adversarially on the vertices of G where each agent is only capable of recognizing a co-located stimulus. 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 can handle arbitrary adversarial stimulus dynamics, while an adversary (or the agents themselves) reconfigures the connections (edges) of G over time in a controlled way. This algorithm can be used to solve the foraging problem on reconfigurable graphs where, in addition to food sources (stimuli) being discovered, removed, or shifted arbitrarily, 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 collective phase change and switch to a search phase in which they distribute themselves randomly throughout the graph to search for food. Unlike previous approaches to foraging, this process is indefinitely repeatable, withstanding competing broadcast waves of state transition that may interfere with each other. Like a physical phase change, such as the ferromagnetic models underlying the gather and search algorithms used for foraging, microscopic changes in the environment trigger these macroscopic, system-wide transitions as agents share information and respond locally to get the desired collective response.
匿名动态网络中对局部刺激的自适应集体反应
我们为可编程物质中的自诱导相变开发了一个框架,在这个框架中,具有有限计算和通信能力的代理集合可以针对动态出现和消失的局部刺激,集体执行适当的全局任务。代理由动态图 G 中的顶点表示,G 的边集随着时间的推移而变化,刺激物以对抗方式放置在 G 的顶点上,每个代理只能识别一个同位置的刺激物。各代理通过沿边传递标记的方式进行通信,以提醒其他代理在刺激出现时过渡到 "感知 "状态,在刺激消失时过渡到 "不感知 "状态。我们提出了一种自适应刺激算法,它可以处理任意对抗性刺激动态,而对抗者(或代理本身)会随着时间的推移以可控的方式重新配置 G 的连接(边)。这种算法可用于解决可重构图上的觅食问题,在这种情况下,除了食物源(刺激物)会被发现、移除或任意移动外,我们还希望代理能够持续地进行自组织,只使用局部交互作用,这样,如果食物在某个位置停留的时间足够长,代理就会过渡到聚集阶段,在这个阶段,许多代理会共同形成一个单一的大分量,食物周围的分量较小。另一种情况是,如果最近没有食物来源,觅食者就会发生由自身引起的集体相变,转入搜索阶段,在整个图中随机分布,寻找食物。与以往的觅食方法不同,这一过程可无限期重复,并能抵御可能相互干扰的状态转换广播波。就像物理相变一样,例如用于觅食的聚集和搜索算法所依据的铁磁模型,环境中的微观变化会触发这些宏观的、全系统范围的转换,因为代理会共享信息并作出局部反应,以获得所需的集体响应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信