高度动态环境中的自稳定机器人
Self-Stabilizing Robots in Highly Dynamic Environments
摘要：
本文讨论了一组同步机器人探索环的经典问题。我们专注于这个问题的永久版本中，它需要环的每个节点是由一个机器人无限经常访问。本文的挑战是双重的。首先，我们假设机器人在一个高度动态的环中进化，\ie边的出现和消失是不可预测的，没有任何递归性、周期性和稳定性假设。我们所做的唯一假设（称为时间连通性假设）是每个节点都可以从任何其他节点无限次到达。其次，我们的目标是提供一个自稳定算法的机器人，即，该算法必须保证一个最终的正确行为，无论初始状态和位置的机器人。在这种恶劣的环境中，我们的贡献是充分的特点，为每个大小的环，必要的和足够的机器人数量来解决确定性的问题。
英文摘要：
This paper deals with the classical problem of exploring a ring by a cohort of synchronous robots. We focus on the perpetual version of this problem in which it is required that each node of the ring is visited by a robot infinitely often. The challenge in this paper is twofold. First, we assume that the robots evolve in a highly dynamic ring, \ie edges may appear and disappear unpredictably without any recurrence, periodicity, nor stability assumption. The only assumption we made (known as temporal connectivity assumption) is that each node is infinitely often reachable from any other node. Second, we aim at providing a self-stabilizing algorithm to the robots, i.e., the algorithm must guarantee an eventual correct behavior regardless of the initial state and positions of the robots.In this harsh environment, our contribution is to fully characterize, for each size of the ring, the necessary and sufficient number of robots to solve deterministically the problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
