arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.12976cs.DScs.DC
收藏

有标号线中的快速确定性相会

Fast Deterministic Rendezvous in Labeled Lines

Avery Miller, Andrzej Pelc

AI总结:

研究无限有标号路径中的确定性分布式相会问题,针对三种初始信息已知程度递减的场景分别提出了最优或近最优的相会算法,其核心方法是基于LOCAL模型快速着色与相会问题的双向归约。

摘要:

两个移动智能体从被建模为图的网络的不同节点出发,并可能在不同的时间被唤醒,它们必须在同一个节点相遇。这个问题被称为相会(rendezvous)。我们考虑无限路径中的确定性分布式相会问题。每个节点都有一个不同的标签,该标签是一个正整数。相会时间是指从较早智能体的起始轮次算起,直到相遇所经过的轮数。我们考虑三种场景。在第一种场景中,每个智能体知道自己在该线中的位置,即每个智能体知道自己与最小标签节点的初始距离、自己位于该节点的哪一侧,以及朝向该节点的方向。针对这种场景,我们给出了一个运行时间为 $O(D)$ 的相会算法,其中 $D$ 是智能体之间的初始距离。这个复杂度显然是最优的。在第二种场景中,每个智能体最初只知道其起始节点的标签以及智能体之间的初始距离 $D$。在这种场景下,我们给出了一个运行时间为 $O(D\log^*\ell)$ 的相会算法,其中 $\ell$ 是起始节点中较大的标签。我们证明了匹配的下界 $\Omega(D\log^*\ell)$。最后,在最一般的场景中,每个智能体最初只知道其起始节点的标签,我们给出了一个运行时间为 $O(D^2(\log^*\ell)^3)$ 的相会算法,该复杂度至多是下界的立方。我们所有的结果(经过少量修改)对于任意有限路径和环依然成立。我们的算法远优于使用图探索的方法,后者的运行时间取决于图的大小或直径。我们的主要方法论工具,也是本文的主要创新点,是一个双向归约:从在 LOCAL 模型中使用常数颜色对无限有标号路径进行快速着色,归约到该路径中的快速相会,反之亦然。

英文摘要:

Two mobile agents, starting from different nodes of a network modeled as a graph, and woken up at possibly different times, have to meet at the same node. This problem is known as rendezvous. We consider deterministic distributed rendezvous in the infinite path. Each node has a distinct label which is a positive integer. The time of rendezvous is the number of rounds until meeting, counted from the starting round of the earlier agent. We consider three scenarios. In the first scenario, each agent knows its position in the line, i.e., each of them knows its initial distance from the smallest-labeled node, on which side of this node it is located, and the direction towards it. For this scenario, we give a rendezvous algorithm working in time $O(D)$, where $D$ is the initial distance between the agents. This complexity is clearly optimal. In the second scenario, each agent initially knows only the label of its starting node and the initial distance $D$ between the agents. In this scenario, we give a rendezvous algorithm working in time $O(D\log^*\ell)$, where $\ell$ is the larger label of the starting nodes. We prove a matching lower bound $Ω(D\log^*\ell)$. Finally, in the most general scenario, where each agent initially knows only the label of its starting node, we give a rendezvous algorithm working in time $O(D^2(\log^*\ell)^3)$, which is at most cubic in the lower bound. All our results remain valid (with small changes) for arbitrary finite paths and for cycles. Our algorithms are drastically better than approaches that use graph exploration, whose running times depend on the graph's size or diameter. Our main methodological tool, and the main novelty of the paper, is a two way reduction: from fast colouring of the infinite labeled path using a constant number of colours in the LOCAL model to fast rendezvous in this path, and vice-versa.

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

↑