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

移动机器人算法的综合研究:以环形集合为例

On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering

Laure Millet, Maria Potop-Butucaru, Nathalie Sznajder, Sébastien Tixeuil

摘要:

分布式计算的最新进展:用于自主移动机器人群的强光模型和算法,这些机器人群能够自组织和协作以解决全局目标。到目前为止,绝大多数作品都考虑手工算法和正确性证明。本文是第一个提出一个正式的框架,自动设计分布式算法,致力于自主移动机器人在离散空间中发展。作为一个案例研究,我们考虑的问题,收集所有机器人在一个特定的位置,事先不知道。我们的贡献是三方面的。首先,我们提出了一个编码的收集问题作为一个可达性游戏。然后,我们自动生成一个最优的分布式算法,三个机器人进化的一个固定大小的均匀环。最后,我们通过归纳证明,所生成的算法也是正确的,除了当一个不可能的结果成立(即,当机器人的数量除以环的大小)。

英文摘要:

RecentadvancesinDistributedComputinghighlightmodelsandalgo- rithms for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms and correctness proofs. This paper is the first to propose a formal framework to automatically design dis- tributed algorithms that are dedicated to autonomous mobile robots evolving in a discrete space. As a case study, we consider the problem of gathering all robots at a particular location, not known beforehand. Our contribution is threefold. First, we propose an encoding of the gathering problem as a reachability game. Then, we automatically generate an optimal distributed algorithm for three robots evolv- ing on a fixed size uniform ring. Finally, we prove by induction that the generated algorithm is also correct for any ring size except when an impossibility result holds (that is, when the number of robots divides the ring size).

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

↑