A Compound Path Planning Algorithm for Mobile Robots

In this paper, we designed a compound algorithm which combined the advantages of Dijkstra and ant colony optimization to complete the robot path planning. The compound algorithm is one that uses the Dijkstra algorithm for initial path planning under a viewable environment model, and then optimizes the initial path with an improved ACO. Pointing at the problem that the ACO is slow to converge and easy to fall into the local optimal solution, the performance of ACO is improved by constructing a new heuristic function and improving the pheromone update principle. Through the simulation on MATLAB, the designed algorithm shows higher path search efficiency and path optimization rate than the traditional algorithms.