面向区域覆盖的电子侦察卫星规划方法研究  

Research on Schedule Technique for Area-detecting Electronic Reconnaissance Satellite

作　　者：王慧林[1] 邱涤珊[2] 黄小军[1] 马满好[1] 祝江汉[1] 

机构地区：[1]北京跟踪与通信技术研究所,北京100094 [2]国防科技大学C~4ISR技术国防科技重点实验室,湖南长沙410073

出　　处：《兵工学报》2011年第11期1365-1372,共8页Acta Armamentarii

摘　　要：电子侦察卫星对区域的覆盖搜索在反恐及海上搜救等领域发挥着重要作用,面向区域覆盖的电子侦察卫星规划问题(ACOERSS)也因此成为卫星规划领域急需解决的重要问题之一。针对问题特点,构建了区域网格空间,提出了一种基于空域频域划分的候选侦察活动构造方法,并在此基础上建立了面向区域覆盖的多目标规划模型;提出了一种面向区域覆盖的多目标进化算法对模型进行求解,同时设计了一种基于时间可行性判定的初始可行解构造算法来产生高质量的初始解。仿真对比实验表明:模型及算法能够有效解决面向区域覆盖的电子侦察卫星规划问题并且性能良好。Because of significantly important role that the electronic reconnaissance satellite（ERS） plays in the fields of antiterrorism and salvage,the problem of area covering-oriented electronic reconnaissance satellite scheduling（ACOERSS） becomes a key problem in ERS scheduling domain.Considered the specific constraints of ACOERSS,the grid space of the area target was established,and a candidate reconnaissance activity constructing method based on the partitions in space domain and frequency domain was proposed.Then,a multi-objective model for ACOERSS was brought forward.Based on the model,an ACOERSS multi-objective evolution algorithm（ACOERSS-MOEA） was put forward to obtain the optimal solutions.Meanwhile,an initial feasible solution construct algorithm based on the determining of time feasibility was designed to produce high quality initial solutions to prevent the algorithm from slow converging.The comparative experiments show that the proposed model and algorithm can effectively deal with the ACOERSS problem better.

关 键 词：航空、航天系统工程 电子侦察卫星 区域目标 网格空间 协同侦察 多目标进化算法 

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