基于图论的多星综合任务规划双蚁群算法  

Double Ant Colony Algorithm of Multi-satellite Mission Planning Based on Graph Theory

作　　者：柴伟杰 张超[1] CHAI Weijie;ZHANG Chao(The 54th Research Institute of CETC,Shijiazhuang 050081,China)

机构地区：[1]中国电子科技集团公司第五十四研究所,河北石家庄050081

出　　处：《无线电工程》2019年第6期534-539,共6页Radio Engineering

基　　金：海洋公益性科研专项资助(201505002)

摘　　要：针对多星综合任务规划问题,分析和定义了问题实际约束,基于图论理论构建了适合蚁群算法求解的独立集模型。针对研究问题的特点和蚁群算法的原理,设计了双蚁群算法——第一支蚁群规划数传任务和第二支蚁群规划观测任务,描述了算法的详细流程。实验结果表明在运行效率、优化效能上提出的双蚁群算法均优于传统方法。This paper analyzes and defines the actual constraints of comprehensive multi-satellite mission planning.Based on the graph theory,an independent set model suitable for ant colony algorithm is constructed.Aiming at the characteristics of research problems and the principle of ant colony algorithm,a double ant colony algorithm is designed and the detailed flow of this algorithm is described.In this algorithm,the first ant colony is responsible for data transmission mission planning,and the second ant colony is responsible for observation mission planning.The experimental results show that the proposed double ant colony algorithm is superior to the traditional method in terms of operational efficiency and effectiveness optimization.

关 键 词：图论 蚁群算法 任务规划 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]