A Realistic Shortest Path Considering Road Intersections

Abstract

Finding shortest path plays an important role in many areas. Such as Robotics, Road maps, Network communications etc. There are some popular algorithms that can find the shortest path. In different environments, our conventional algorithm needs to be modified to solve a specific problem. In this paper we modified the conventional Dijkstra algorithm to find the shortest path considering intersections. We tested the performance of our improved algorithm on a real map which is collected from Google map. The algorithm is implemented using Visual C++14, and our analysis results showed that this algorithm is effective and more accurate in real life.