Optimal Path Finding Algorithms Based on SLSD Road Network Model

TLDR: It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.

Abstract: A solution to compute the optimal path based on a single-line-single-directional (SLSD) road network model is proposed. Unlike the traditional road network model, in the SLSD conceptual model, being single-directional and single-line style, a road is no longer a linkage of road nodes but abstracted as a network node. Similarly, a road node is abstracted as the linkage of two ordered single-directional roads. This model can describe turn restrictions, circular roads, and other real scenarios usually described using a super-graph. Then a computing framework for optimal path finding (OPF) is presented. It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network. Finally, using Singapore road network data, the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.