arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1808.04043cs.AI
收藏

基于网格的障碍物k-近邻快速鲁棒算法

Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

Monash University(莫纳什大学)

Shizhe Zhao, Daniel D. Harabor, David Taniar

摘要:

我们感兴趣的问题,找到$k$最近的邻居在平面上,并在多边形障碍物($\textit{OkNN}$)的存在。广泛使用的OkNN算法基于增量可见性图,这意味着它们需要昂贵的在线可见性检查,并且具有最坏情况下的二次运行时间。最近$\mathbf{Polyanya}$提出了一种快速的点到点路径查找算法,该算法通过在称为导航网格的替代数据结构上搜索来避免可见性图的缺点。以前,我们通过开发两个专门的启发式函数:$\mathbf{Interval heuristic}$ $h_v$和$\mathbf{Target heuristic}$ $h_t$,使$\mathbf{Polyanya}$适应多目标场景。虽然这些方法优于可见性图算法的数量级,在我们所有的实验中,他们是不健全的:$h_v$扩展许多冗余节点时,邻居集是小的,而$h_t$表现不佳时,邻居集是大的。在本文中,我们提出了OkNN的新算法和算法,无论邻居密度如何,它们都表现良好。

英文摘要:

We are interested in the problem of finding $k$ nearest neighbours in the plane and in the presence of polygonal obstacles ($\textit{OkNN}$). Widely used algorithms for OkNN are based on incremental visibility graphs, which means they require costly and online visibility checking and have worst-case quadratic running time. Recently $\mathbf{Polyanya}$, a fast point-to-point pathfinding algorithm was proposed which avoids the disadvantages of visibility graphs by searching over an alternative data structure known as a navigation mesh. Previously, we adapted $\mathbf{Polyanya}$ to multi-target scenarios by developing two specialised heuristic functions: the $\mathbf{Interval heuristic}$ $h_v$ and the $\mathbf{Target heuristic}$ $h_t$. Though these methods outperform visibility graph algorithms by orders of magnitude in all our experiments they are not robust: $h_v$ expands many redundant nodes when the set of neighbours is small while $h_t$ performs poorly when the set of neighbours is large. In this paper, we propose new algorithms and heuristics for OkNN which perform well regardless of neighbour density.

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

↑