不透明机器人的计算能力
Computational Power of Opaque Robots
AI总结:
本研究针对机器人群分布式计算领域此前仅研究透明机器人的局限,针对不可碰撞的不透明机器人研究12种经典模型的分类,通过6个见证问题证明大部分模型间的计算关系,并揭示视野受阻加异步场景下的特殊问题。
摘要:
在机器人群分布式计算领域,相关研究涵盖多种模型,其中机器人在欧几里得平面内通过一系列“观察-计算-移动”周期运行。所研究的模型因以下三点存在差异:(i)存储常量大小信息的能力,(ii)传递常量大小信息的能力,以及(iii)同步模式。通过调整特征(i)和(ii),可得到四种著名的基础模型:OBLOT(静默无记忆机器人)、FSTA(静默有限状态机器人)、FCOM(无记忆有限通信机器人)以及LUMI(有限状态有限通信机器人)。将每种基础模型与三种主要同步模式(全同步、半同步和异步)相结合,便得到了广为人知的12种模型。已有大量研究探讨了它们的计算能力,证明了不同模型间的层级关系。不过,此前研究仅考虑了透明机器人。在本研究中,我们针对不可碰撞的不透明机器人,研究了这12种模型的分类体系。我们提出了6个见证问题,证明了12种模型间的大部分计算关系。其中,最后一个见证问题揭示了在视野受阻且异步的情况下出现的一个特殊问题。
英文摘要:
In the field of distributed computing by robot swarms, the research comprehends manifold models where robots operate in the Euclidean plane through a sequence of look-compute-move cycles. Models under study differ for (i) the possibility of storing constant-size information, (ii) the possibility of communicating constant-size information, and (iii) the synchronization mode. By varying features (i,ii), we obtain the noted four base models: OBLOT (silent and oblivious robots), FSTA (silent and finite-state robots), FCOM (oblivious and finite-communication robots), and LUMI (finite-state and finite-communication robots). Combining each base model with the three main synchronization modes (fully synchronous, semi-synchronous, and asynchronous), we obtain the well-known 12 models. Extensive research has studied their computational power, proving the hierarchical relations between different models. However, only transparent robots have been considered. In this work, we study the taxonomy of the 12 models considering collision-intolerant opaque robots. We present six witness problems that prove the majority of the computational relations between the 12 models. In particular, the last witness problem depicts a peculiar issue occurring in the case of obstructed visibility and asynchrony.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。