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.

翻译：摘要：本文考虑了两个完全同步的$\mathcal{OBLOT}$机器人在无坐标共识条件下，通过角落处的入口顶点依次进入一个有限无向网格的场景。存在一个资源，该资源可与机器人同步在网格内移动，直至与至少一个机器人共处同一位置。假设机器人能够感知并识别该资源，我们探讨了机器人需在有限回合内于该动态资源位置相遇的问题，并将其命名为“已知动态点汇合问题”。本文提出了一种使两个机器人在动态资源位置聚集的算法，同时给出了该问题的时间下界，并证明在资源单顶点等待时间的特定假设下，所提算法在时间上达到最优。此外，我们还证明若采用半同步调度器，则该问题无法解决。