A fast path planning algorithm for route guidance system

Path planning is applied in a variety of ways, including transportation, telecommunications, etc. Path planning to direct vehicles to their destination in a dynamic traffic situation, with the aim of reducing the motoring time and to ensure and efficient use of available road resources is the main challenge in route guidance system. In this paper we propose a fast path algorithm for finding the best shortest paths in the road network. This is poised to minimize costs between the origin and destination nodes. The proposed algorithm was compared with the Dijkstra algorithm in order to find the best and shortest paths using a sample of Tehran city road network. Three cases were tested through simulation using the proposed algorithm. The results show that the efficiency of proposed algorithm and could reduce the cost of vehicle routing on the path planning problems.