摘要
电子侦察卫星是现代战争中获取电子情报的重要手段,在快速作战决策方面具有独特的作用。电子侦察卫星任务规划问题是一类重要的任务规划问题,涉及各种复杂的约束条件。首先通过对电子侦察卫星工作原理的分析提出了基本假设和预处理的基本方法,并建立了CSP模型,然后采用遗传算法(GA)对模型进行求解。算法针对电子侦察卫星任务规划的特点设计了符号型编码以及相应的OBC交叉算子及多点交换变异算子。最后采用所设计的遗传算法和简单贪婪算法分别对不同规模的问题进行了求解,实验结果表明算法有效地解决了针对固定目标的电子卫星侦察任务规划问题。
Electronic reconnaissance satellite is an important means to gain electronic intelligence in modem war, and has a special effect on prompt command. The problem of mission planning for electronic reconnaissance satellites is a serious problem involving a lot of complex constraints. Based on analyzing the principle of Electronic reconnaissance satellites, this paper puts forward the essential hypotheses of the problem and gives a basic pretreatment method firstly, and then establishes CSP models for the problem. Secondly, a genetic algorithm is designed for the mission planning for electronic reconnaissance satellites. This algorithm designs a kind of sign codes and adopts ordered - based crossover and multiple - point swap mutation correspondingly. At last, the paper utilizes GA and simple greedy algorithm to solve the problems with different scales respectively. The results show that the problem of mission planning for electronic reconnaissance satellites aimed at fixed targets can be solved effectively with this method.
出处
《计算机仿真》
CSCD
北大核心
2009年第8期53-56,共4页
Computer Simulation
关键词
电子侦察卫星
任务规划
遗传算法
贪婪算法
Electronic reconnaissance satellites
Mission planning
Genetic algorithm
Greedy algorithm
