Path Planning of Mobile Robot Based on Improved Ant Colony Algorithm

摘要

The problems of obstacle avoidance and path planning of mobile robot are discussed. A possible solution using the improved ant colony algorithm is presented to find a best path without collision from the starting-point to the ending-point.According to the simulation,the test process includes two steps: the meet stage and the cooperation.All local solutions adjust themselves;and then the global solutions is found. The result shows that the mobile robot can find the goal within the shortest path without the collision and the stagnation.