使用Pebbles在图中寻宝
Treasure Hunt in Graph using Pebbles
摘要:
在本文中,我们研究了寻宝问题在一个图中的移动代理。图$G=(V,E)$中的节点是匿名的,并且与度为$deg(v)$的顶点$v\in V$关联的边被任意标记为$0,1,\ldots, deg(v)-1$。在$G$中的节点$t$处,定位被称为{ \it宝藏}的静止对象。最初位于$G$中的节点$s$的移动代理,即代理的起始点,必须通过到达节点$t$来找到宝藏。从$s$到$t$的距离是$D$。找到宝藏所需的{ \it时间}是代理在找到宝藏之前访问的边总数。代理人没有任何关于图或宝藏位置的先验知识。一个知道图、代理人的初始位置和宝藏位置的预言家在图的节点上放置一些鹅卵石,每个节点最多一个鹅卵石,以引导代理人走向宝藏。本文旨在研究提供的鹅卵石数量和寻找宝藏所需时间之间的权衡。具体来说,我们的目标是回答以下问题。``如果放置$k$鹅卵石,在具有最大度$Δ$和直径$D$的图中寻宝的最短时间是多少?“我们回答上述问题时,$k<D$或$k=cD$为某个正整数$c$。我们设计了有效的算法的代理不同的$k$值。我们还提出了一个几乎匹配的下限结果$k<D$。
英文摘要:
In this paper, we study the treasure hunt problem in a graph by a mobile agent. The nodes in the graph $G=(V,E)$ are anonymous and the edges incident to a vertex $v\in V$ whose degree is $deg(v)$ are labeled arbitrarily as $0,1,\ldots, deg(v)-1$. At a node $t$ in $G$ a stationary object, called {\it treasure} is located. The mobile agent that is initially located at a node $s$ in $G$, the starting point of the agent, must find the treasure by reaching the node $t$. The distance from $s$ to $t$ is $D$. The {\it time} required to find the treasure is the total number of edges the agent visits before it finds the treasure. The agent does not have any prior knowledge about the graph or the position of the treasure. An oracle, that knows the graph, the initial position of the agent, and the position of the treasure, places some pebbles on the nodes, at most one per node, of the graph to guide the agent towards the treasure. This paper aims to study the trade-off between the number of pebbles provided and the time required to find the treasure. To be specific, we aim to answer the following question. ``What is the minimum time for treasure hunt in a graph with maximum degree $Δ$ and diameter $D$ if $k$ pebbles are placed? " We answer the above question when $k<D$ or $k=cD$ for some positive integer $c$. We design efficient algorithms for the agent for different values of $k$. We also propose an almost matching lower bound result for $k<D$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。