arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2309.04898cs.DC
收藏

不公平对手下的能量约束可编程物质

Energy-Constrained Programmable Matter Under Unfair Adversaries

School of Computing and Augmented Intelligence, Arizona State University(亚利桑那州立大学计算与增强智能学院)

Jamison W. Weber, Tishya Chhabra, Andréa W. Richa, Joshua J. Daymude

AI总结:

针对可编程物质的阿米巴模型,提出一种通用能量分配框架,将能量无关算法转化为能量约束算法,在非公平对手下具有等价行为且运行时开销为O(n^2),并证明现有算法可兼容该框架。

摘要:

可编程物质的各个模块通过消耗能量执行动作来参与系统的集体行为。然而,并非所有模块都能访问为系统供电的外部能源,因此需要一种局部且分布式的策略来为模块提供能量。在这项工作中,我们为可编程物质的典型阿米巴模型提出了一种通用能量分配框架,该框架将能量无关算法转化为具有等价行为的能量约束算法,且运行时开销为$\mathcal{O}(n^2)$轮——即使面对不公平对手——只要原始算法满足特定约定。然后,我们证明了现有的用于领导者选举(ICDCN 2023)和形状形成(Distributed Computing, 2023)的阿米巴算法与该框架兼容,并展示了其能量约束版本的模拟,说明了如何将其他不公平算法相对轻松地推广到能量约束环境。最后,我们展示了我们的能量分配框架可以与阿米巴算法的并发控制框架(Distributed Computing, 2023)组合,使算法设计者能够专注于更简单的能量无关、顺序设置,同时获得能量约束、异步正确性的通用适用性。

英文摘要:

Individual modules of programmable matter participate in their system's collective behavior by expending energy to perform actions. However, not all modules may have access to the external energy source powering the system, necessitating a local and distributed strategy for supplying energy to modules. In this work, we present a general energy distribution framework for the canonical amoebot model of programmable matter that transforms energy-agnostic algorithms into energy-constrained ones with equivalent behavior and an $\mathcal{O}(n^2)$-round runtime overhead -- even under an unfair adversary -- provided the original algorithms satisfy certain conventions. We then prove that existing amoebot algorithms for leader election (ICDCN 2023) and shape formation (Distributed Computing, 2023) are compatible with this framework and show simulations of their energy-constrained counterparts, demonstrating how other unfair algorithms can be generalized to the energy-constrained setting with relatively little effort. Finally, we show that our energy distribution framework can be composed with the concurrency control framework for amoebot algorithms (Distributed Computing, 2023), allowing algorithm designers to focus on the simpler energy-agnostic, sequential setting but gain the general applicability of energy-constrained, asynchronous correctness.

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

↑