Optimal Path Planning of Beidou Navigation System Based on Dijkstra Algorithm

Abstract

The optimal path planning plays an important role in the satellite navigation system. This paper uses the Dijkstra algorithm, which gives a shortest path first, to find a more effective travel decision. The decision combines the Dijkstra algorithm with the real-time traffic information and gives an effective travel plan. This system is developed under C# environment, achieves the goals of travel path planning and traffic guidance, and can supply a variety of travel plan to the traveler according to the difference influence factors.

Path planning for robots utilizing the enhanced A* and improved dynamic window approach algorithm

“…Both methods complement each other in practical applications. For global path planning, the commonly used methods include the A* algorithm, Dijkstra algorithm, genetic algorithm, RTT algorithm, etc., and various improved algorithms proposed to address the shortcomings of these algorithms [2][3][4][5][6][7]. As for local path planning, the commonly employed methods are the DWA algorithm, artificial potential field method, reinforcement learning method, etc., and various improved algorithms of these algorithms [8][9].…”