在有限无向网格上的已知动态点会合
Rendezvous on a Known Dynamic Point on a Finite Unoriented Grid
AI总结:
针对两个无坐标协议的OBLOT机器人在有限无向网格上,提出在动态资源点会合的算法,证明其时间最优性,并指出半同步调度下不可解。
摘要:
本文考虑了在完全同步的$\mathcal{OBLOT}$机器人模型下,两个机器人对坐标没有共同协议,它们通过位于角落的门顶点一个接一个地进入一个有限无向网格。存在一个资源,它可以与机器人同步地在网格中移动,直到它与至少一个机器人共处一地。假设机器人能够看到并识别该资源,我们考虑的问题是机器人必须在有限轮次内在该动态资源的位置会合。我们将此问题命名为“已知动态点会合”。在此,我们为两个机器人在动态资源位置聚集提供了一种算法。我们还为此问题提供了时间下界,并表明在资源在单个顶点上等待时间的特定假设下,所提出的算法是时间最优的。我们还证明了如果考虑半同步调度器,则无法解决此问题。
英文摘要:
In this paper, we have considered two fully synchronous $\mathcal{OBLOT}$ robots having no agreement on coordinates entering a finite unoriented grid through a door vertex at a corner, one by one. There is a resource that can move around the grid synchronously with the robots until it gets co-located along with at least one robot. Assuming the robots can see and identify the resource, we consider the problem where the robots must meet at the location of this dynamic resource within finite rounds. We name this problem "Rendezvous on a Known Dynamic Point". Here, we have provided an algorithm for the two robots to gather at the location of the dynamic resource. We have also provided a lower bound on time for this problem and showed that with certain assumption on the waiting time of the resource on a single vertex, the algorithm provided is time optimal. We have also shown that it is impossible to solve this problem if the scheduler considered is semi-synchronous.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。