The foraging problem asks how a collective of particles with limited computational, communication and movement capabilities can autonomously compress around a food source and disperse when the food is depleted or shifted, which may occur at arbitrary times. We would like the particles to iteratively self-organize, using only local interactions, to correctly gather whenever a food particle remains in a position long enough and search if no food particle has existed recently. Unlike previous approaches, these search and gather phases should be self-induced so as to be indefinitely repeatable as the food evolves, with microscopic changes to the food triggering macroscopic, system-wide phase transitions. We present a stochastic foraging algorithm based on a phase change in the fixed magnetization Ising model from statistical physics: Our algorithm is the first to leverage self-induced phase changes as an algorithmic tool. A key component of our algorithm is a careful token passing mechanism ensuring a dispersion broadcast wave will always outpace a compression wave. We also present a highly structured alternative algorithm that gathers by incrementally building a spiral tightly wrapped around the food particle.
翻译:支离破碎问题问到,一个计算、通信和移动能力有限的粒子集聚在一起,在食物枯竭或转移时,如何在食物源周围自动压缩,在食物被消耗或转移时分散,这可能会在任意的时候发生。我们希望粒子能够反复自我组织,只使用局部互动,只要食物粒子处于足够长的位置,只要最近没有食物粒子存在,就可以正确收集。与以往的做法不同,这些搜索和收集阶段应该是自发的,以便随着食物的进化而无限期地重复出现,随着食物触发宏观、全系统阶段过渡的微微分变化。我们提出一种基于固定磁化模型从统计物理中逐渐变化的随机分析算法:我们的算法是首先利用自发阶段变化作为算法工具。我们算法的一个关键部分是谨慎的代号传递机制,确保分散广播波的传播速度总是超过压缩波。我们还提出了一个结构严密的替代算法,通过在食物粒子上逐步形成螺旋式的螺旋式。