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

任意连通图中的确定性寻宝与会合

Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs

Debasish Pattanayak, Andrzej Pelc

AI总结:

本文研究节点度数可为可数无限的任意连通图,提出首个通用确定性寻宝算法并证明其时间最优,进而得到首个通用会合算法。

摘要:

寻宝和会合是移动智能体在图中执行的基本任务。在寻宝任务中,智能体必须找到位于图中某个未知节点上的惰性目标(称为宝藏)。在会合任务中,两个最初位于图中不同节点的智能体在同步轮次中遍历图的边,并且必须在某个节点相遇。我们假设图是连通的(否则这些任务都不可行),并研究确定性的寻宝和会合算法。寻宝算法的时间是指智能体在找到宝藏之前所执行边遍历次数的最坏情况值。会合算法的时间是指从较早被唤醒的智能体醒来开始,直到二者相遇为止所经历轮数的最坏情况值。据我们所知,所有已知的寻宝和会合算法都依赖于所有节点度数均为有限的这一假设,即使图本身可能是无限的。在本文中,我们首次去除了这一假设,并在节点既可能具有有限度数、也可能具有可数无限度数的任意连通图中考虑上述两项任务。我们的主要结果是首个适用于任意连通图的通用寻宝算法。我们证明,在所有适用于任意连通图的寻宝算法中,该算法的时间具有最优的数量级。作为这一结果的推论,我们得到了首个适用于任意连通图的通用会合算法。该算法的时间相对于一个在许多图中成立的下界而言是多项式的,尤其是在所有节点度数均为无限的树中。

英文摘要:

Treasure hunt and rendezvous are fundamental tasks performed by mobile agents in graphs. In treasure hunt, an agent has to find an inert target (called treasure) situated at an unknown node of the graph. In rendezvous, two agents, initially located at distinct nodes of the graph, traverse its edges in synchronous rounds and have to meet at some node. We assume that the graph is connected (otherwise none of these tasks is feasible) and consider deterministic treasure hunt and rendezvous algorithms. The time of a treasure hunt algorithm is the worst-case number of edge traversals performed by the agent until the treasure is found. The time of a rendezvous algorithm is the worst-case number of rounds since the wakeup of the earlier agent until the meeting. To the best of our knowledge, all known treasure hunt and rendezvous algorithms rely on the assumption that degrees of all nodes are finite, even when the graph itself may be infinite. In the present paper we remove this assumption for the first time, and consider both above tasks in arbitrary connected graphs whose nodes can have either finite or countably infinite degrees. Our main result is the first universal treasure hunt algorithm working for arbitrary connected graphs. We prove that the time of this algorithm has optimal order of magnitude among all possible treasure hunt algorithms working for arbitrary connected graphs. As a consequence of this result we obtain the first universal rendezvous algorithm working for arbitrary connected graphs. The time of this algorithm is polynomial in a lower bound holding in many graphs, in particular in the tree all of whose degrees are infinite.

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

↑