有限数量机载雷达目标覆盖价值算法  

Research on Algorithm of Target Coverage Value for Limited Airborne Radars

作　　者：刘鹏[1] 白剑林[2] 

机构地区：[1]空军工程大学理学院,西安710051 [2]空军工程大学导弹学院,陕西三原713800

出　　处：《火力与指挥控制》2010年第2期28-31,共4页Fire Control & Command Control

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

摘　　要：针对有限数量机载雷达目标覆盖价值问题,建立了机载雷达载机待选轨道中心点(COCP)概念;分析了COCP和目标点之间的关系,给出了有限数量机载雷达目标覆盖价值问题的数学模型。通过分析有限规模COCP集合的方法,建立了多个机载雷达部署约束条件的数学模型。通过对COCP集合和目标点集合进行约束排除和聚类,简化了研究问题。总结出了有限数量机载雷达目标覆盖价值数学模型的最优解和启发式次优解,实例仿真结果表明该模型和算法的有效性。For the issues of the number airborne radar target coverage value, the concept of the Candidate Orbit Center Point （COCP） for the plane is established. The relationship between COCP and objectives points is analyzed. The mathematical models of the number airborne radars target coverage value are given. By analyzing the limited scale COCP collection, the mathematical model of a number of airborne radars deployment constraints is established. By preclude constricting and clustering the COCP set and the objectives point set, the research is simplified. The optimal solutions and the heuristic suboptimal solutions for the mathematical models are concluded. The simulation results show the effectiveness of the model and the algorithm.

关 键 词：机载雷达 待选轨道中心点 目标覆盖价值 约束排除 

分 类 号：E835[军事—战术学]