半直线上的概率模糊搜索
Probabilistically Faulty Searching on a Half-Line
摘要:
我们研究了$p$ -Fastenet搜索,经典的奶牛路径优化问题的一个变种,其中一个单位速度的机器人搜索半行(或$1$ -射线)的隐藏项目。该方法在概率上是错误的,并且每次访问的项目检测是一个独立的伯努利试验,其成功概率$p$是已知的。目标是最小化最坏情况下的预期检测时间,相对于隐藏项到原点的距离。Gal在1980年首次提出了同一问题的一个变体。然后在2003年,Alpern和Gal [The Theory of Search Games and Renewal]提出了一种所谓的单调解决方案来搜索线($2$ -rays);也就是说,在每条射线和每次迭代中,新搜索的空间单调增加的轨迹。此外,他们还证明了$2$射线问题的最佳轨迹必须是单调的。当搜索域为半直线($1$ -射线)时,我们证明了这个猜想是错误的。我们为所有单调算法提供了一个下界,我们也匹配一个上界。我们的主要贡献是设计和分析的一系列细化搜索策略,家庭以外的单调算法,我们称之为$t$ -子单调算法。这样的算法导致性能随着$t$和所有$p \in (0,1)$而严格下降。$t$的值在某种意义上量化了我们的算法偏离单调性的程度,表明单调算法在搜索半线时是次优的。
英文摘要:
We study $p$-Faulty Search, a variant of the classic cow-path optimization problem, where a unit speed robot searches the half-line (or $1$-ray) for a hidden item. The searcher is probabilistically faulty, and detection of the item with each visitation is an independent Bernoulli trial whose probability of success $p$ is known. The objective is to minimize the worst case expected detection time, relative to the distance of the hidden item to the origin. A variation of the same problem was first proposed by Gal in 1980. Then in 2003, Alpern and Gal [The Theory of Search Games and Rendezvous] proposed a so-called monotone solution for searching the line ($2$-rays); that is, a trajectory in which the newly searched space increases monotonically in each ray and in each iteration. Moreover, they conjectured that an optimal trajectory for the $2$-rays problem must be monotone. We disprove this conjecture when the search domain is the half-line ($1$-ray). We provide a lower bound for all monotone algorithms, which we also match with an upper bound. Our main contribution is the design and analysis of a sequence of refined search strategies, outside the family of monotone algorithms, which we call $t$-sub-monotone algorithms. Such algorithms induce performance that is strictly decreasing with $t$, and for all $p \in (0,1)$. The value of $t$ quantifies, in a certain sense, how much our algorithms deviate from being monotone, demonstrating that monotone algorithms are sub-optimal when searching the half-line.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。