论文部分内容阅读
针对移动目标连续侦察电子侦察卫星任务规划问题,基于电子侦察卫星系统任务需求分析,首先对问题进行了合理的假设与简化,分析了电子侦察组网卫星对移动目标进行连续侦察的基本过程,建立了面向移动目标连续侦察的电子侦察卫星任务规划约束满足问题(constraint satisfy problem,CSP)模型,设计了求解模型的基于分群机制的改进粒子群优化(particle swarm optimization,PSO)算法。仿真案例的实验结果表明:该模型和算法能有效解决电子侦察卫星对移动目标连续侦察的任务规划问题。
Aiming at the mission planning of continuous reconnaissance of electronic reconnaissance satellites for mobile targets, based on the mission demand analysis of electronic reconnaissance satellite systems, the problem is reasonably assumed and simplified. The basic process of continuous reconnaissance of moving targets by electronic reconnaissance network is analyzed. In order to solve this problem, we design a particle swarm optimization (PSO) algorithm based on clustering mechanism to solve the problem of constraint reconciliation (CSP) for electronic reconnaissance satellites for continuous reconnaissance of mobile targets. The experimental results of the simulation case show that the proposed model and algorithm can effectively solve the mission planning problem of the electronic reconnaissance satellite for continuous reconnaissance of moving targets.