基于边层次的多层次路径规划
More Hierarchy in Route Planning Using Edge Hierarchies
摘要：
在网络（特别是道路网络）中进行路线规划的一个非常成功的方法是在网络中识别一个层次结构，该层次结构允许在一些预处理之后进行更快的查询，这些预处理基本上是将额外的“捷径”边插入到图中。在过去，已经有一系列的技术，推断越来越细粒度的层次结构，使越来越高效的查询。这似乎最终在收缩层次结构中为每个顶点分配一个层次级别。在本文中，我们将展示如何识别一个更细粒度的层次结构，为网络的每个边缘分配一个级别。我们的研究结果表明，就访问边缘而言，这可能会导致相当小的搜索空间。目前，这很少意味着改进查询时间，因此边缘层次结构是否可以持续提高性能仍然是一个悬而未决的问题。然而，我们认为，这种技术本身是对现有技术组合的一种值得注意的丰富，将来可能证明是有用的。
英文摘要：
A highly successful approach to route planning in networks (particularly road networks) is to identify a hierarchy in the network that allows faster queries after some preprocessing that basically inserts additional "shortcut"-edges into a graph. In the past there has been a succession of techniques that infer a more and more fine grained hierarchy enabling increasingly more efficient queries. This appeared to culminate in contraction hierarchies that assign one hierarchy level to each vertex. In this paper we show how to identify an even more fine grained hierarchy that assigns one level to each edge of the network. Our findings indicate that this can lead to considerably smaller search spaces in terms of visited edges. Currently, this rarely implies improved query times so that it remains an open question whether edge hierarchies can lead to consistently improved performance. However, we believe that the technique as such is a noteworthy enrichment of the portfolio of available techniques that might prove useful in the future.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
