Robot Path Planning Based on Dijkstra’s Algorithm and Genetic Algorithm

In this paper, a robot path planning method based on Dijkstra’s Algorithm and Genetic Algorithms is proposed. This method works for any appointed start point and end point in an arbitrary rectangular workspace with arbitrary rectangular obstacles whose edges are perpendicular or parallel to the walls of the workspace. Firstly, use Dijkstra’s Algorithm to find a path among all the midpoints of obstacles’ vertices and the walls of the workspace. Then use Genetic Algorithm to optimize the path gotten from Dijkstra’s Algorithm and finally generate an optimal path for the robot from the start point to the end point.