一种基于离散粒子群的多星任务规划算法  

A Multisatellite Task Planning Algorithm Based on Discrete Particle Swarm

作　　者：韩伟[1] 张学庆[1] 

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

出　　处：《无线电工程》2015年第1期1-4,47,共5页Radio Engineering

基　　金：河北省择优资助博士后科研基金资助项目(B2013003019)

摘　　要：对地观测卫星的任务规划是卫星管控中的关键内容,其本质是一个优化决策的过程。面向多对地观测卫星任务规划的问题特点,建立了问题的数学模型,提出了一种基于离散粒子群的优化算法,设计了离散粒子群的位置变化公式。仿真结果表明,离散粒子群算法具有收敛速度快、寻优能力强等优点,能够有效地解决多约束条件下的多星任务规划问题。The task planning of earth observation satellite is a key part of satellite management control,and it is a optimization decision.making process. A mathematical model is established and a discrete particle swarm optimization （ DPSO） algorithm is put forward to solve the multiple satellites task planning problem. According to the discrete characteristic of task planning, a new update strategy for particle position is designed.The simulation results show that the DPSO algorithm has such advantages as high optimization capability,fast convergence,etc.,and can solve the multisatellite task scheduling problem effectively.

关 键 词：任务规划 多星 离散粒子群 

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