An Inverse Olympic Medal Tally Transformation for Optimal Lane-level Road Network Path Traversal

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.