边加权网络中异构移动Agent的重命名
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks
摘要:
我们介绍了一个变种的确定性会合问题的一对异构代理在一个无向图,不同的时间,他们需要遍历特定的边缘的图形。每个代理都知道图的完整拓扑结构和两个代理的初始位置。代理也知道自己的遍历时间的所有边缘的图,但不知道相应的遍历时间的其他代理。代理的目标是在图的边缘或节点上相遇。在这种情况下,我们研究所需的时间,由代理人满足,相比,会议时间$T_{OPT}$在离线的情况下,代理人有完整的知识,对方的速度特性。当没有额外的假设,我们表明,在我们的模型中的会合时间$O(n T_{OPT})$后,可以实现在$n$节点图,这样的时间基本上是在某些情况下最好的可能。然而,我们证明了会合时间可以减少到$Θ(T_{OPT})$时,代理被允许交换$Θ(n)$位的信息在开始的会合过程。然后,我们表明,在一些自然的假设下的遍历时间的边缘,硬度的异构交会问题可以大大降低,无论是在所需的时间交会无通信,和通信复杂性实现交会时间$Θ(T_{OPT})$。
英文摘要:
We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal times for the other agent. The goal of the agents is to meet on an edge or a node of the graph. In this scenario, we study the time required by the agents to meet, compared to the meeting time $T_{OPT}$ in the offline scenario in which the agents have complete knowledge about each others speed characteristics. When no additional assumptions are made, we show that rendezvous in our model can be achieved after time $O(n T_{OPT})$ in a $n$-node graph, and that such time is essentially in some cases the best possible. However, we prove that the rendezvous time can be reduced to $Θ(T_{OPT})$ when the agents are allowed to exchange $Θ(n)$ bits of information at the start of the rendezvous process. We then show that under some natural assumption about the traversal times of edges, the hardness of the heterogeneous rendezvous problem can be substantially decreased, both in terms of time required for rendezvous without communication, and the communication complexity of achieving rendezvous in time $Θ(T_{OPT})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。