凸形障碍物外的在线探索
Online exploration outside a convex obstacle
摘要:
守望者路径是一条使得某个区域中的每个点与路径上的某个点之间存在直接视线的路径。本文研究凸多边形外的在线守望者路径问题,即,在$\mathbb{R}^2\setminus Ω$中,其中$Ω$是事先未知凸多边形。我们提出了一个算法的多边形外的区域的探索。我们证明,所提出的算法保证了$\approx 22.77$的竞争比相比,最佳的离线守望者路径。
英文摘要:
A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem outside a convex polygon, i.e., in $\mathbb{R}^2\setminus Ω$, where $Ω$ is a convex polygon that is not known in advance. We present an algorithm for the exploration of the region outside the polygon. We prove that the presented algorithms guarantees a $\approx 22.77$ competitive ratio compared to the optimal offline watchman path.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。