arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.19490cs.DM
收藏

圆盘上的加权组搜索及优先疏散的改进下界

Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation

Konstantinos Georgiou, Xin Wang

AI总结:

研究圆盘上两智能体的加权组搜索问题,通过基于线性规划的新颖框架推导出所有加权平均的下界,并将优先疏散问题的下界从4.38962提升至4.56798,显著缩小了上下界差距。

摘要:

我们考虑圆盘上的加权组搜索,这是一个涉及2个单位速度移动智能体的搜索类问题。两个智能体从同位置出发,目标是到达位于未知位置且已知距离恰好为1的隐藏目标(即搜索域为单位圆盘)。智能体在所谓的无线模型中运行,该模型允许它们瞬间获知彼此的发现。智能体轨迹的终止成本是到达目标所需时间的算术加权平均的最坏情况,我们用参数 $w$ 来量化它,这也是问题名称的由来。我们的工作延续了搜索与疏散领域的长期研究,但重要的是,它是两个被充分研究的问题的变体和扩展。已知的变体是搜索域为直线的情形,且已知其最优解。我们的问题也是所谓优先疏散的扩展,后者可通过将权重参数 $w$ 设为 $0$ 得到。对于后者,已知的最佳上/下界差距很大。我们对圆盘加权组搜索的贡献有三方面。首先,我们推导了整个加权平均 $w$ 谱系的上界。我们的算法是已知技术的改编,但分析更具技术性。其次,我们的主要贡献是推导了所有加权平均的下界。这源于一个基于线性规划并受度量嵌入松弛启发的新颖框架,用于证明组合搜索问题的下界。第三,我们将该框架应用于优先疏散问题,将先前已知的最佳下界从 $4.38962$ 提升至 $4.56798$,从而将上/下界差距从 $0.42892$ 缩小至 $0.25056$。

英文摘要:

We consider \emph{weighted group search on a disk}, which is a search-type problem involving 2 mobile agents with unit-speed. The two agents start collocated and their goal is to reach a (hidden) target at an unknown location and a known distance of exactly 1 (i.e., the search domain is the unit disk). The agents operate in the so-called \emph{wireless} model that allows them instantaneous knowledge of each others findings. The termination cost of agents' trajectories is the worst-case \emph{arithmetic weighted average}, which we quantify by parameter $w$, of the times it takes each agent to reach the target, hence the name of the problem. Our work follows a long line of research in search and evacuation, but quite importantly it is a variation and extension of two well-studied problems, respectively. The known variant is the one in which the search domain is the line, and for which an optimal solution is known. Our problem is also the extension of the so-called \emph{priority evacuation}, which we obtain by setting the weight parameter $w$ to $0$. For the latter problem the best upper/lower bound gap known is significant. Our contributions for weighted group search on a disk are threefold. \textit{First}, we derive upper bounds for the entire spectrum of weighted averages $w$. Our algorithms are obtained as a adaptations of known techniques, however the analysis is much more technical. \textit{Second}, our main contribution is the derivation of lower bounds for all weighted averages. This follows from a \emph{novel framework} for proving lower bounds for combinatorial search problems based on linear programming and inspired by metric embedding relaxations. \textit{Third}, we apply our framework to the priority evacuation problem, improving the previously best lower bound known from $4.38962$ to $4.56798$, thus reducing the upper/lower bound gap from $0.42892$ to $0.25056$.

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

↑