快速更新与建议
Fast Rendezvous with Advice
摘要:
在可能不同的时间从$n$节点网络的不同节点出发的两个移动代理必须在同一节点相遇。这个问题被称为会合。代理使用确定性算法在同步轮中移动。在每一轮中,代理决定保持空闲或移动到相邻节点之一。每个代理具有来自集合$\{1,...,L\}$的不同整数标签,它可以在算法的执行中使用该整数标签,但是它不知道其他代理的标签。如果$D$是智能体初始位置之间的距离,则$Ω(D)$是会合时间的明显下界。但是,如果每个代理除了其标签之外没有初始知识,则时间$O(D)$通常不可能实现。我们研究的最小量的信息,必须提供先验的代理,以实现会合在最佳时间$Θ(D)$。该信息在开始时由知道问题的整个实例的oracle提供给代理,即,网络、代理的起始位置、它们的唤醒回合以及它们的标签。oracle通过向代理提供称为advice的相同二进制字符串来帮助代理,代理可以在导航期间使用该字符串。这个字符串的长度称为通知的大小。我们的目标是找到最小规模的建议,使代理人满足时间$Θ(D)$。我们表明,这个最佳的建议大小是$Θ(D\log(n/D)+\log\log L)$。通过构造这种大小的建议字符串,并提供一个自然的会合算法,使用这个建议,在时间$Θ(D)$的所有网络的上限证明。匹配的下界,这是本文的主要贡献,证明了展示类的网络,它是不可能实现交会时间$Θ(D)$较小的意见。
英文摘要:
Two mobile agents, starting from different nodes of an $n$-node network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds using a deterministic algorithm. In each round, an agent decides to either remain idle or to move to one of the adjacent nodes. Each agent has a distinct integer label from the set $\{1,...,L\}$, which it can use in the execution of the algorithm, but it does not know the label of the other agent. If $D$ is the distance between the initial positions of the agents, then $Ω(D)$ is an obvious lower bound on the time of rendezvous. However, if each agent has no initial knowledge other than its label, time $O(D)$ is usually impossible to achieve. We study the minimum amount of information that has to be available a priori to the agents to achieve rendezvous in optimal time $Θ(D)$. This information is provided to the agents at the start by an oracle knowing the entire instance of the problem, i.e., the network, the starting positions of the agents, their wake-up rounds, and both of their labels. The oracle helps the agents by providing them with the same binary string called advice, which can be used by the agents during their navigation. The length of this string is called the size of advice. Our goal is to find the smallest size of advice which enables the agents to meet in time $Θ(D)$. We show that this optimal size of advice is $Θ(D\log(n/D)+\log\log L)$. The upper bound is proved by constructing an advice string of this size, and providing a natural rendezvous algorithm using this advice that works in time $Θ(D)$ for all networks. The matching lower bound, which is the main contribution of this paper, is proved by exhibiting classes of networks for which it is impossible to achieve rendezvous in time $Θ(D)$ with smaller advice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。