航天侦察任务的关联度分析与去冗余方法  

A method for space reconnaissance task relevant degree analysis and redundancy deletion

作　　者：李志猛[1] 刘刚[1] 谈群[1] 

机构地区：[1]国防科技大学信息系统工程重点实验室,湖南长沙410073

出　　处：《国防科技大学学报》2014年第5期180-185,共6页Journal of National University of Defense Technology

基　　金：国家自然科学基金资助项目(71271213)

摘　　要：针对航天侦察需求响应中可能存在的任务重复产生问题,综合考虑任务的需求来源、质量要求、时间偏好及空间范围,提出一种基于任务关联度的任务冗余分析方法。对航天侦察的相关要素进行分析度量,给出了基于4类要素的任务关联度计算方法,提出了通过任务之间的关联度来降低可替代任务产生概率的具体算法,考虑了准确优先、公平优先以及混合等不同情况下的冗余度计算方法,给出一个应用示例,说明所述分析方法的有效性。研究结果表明,该方法具有良好的通用性,可为航天侦察任务的预处理提供有效支持。To solve the problem of redundant tasks in space reconnaissance demand,a method for space reconnaissance task relevant degree analysis was proposed,considering the sources of demand,requirements of quality,time preference and spatial range.The relevant elements of space reconnaissance were analyzed,and calculation method of task relevant degree was given based on these four elements.A specific algorithm to reduce probability of redundancy tasks was proposed with task relevant degree.An algorithm of redundancy analysis was considered in the case of accurate priority,justice and hybrid.An example was given to illustrate the effectiveness of this method.The results show that the method has good versatility,which can effectively support space reconnaissance missions preprocessing.

关 键 词：航天侦察 任务 冗余分析 关联度 

分 类 号：TN971[电子电信—信号与信息处理]