arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.02367cs.DMcs.DS
收藏

在无线模型中从ell_p单元中疏散

Evacuating from ell_p Unit Disks in the Wireless Model

Konstantinos Georgiou, Sean Leizerovich, Jesse Lucier, Somnath Kundu

摘要:

Czyzowicz等人首先介绍并研究了无线模型中从(欧几里得)单位圆盘疏散2个机器人的搜索型问题。[DISC'2014]。从那时起,这个问题已经看到了一长串的后续结果有关的变化以及上下限的改进。所有已建立的结果在该地区研究这2维搜索型问题在欧几里德度量空间的搜索空间,即单位盘,享有显着的(度量)对称性。我们发起和研究的问题,疏散2机器人在无线模型中的$\ell_p$单位磁盘,$p \in [1,\infty)$,特别是机器人的移动测量在底层度量空间。据我们所知,这是第一次研究的搜索型问题与移动代理在更一般的度量空间。这个问题特别具有挑战性,因为甚至$\ell_p$单元盘的圆周也是技术研究的主题。在我们的主要结果中,在识别和利用$\ell_p$单位盘的非常少的对称性之后,我们设计了随$p$变化的\emph{optimal evacuation algorithms}。我们的主要技术贡献是双重的。首先,在我们的上限结果,我们提供(近)封闭的公式,我们的算法的最坏情况下的成本。第二,也是最重要的,我们的下限的论点减少到一个新的观察凸几何分析之间的权衡弧和弦长度的$\ell_p$单位磁盘作为端点的弧(弦)改变周围的磁盘的周边位置,我们相信这是有趣的。我们的部分论点有关的后一个属性依赖于计算机辅助数值验证,可以做非极端值的$p$。

英文摘要:

The search-type problem of evacuating 2 robots in the wireless model from the (Euclidean) unit disk was first introduced and studied by Czyzowicz et al. [DISC'2014]. Since then, the problem has seen a long list of follow-up results pertaining to variations as well as to upper and lower bound improvements. All established results in the area study this 2-dimensional search-type problem in the Euclidean metric space where the search space, i.e. the unit disk, enjoys significant (metric) symmetries. We initiate and study the problem of evacuating 2 robots in the wireless model from $\ell_p$ unit disks, $p \in [1,\infty)$, where in particular robots' moves are measured in the underlying metric space. To the best of our knowledge, this is the first study of a search-type problem with mobile agents in more general metric spaces. The problem is particularly challenging since even the circumference of the $\ell_p$ unit disks have been the subject of technical studies. In our main result, and after identifying and utilizing the very few symmetries of $\ell_p$ unit disks, we design \emph{optimal evacuation algorithms} that vary with $p$. Our main technical contributions are two-fold. First, in our upper bound results, we provide (nearly) closed formulae for the worst case cost of our algorithms. Second, and most importantly, our lower bounds' arguments reduce to a novel observation in convex geometry which analyzes trade-offs between arc and chord lengths of $\ell_p$ unit disks as the endpoints of the arcs (chords) change position around the perimeter of the disk, which we believe is interesting in its own right. Part of our argument pertaining to the latter property relies on a computer assisted numerical verification that can be done for non-extreme values of $p$.

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

↑