基于蚁群算法的自由飞行空间机器人路径规划

详细信息

PATH PLANNING FOR FREE-FLYING SPACE ROBOT USING ANT ALGORITHM

Department of Computer Science & Engineering, Harbin Institute of Technology 150001

摘要: 本文采用蚁群算法实现了自由飞行空间机器人的避障路径规划．蚁群算法是基于群体的一种仿生算法，为求解复杂的组合优化方法问题提供了一种新思路．本文对蚁群算法进行了适当的修改，使之适用于自由飞行空间机器人的路径规划，然后用计算机进行了仿真，取得了较好的结果．
- 自由飞行空间机器人 /
- 蚁群算法 /
- 路径规划 /
- 障碍避碰
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.
- free-flying space robot /
- ant algorithm /
- path planning /
- obstacle avoidance

[1]	Dorigo M, Maniezzo V, Colorni A. Ant system: optimization by a colony of cooperating agent 26(1): 29-41
[2]	Colorni A. Heuristics from nature for hard combinatorial optimization problems. Int Trans in Opnl Res, 1996,3(1):1-21
[3]	Dorigo M, Gambardella L M. A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1997,1(1): 53-66
[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.)
[5]	蔡自兴. 机器人原理及其应用. 中南工业大学出版社, 1988