论文标题
最佳车道级路线路径遍历跨奥林匹克奖章的反向奖章转换
An Inverse Olympic Medal Tally Transformation for Optimal Lane-level Road Network Path Traversal
论文作者
论文摘要
（几乎）任意输入路径的车道级遍历是映射行业的一个常见问题。本文考虑了生成\ emph {可行}和最大方便的车道级路径遍历的问题。提出的方法利用了输入路径的图转换，该输入路径随后通过多标准搜索算法探索。这种方法能够产生遍历遍历的路径，这些路径可以在可能的情况下遵守车道越野规则，并最大程度地减少沿任何给定输入路径的法律但不便的车道交叉口的数量。
Lane-level traversal of (almost) arbitrary input paths is a common problem in the mapping industry. This paper considers the problem of generating \emph{feasible} and maximally convenient lane-level path traversals. The presented approach exploits a graph transformation of an input path which is subsequentially explored by a multi-criteria search algorithm. This approach is able to yield paths traversals that are guaranteed to obey lane crossing rules whenever possible, and minimize the number of legal, yet inconvenient lane crossings along any given input path.
