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

瞬态障碍物间的直线最短路径

Rectilinear Shortest Paths Among Transient Obstacles

Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack

摘要:

提出了一种求解$n$瞬态直线障碍物间时间最小直线路径的最优$Θ(n \log n)$算法。如果障碍物仅在特定时间间隔内存在于场景中,则该障碍物是瞬时的,即,它在特定的时间出现然后消失。给定一个点机器人以有界速度在瞬时直线障碍物之间运动,一对点$s$,$d$,我们确定一个时间最小的,从$s$到$d$的避障路径。解决这个问题的主要挑战是机器人可能需要等待障碍物消失,然后才能继续向目的地移动。我们的算法建立在连续的Dijkstra范式,它模拟从源点传播波前。我们还解决了这个问题的查询版本。为此,我们建立了一个平面细分相对于一个固定的源点,使最小到达时间的任何查询点可以报告在$O(\log n)$时间,使用点定位的查询点在此细分。

英文摘要:

This paper presents an optimal $Θ(n \log n)$ algorithm for determining time-minimal rectilinear paths among $n$ transient rectilinear obstacles. An obstacle is transient if it exists in the scene only for a specific time interval, i.e., it appears and then disappears at specific times. Given a point robot moving with bounded speed among transient rectilinear obstacles and a pair of points $s$, $d$, we determine a time-minimal, obstacle-avoiding path from $s$ to $d$. The main challenge in solving this problem arises as the robot may be required to wait for an obstacle to disappear, before it can continue moving toward the destination. Our algorithm builds on the continuous Dijkstra paradigm, which simulates propagating a wavefront from the source point. We also solve a query version of this problem. For this, we build a planar subdivision with respect to a fixed source point, so that minimum arrival time to any query point can be reported in $O(\log n)$ time, using point location for the query point in this subdivision.

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

↑