基于贪婪算法的机动雷达阵地选择  

Position Selection Method for Mobile Radar Based on Greedy Algorithm

作　　者：何文思 李宏权[2] 师维克 赵卿 简久生 HE Wen-si;LI Hong-quan;SHI Wei-ke;ZHAO Qing;JIAN Jiu-sheng(Unit 95445 of PLA,Dali 671000,China;Air Force Early Warning Academy,Wuhan 430019,China)

机构地区：[1]解放军95445部队,云南大理671000 [2]空军预警学院,湖北武汉430019

出　　处：《舰船电子对抗》2021年第6期95-99,110,共6页Shipboard Electronic Countermeasure

摘　　要：针对机动雷达阵地选择问题,提出了一种基于贪婪算法的选址方法。该方法基于集合覆盖模型,先将任务需求的探测空域进行网格化处理,再将雷达在可选阵地的探测威力近似为空域网格的集合,然后利用贪婪算法,逐步求解对任务需求空域全覆盖的雷达部署方案,确保雷达部署的数量最少。与传统方法相比,贪婪算法能够快速的给出问题的近似解,简单易用,适合时效性要求较高的新型机动雷达优化部署任务。Aiming at the problem of mobile radar position selection,a site selection method based on greedy algorithm is proposed.Based on the set coverage model,the grid processing of detection airspace required by the mission is performed,the detection power of the radar in the optional position is approximated to the set of the space grid after grid processing.Then,the greedy algorithm is used to gradually solve the radar deployment scheme with full coverage of the space of the mission requirements,which ensures the minimum number of radar deployments.Compared with the traditional methods,the greedy algorithm can give an approximate solution to the problem quickly,which is simple and easy to use,and is suitable for the optimization deployment task of the new mobile radar with high timeliness.

关 键 词：贪婪算法 阵地选择 空域覆盖 

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