线上搜索和$m$射线上搜索的通用框架
Towards a General Framework for Searching on a Line and Searching on $m$ Rays
摘要:
考虑以下经典搜索问题:给定目标点$p\in \Re$,从原点开始,找到具有最小成本的$p$,其中成本被定义为行进的距离。令$D$为$p$到原点的距离。当没有给出$D$的下界时,不存在竞争搜索策略。Demaine,Fekete和Gal(在线搜索与回合成本,Theor。Comput.科学,361(2-3):342-355,2006)考虑了没有给出$D$的下限,但是固定的\emph{turn cost} $t>0$在每次方向改变时被充电的情况。当总成本表示为$c D+ϕ$时,其中$c$和$ϕ$是正常数,他们表明,如果$c$设置为$9$,则最佳搜索策略的成本为$9D+2t$。虽然他们的策略是最佳的$c=9$,我们证明了他们的框架中的最小成本是$5D+t+2\sqrt{2D(2D+t)} < 9D+2t$。请注意,最低成本需要$D$的知识。然而,给定$D$,最优策略具有较小的$3D+t$成本。因此,这个问题不能最佳地解决,并准确地$D$上没有给出下限。为了解决这个问题,我们引入了一个通用的框架,其中移动距离$x$远离原点的成本是$α_1 x+β_1$和移动距离$y$朝向原点的成本是$α_2 y+β_2$常数$α_1,α_2,β_1,β_2$。给定$D$上的一个下界$λ$,当$α_1,α_2,β_1,β_2 \geq 0$和$α_1+α_2 > 0$ .最后,我们解决的问题,寻找一个目标躺在$m$射线从原点延伸的成本是衡量的总距离加上$t \geq 0$倍的转弯数。我们提供了一个搜索策略,并计算其成本。我们证明了我们的策略是最佳的$t$的小值和猜想,它总是最佳的。
英文摘要:
Consider the following classical search problem: given a target point $p\in \Re$, starting at the origin, find $p$ with minimum cost, where cost is defined as the distance travelled. Let $D$ be the distance of $p$ from the origin. When no lower bound on $D$ is given, no competitive search strategy exists. Demaine, Fekete and Gal (Online searching with turn cost, Theor. Comput. Sci., 361(2-3):342-355, 2006) considered the situation where no lower bound on $D$ is given but a fixed \emph{turn cost} $t>0$ is charged every time the searcher changes direction. When the total cost is expressed as $c D+ϕ$, where $c$ and $ϕ$ are positive constants, they showed that if $c$ is set to $9$, then the optimal search strategy has a cost of $9D+2t$. Although their strategy is optimal for $c=9$, we prove that the minimum cost in their framework is $5D+t+2\sqrt{2D(2D+t)} < 9D+2t$. Note that the minimum cost requires knowledge of $D$. However, given $D$, the optimal strategy has a smaller cost of $3D+t$. Therefore, this problem cannot be solved optimally and exactly when no lower bound on $D$ is given. To resolve this issue, we introduce a general framework where the cost of moving distance $x$ away from the origin is $α_1 x+β_1$ and the cost of moving distance $y$ towards the origin is $α_2 y+β_2$ for constants $α_1,α_2,β_1,β_2$. Given a lower bound $λ$ on $D$, we provide a provably optimal competitive search strategy when $α_1,α_2,β_1,β_2 \geq 0$ and $α_1+α_2 > 0$. Finally, we address the problem of searching for a target lying on one of $m$ rays extending from the origin where the cost is measured as the total distance travelled plus $t \geq 0$ times the number of turns. We provide a search strategy and compute its cost. We prove our strategy is optimal for small values of $t$ and conjecture it is always optimal.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。