Abstract:

A kind of ant colony optimization with potential field (ACOPF) heuristic, is proposed for path planning of a mobile robot in unknown environment. In the ACOPF, the potential field resultant and the distance between the robot and the goal are utilized to construct the comprehensive heuristic of robot for obstacle avoidance and moving. With this heuristic, an ant colony optimization (ACO) mechanism is used to search a global optimal path from the start point to the end point for a robot in an unknown environment. The proposed ACOPF combines ACO with potential field method (PFM) effectively and makes the optimal path finding more effective than using general ACO. Simulation results show that the proposed ACOPF is very effective and efficient for robot path planning.