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

最短路径计算的FastMap算法

The FastMap Algorithm for Shortest Path Computations

University of Southern California(南加州大学);University of California, Irvine(加利福尼亚大学尔湾分校)

Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar

摘要:

提出了一种新的预处理算法,用于将给定的边加权无向图的节点嵌入到欧氏空间中。这个空间中任意两个节点之间的欧几里得距离近似于给定图中它们之间的最短路径的长度。之后,在运行时,可以使用欧几里得距离作为启发式,使用A * 搜索来计算任何两个节点之间的最短路径。我们的预处理算法,称为FastMap,灵感来自同名的数据采掘算法,并在近线性时间内运行。因此,FastMap比使用半定规划产生欧几里得嵌入的竞争方法快几个数量级。FastMap还产生可接受的和一致的算法,因此保证了最短路径的生成。此外,FastMap适用于许多传统的启发式算法(如曼哈顿距离启发式算法)没有很好定义的一般无向图。从经验上讲,我们证明了使用FastMap启发式的A * 搜索与使用其他最先进的启发式算法(如差分启发式)的A * 搜索具有竞争力。

英文摘要:

We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in this space approximates the length of the shortest path between them in the given graph. Later, at runtime, a shortest path between any two nodes can be computed with A* search using the Euclidean distances as heuristic. Our preprocessing algorithm, called FastMap, is inspired by the data mining algorithm of the same name and runs in near-linear time. Hence, FastMap is orders of magnitude faster than competing approaches that produce a Euclidean embedding using Semidefinite Programming. FastMap also produces admissible and consistent heuristics and therefore guarantees the generation of shortest paths. Moreover, FastMap applies to general undirected graphs for which many traditional heuristics, such as the Manhattan Distance heuristic, are not well defined. Empirically, we demonstrate that A* search using the FastMap heuristic is competitive with A* search using other state-of-the-art heuristics, such as the Differential heuristic.

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

↑