Abstract：Obstacle avoidance path planning for free-flying space robot is realized by the use of ant algorithm. The ant algorithm is a class of population based bionic algorithm, which provides new methods for complex combinatorial optimization problem. The ant algorithm is improved appropriately so that it is applicable to path planning for free-flying space robot. Then, the algorithm is implemented with computer simulation and preferable results are obtained.
金飞虎, 洪炳熔, 高庆吉. 基于蚁群算法的自由飞行空间机器人路径规划[J]. 机器人, 2002, 24(6): 526-529.
JIN Fei-hu, HONG Bing-rong, GAO Qing-ji. PATH PLANNING FOR FREE-FLYING SPACE ROBOT USING ANT ALGORITHM. ROBOT, 2002, 24(6): 526-529.
Dorigo M, Gambardella L M. A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1997,1(1): 53-66
[2]
Colorni A. Heuristics from nature for hard combinatorial optimization problems. Int Trans in Opnl Res, 1996,3(1):1-21
[1]
Dorigo M, Maniezzo V, Colorni A. Ant system: optimization by a colony of cooperating agent 26(1): 29-41
[4]
Dorigo M. And G.Di Caro (1999). The Ant Colony Optimization Meta-Heuristic. In D.Corne, M.Dorigo and F.Glover(eds), New Ideas in Optimization. McGraw-Hill, 1999.(Also available as: Tech. Rep. IRIDIA/99-1,Universite Libre de Bruxelles, Belgium.)
