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

任意图中的几乎最优确定寻宝

Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs

Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

摘要:

一个移动代理沿着一个简单的连接图的边缘导航,有限或可数无限,必须找到一个惰性的目标(宝藏)隐藏在一个节点。这项任务被称为寻宝。智能体对图、宝藏的位置或到宝藏的初始距离没有先验知识。寻宝算法的成本是智能体在找到宝藏之前执行的最坏情况下的边遍历次数。Awerbuch,Betke,Rivest和Singh [3]考虑了有限图的图探索和寻宝,在受限模型中,代理有一个燃料箱,只能在起始节点$s$补充。对于某个正实常数$α$,水箱的大小为$B=2(1+α)r$,其中$r$称为图的半径,是从$s$到任何其他节点的最大距离。大小为$B$的槽允许代理在节点$s$处的两次连续访问之间进行至多$\lfloor B\rfloor$边缘遍历。令$e(d)$为至少一个端点距$s$的距离小于$d$的边的数目。Awerbuch、Betke、Rivest和Singh [3]指出,在$e(d)$中,不可能以接近线性的代价找到隐藏在最多$d$距离的节点中的宝藏。我们首先设计了一个确定性的寻宝算法在模型中工作,没有任何限制的移动代理成本$\mathcal{O}(e(d) \log d)$,然后展示了如何修改这个算法工作在模型中从[3]具有相同的复杂性。因此,我们驳斥了上述20年前的猜想。我们观察到,没有寻宝算法可以击败成本$Θ(e(d))$的所有图,因此我们的算法也几乎是最优的。

英文摘要:

A mobile agent navigating along edges of a simple connected graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task is known as treasure hunt. The agent has no a priori knowledge of the graph, of the location of the treasure or of the initial distance to it. The cost of a treasure hunt algorithm is the worst-case number of edge traversals performed by the agent until finding the treasure. Awerbuch, Betke, Rivest and Singh [3] considered graph exploration and treasure hunt for finite graphs in a restricted model where the agent has a fuel tank that can be replenished only at the starting node $s$. The size of the tank is $B=2(1+α)r$, for some positive real constant $α$, where $r$, called the radius of the graph, is the maximum distance from $s$ to any other node. The tank of size $B$ allows the agent to make at most $\lfloor B\rfloor$ edge traversals between two consecutive visits at node $s$. Let $e(d)$ be the number of edges whose at least one extremity is at distance less than $d$ from $s$. Awerbuch, Betke, Rivest and Singh [3] conjectured that it is impossible to find a treasure hidden in a node at distance at most $d$ at cost nearly linear in $e(d)$. We first design a deterministic treasure hunt algorithm working in the model without any restrictions on the moves of the agent at cost $\mathcal{O}(e(d) \log d)$, and then show how to modify this algorithm to work in the model from [3] with the same complexity. Thus we refute the above twenty-year-old conjecture. We observe that no treasure hunt algorithm can beat cost $Θ(e(d))$ for all graphs and thus our algorithms are also almost optimal.

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

↑