An improved ACO algorithm for mobile robot path planning
暂无分享,去创建一个
[1] Paul M. Griffin,et al. Path planning for a mobile robot , 1992, IEEE Trans. Syst. Man Cybern..
[2] Mengyin Fu,et al. A Path Planning Algorithm Based on Dynamic Networks and Restricted Searching Area , 2007, 2007 IEEE International Conference on Automation and Logistics.
[3] Zhu Qing-bao,et al. An Ant Colony Algorithm Based on Grid Method for Mobile Robot Path Planning , 2005 .
[4] Wang Jiechen. An improved Graham algorithm for determining the convex hull of planar points set , 2010 .
[5] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[6] Michaël Soulignac,et al. Feasible and Optimal Path Planning in Strong Current Fields , 2011, IEEE Transactions on Robotics.
[7] Huan He,et al. Global optimal path planning for mobile robot based on improved Dijkstra algorithm and ant system algorithm , 2006 .
[8] Klaus Meer,et al. Simulated Annealing versus Metropolis for a TSP instance , 2007, Inf. Process. Lett..
[9] Chen Hongjian,et al. An Adaptive Ant Colony Algorithm Based on Equilibrium of Distribution , 2003 .
[10] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[11] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[12] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .