基于蚁群算法的军用飞行器航迹规划  

Route planning of military craft based on ant colony algorithm

作　　者：杨丹[1] 李士勇[1] 

机构地区：[1]哈尔滨工业大学控制科学与工程系,哈尔滨150001

出　　处：《哈尔滨商业大学学报（自然科学版）》2007年第6期677-681,共5页Journal of Harbin University of Commerce：Natural Sciences Edition

基　　金：国家自然科学基金资助课题(50138010)

摘　　要：为了提高军用飞行器的作战效能,在实施远程精确打击之前,必须利用地形和敌情等信息,规划出生存概率最大、作战效率最高的飞行器突防轨迹.针对这一问题,讨论了基于蚁群算法的航迹规划方法,并经过坐标变换将算法的候选解集合、航路选择规则以及信息素更新规则进行了改进,获得了一种更有效的航路规划方法,且取得了较好的计算机仿真结果.It＇ s important to plan a route which has higher survival probability and better battle efficiency for improving the battle performance of military crafts. Route planning is discussed based on ant colony algorithm, and a new algorithm is proposed. There is some improvement on transition rule and pheromone updating rule in the new algorithm. The new method can find better route at higher convergence speed. The algorithm is implemented with computer simulation and preferable results are obtained.

关 键 词：航迹规划 蚁群算法 信息素 仿真 

分 类 号：V271.4[航空宇航科学与技术—飞行器设计]