摘要
在分析多卫星中心内部特点及中心间关系的基础上建立了多中心协同规划问题(MCCOPP)的数学模型,提出了解决该问题的多中心合作协同进化规划算法(MCCCSPA)。MCCCSPA基于分治-合作策略,根据中心数目以及观测目标集合特点将观测目标分解分配至各中心;提出等长扩展二进制染色体编码方式有效表达问题的解,便于个体的交叉、变异、合作操作;并综合多中心个体代表合作求解本中心个体适应值;其中交叉、变异、合作算子在确保可行解的前提下保证各中心子种群的多样性、加快收敛速度。仿真实验及分析结果表明:该方法能够有效解决多中心协同的卫星任务规划问题。
A multi-center cooperative planning problem （MCCOPP） model is constructed which takes into consideration the characteristics of multiple satellite centers and the relations among them. Then a multi-center co- operative coevolutionary planning and scheduling algorithm （MCCCPSA） is proposed. Considering the number of the multi centers and the characteristics of the observed targets, MCCCPSA decomposes the targets into smaller components and assigns them to each center based on the divide-and-conquer strategy. Moreover, MC CCPSA adopts an extended constant length binary representation to chromosomes, which effectively facilitates the crossover, mutation and cooperation operations. The individual fitness in each center is calculated in collaboration with the representatives of other centers. Furthermore, the crossover, mutation and cooperation operators ensure the feasibility and diversity of the child population while accelerating the convergence. Simulation and analysis show that the proposed algorithm can solve the problems effectively.
出处
《航空学报》
EI
CAS
CSCD
北大核心
2010年第9期1832-1840,共9页
Acta Aeronautica et Astronautica Sinica
基金
国家自然科学基金(60604035)
国家"863"计划(2007AA12020203)
关键词
卫星中心
多目标优化
合作协同进化规划算法
协同规划
分治一合作
satellite center
multi objective optimization
cooperative coevolutlonary algorithm
cooperative planning
divide-and-conquer
