未知图中距离感知移动代理的会合
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs
摘要:
我们研究了两个移动代理在未知图中的不同位置开始会合的问题。这些代理具有不同的标签,并以同步步骤行走。然而,该图是未标记的,并且代理没有标记图的节点的手段,并且在它们在节点处相遇之前不能彼此通信或看到彼此。当图非常大时,我们希望会合的时间与图的大小无关,并且仅取决于代理之间的初始距离和一些局部参数,例如顶点的度和代理标签的大小。众所周知,即使对于度为$Δ$的简单图,在最坏的情况下,会合时间在$Δ$中也可以是指数的。在本文中,我们介绍了一个新版本的会合问题的代理人配备了一个设备,测量其距离的其他代理后,每一步。我们表明,这些\emph{distance-aware}代理能够会合在任何未知的图形中,在时间多项式中的所有局部参数,如节点的程度,初始距离$D$和较小的两个代理标签$l = \min(l_1, l_2)$的大小。我们的算法的时间复杂度为$O(Δ(D+\log{l}))$,并且我们在我们的场景中的任何会合算法的时间复杂度上显示了几乎匹配的$Ω(Δ(D+\log{l}/\logΔ))$下限。此外,这个下限扩展了现有的一般交会问题的距离意识的下限。
英文摘要:
We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size and to depend only on the initial distance between the agents and some local parameters such as the degree of the vertices, and the size of the agent's label. It is well known that even for simple graphs of degree $Δ$, the rendezvous time can be exponential in $Δ$ in the worst case. In this paper, we introduce a new version of the rendezvous problem where the agents are equipped with a device that measures its distance to the other agent after every step. We show that these \emph{distance-aware} agents are able to rendezvous in any unknown graph, in time polynomial in all the local parameters such the degree of the nodes, the initial distance $D$ and the size of the smaller of the two agent labels $l = \min(l_1, l_2)$. Our algorithm has a time complexity of $O(Δ(D+\log{l}))$ and we show an almost matching lower bound of $Ω(Δ(D+\log{l}/\logΔ))$ on the time complexity of any rendezvous algorithm in our scenario. Further, this lower bound extends existing lower bounds for the general rendezvous problem without distance awareness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。