arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.13044cs.DC
收藏

未知匿名图的确定性无碰撞探索

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs

Subhash Bhagat, Andrzej Pelc

AI总结:

研究两个相同移动代理在未知匿名无向图中的确定性无碰撞探索,证明半径2视野下可在多项式时间完成,而半径1视野下在直径2树中不可行。

摘要:

我们考虑网络探索这一基本任务。网络被建模为一个具有未标记节点的简单连通无向 n 节点图,并且任意度数为 d 的节点处的所有端口都被任意编号为 0,……,d-1。两个相同的移动代理最初位于不同的节点,每个代理都必须访问所有节点然后停止。代理执行相同的确定性算法,并在同步轮次中移动:在每一轮中,代理可以停留在同一节点,或移动到相邻节点。探索必须是无碰撞的:在每一轮中,任何节点上至多只能有一个代理。我们假设代理具有半径 2 的视野:位于节点 v 的一个清醒代理能够看到由与 v 距离至多为 2 的所有节点诱导出的子图,看到该子图中的所有端口号,以及位于这些节点上的代理。代理并不知道整个图,但知道其规模的一个上界 n。探索时间是指从较晚醒来的代理醒来到两个代理都终止所经历的轮次数。我们展示了一种无碰撞探索算法,对于规模大于 2 的任意图,其运行时间是 n 的多项式。此外,我们表明,如果代理只有半径 1 的视野,则无碰撞探索是不可能的,例如在任何直径为 2 的树中。

英文摘要:

We consider the fundamental task of network exploration. A network is modeled as a simple connected undirected n-node graph with unlabeled nodes, and all ports at any node of degree d are arbitrarily numbered 0,.....,d-1. Each of two identical mobile agents, initially situated at distinct nodes, has to visit all nodes and stop. Agents execute the same deterministic algorithm and move in synchronous rounds: in each round, an agent can either remain at the same node or move to an adjacent node. Exploration must be collision-free: in every round at most one agent can be at any node. We assume that agents have vision of radius 2: an awake agent situated at a node v can see the subgraph induced by all nodes at a distance at most 2 from v, sees all port numbers in this subgraph, and the agents located at these nodes. Agents do not know the entire graph but they know an upper bound n on its size. The time of an exploration is the number of rounds since the wakeup of the later agent to the termination by both agents. We show a collision-free exploration algorithm working in time polynomial in n, for arbitrary graphs of size larger than 2. Moreover, we show that if agents have only vision of radius 1, then collision-free exploration is impossible, e.g., in any tree of diameter 2.

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

↑