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

论能量受限移动机器人的计算能力:算法与跨模型分析

On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis

Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada

AI总结:

本文研究能量受限(但可再生)移动机器人的计算能力,通过跨模型分析发现LUMI模型下能量受限与不受限机器人计算能力无差异,而在其他模型中能量约束反而带来计算优势。

摘要:

我们考虑由相同的自主计算实体(称为机器人)组成的分布式系统,它们在平面上以同步的 Look-Compute-Move (LCM) 周期移动和运行。文献中已在四种不同模型(OBLOT、FSTA、FCOM、LUMI)下广泛研究了这些系统的算法能力,每种模型界定了机器人不同的记忆持久性和通信能力水平。尽管存在差异,它们都始终假设机器人拥有无限的能量。在本文中,我们移除这一假设,开始研究能量受限(尽管可再生)的机器人的计算能力。我们首先研究记忆持久性和通信能力对此类能量受限机器人系统计算能力的影响;我们通过分析在此能量约束下四个模型之间的计算关系来实现这一点。我们提供了这种关系的完整刻画。接着,我们研究能量限制引起的计算能力差异,并提供每个模型下能量受限与不受限机器人之间关系的完整刻画。我们证明在 LUMI 模型中没有差异;证明的核心部分是设计并分析了一种算法,该算法在 LUMI 中允许能量受限机器人正确执行任何为无限能量机器人设计的协议。随后我们展示了(看似反直觉的)结果:在所有其他模型中,能量约束实际上为机器人提供了计算优势。

英文摘要:

We consider distributed systems of identical autonomous computational entities, called robots, moving and operating in the plane in synchronous Look-Compute-Move (LCM) cycles. The algorithmic capabilities of these systems have been extensively investigated in the literature under four distinct models (OBLOT, FSTA, FCOM, LUMI), each identifying different levels of memory persistence and communication capabilities of the robots. Despite their differences, they all always assume that robots have unlimited amounts of energy. In this paper, we remove this assumption and start the study of the computational capabilities of robots whose energy is limited, albeit renewable. We first study the impact that memory persistence and communication capabilities have on the computational power of such energy-constrained systems of robots; we do so by analyzing the computational relationship between the four models under this energy constraint. We provide a complete characterization of this relationship. We then study the difference in computational power caused by the energy restriction and provide a complete characterization of the relationship between energy-constrained and unrestricted robots in each model. We prove that within LUMI there is no difference; an integral part of the proof is the design and analysis of an algorithm that in LUMI allows energy-constrained robots to execute correctly any protocol for robots with unlimited energy. We then show the (apparently counterintuitive) result that in all other models, the energy constraint actually provides the robots with a computational advantage.

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

↑