航空搜潜布阵航路优化研究  

Route Planning Optimization of Aircraft in Sonobuoys Deployment for Submarine Searching

作　　者：孙启豪 蔡爱华[1,2] 

机构地区：[1]电子科技大学,成都611731 [2]中国电子科学研究院,北京100041

出　　处：《电光与控制》2017年第4期39-42,共4页Electronics Optics & Control

摘　　要：为了更好地研究航空搜潜阵型布阵航路算法,提出将浮标搜潜阵型抽象成平面上点集的思想,并针对目前搜潜航路优化算法中常用的贪心算法进行分析,指出了其在点集扩大时将会远离全局最优解的问题。给出一种利用蚁群算法来进行航路优化的方法,能够取得比传统贪心算法更优的布阵航路,并通过仿真证明了该方法的有效性。The route planning of aircraft in sonobuoys deployment for searching submarine is studied. It is proposed that the sonobuoy array can be abstracted into a point set on the plane. Analysis is made to greedy algorithm, the commonly used route planning optimization method; and we find that when there is a point-set expansion, the greedy algorithm would diverge from the globally optimal solution. Then, in order to optimize the route, a more reasonable method named ant colony algorithm is used. Compared with greedy algorithm, ant colony algorithm could attain a better route. Simulation proves the effectiveness of the method.

关 键 词：搜潜 航路优化 布阵 点集抽象 蚁群算法 

分 类 号：E911[军事]