Path Planning Algorithm Using the Particle Swarm Optimization and the Improved Dijkstra Algorithm

In this project, we develop the path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result.

The graph generated from the all the free links

The shortest path using the Dijkstra algorithm


Name :
EmailID :
Contact No :
Comment :