Abstract：A bionics algorithm for robot path planning in static environment is proposed,in which the environmental models are established with grid method,the foraging behavior of ant colonies is simulated and optimal path search is finished by many ants cooperatively.Furthermore,the strategies of probabilistic search,nearest neighbor search and a goal guiding function are applied to enable the searching to be rapid and efficient.Results of simulation experiments demonstrate that the best path can be found in short time,real-time planning can be achieved,and the effect is very satisfying even if the geographic conditions with obstacles are exceedingly complicated.
 Wang C M,Soh Y C,Wang H,et al. A hierarchical genetic algorithm for path planning in a static environment with obstacles[A]. IEEE CCECE Canadian Conference on Electrical and Computer Engineering[C]. 2002,vol.3.1652-1657.  D'Amico A,Ippoliti G,Longhi S A. Radial basis function networks approach for the tracking problem of mobile robots[A]. Proceedings of the IEEE/ASME. International Conference on Advanced Intelligent Mechatronics[C]. 2001,vol.1. 498-503.  Weerayuth N,Chaiyaratana N.Closed-loop time-optimal path planning using a multi-objective diversity control oriented genetic algorithm[A]. Systems,Man and Cybernetics[C]. IEEE International Conference on,Vol.6:7.  Bruce J,Veloso M. Real-time randomized path planning for robot navigation[A]. Intelligent Robots and Systems 2002. IEEE/RSJ International Conference on,2002,Vol.3. 2383- 2388.  Dorigo M,Maniezzo V,Colorni A. Ant system: optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems ,Man and Cybernetics,Part B: Cybernetics,1996,26(1): 29-41.  Dorigo M,Dicaro G. Ant colony optimization: a new meta-heuristic[A]. Proceedings of the 1999 Congress on Evolutionary Computation[C]. Washington,DC,USA: 1999,Vol.2. 1477. 474-477.  Dorigo M,Gambardella L M,Middendorf M,et al. Guest editorial: special section on ant colony optimization[A]. IEEE Transactions on Evolutionary Computation[C]. 2002,6(4): 317-319.