基于图论的雷达优化部署方法

Radar Optimal Deployment Based on Graph Theory

通过离散化等处理将雷达组网部署问题转化为图论问题,利用图论相关知识研究这一多目标优化问题,根据约束条件的不同建立了对应的模型,并通过状态压缩等技巧设计了对应算法.相比于传统的相关算法,该算法复杂度低,并且适用于复杂区域和复杂约束的部署问题,对于不同约束均能快速给出最优部署方案.本文还讨论了重点区域覆盖和冗余覆盖等因素,最后给出模拟仿真.仿真结果表明,本算法给出的部署方案一方面保证了对整个区域全覆盖,另一方面让冗余度尽可能小,避免了资源浪费.

In this paper,a radar deployment problem was translated into graph theory problem by some pre-processing operations,like discretization,to solve a multi-objective optimization problem for radar deployment based on graph theory knowledge.Firstly,different models were established according to various constraints and a corresponding algorithm was designed based on the state compression technology.Compared with traditional algorithms,this algorithm was arranged to be suitable for the solution of the radar deployment problems with more complicated constraints and area conditions,to present an optimal radar deployment scheme rapidly for different constraints.And then,some problems with factors of key area and redundancy were analyzed.Finally,the numerical simulations were carried out.The results show that,the proposed method can provide an optimal radar deployment scheme,which can not only cover whole area,but also minimize the redundancy and avoid resource consuming.