双基地雷达栅栏覆盖的二维布站优化方法

为解决双基地雷达栅栏覆盖的优化问题，该文提出一种基于相邻部署线的2维布站优化方法。该方法首先将感兴趣区域用矩形区域近似替代，再将矩形区域划分为多个相同的子栅栏覆盖区域；其次为了充分发挥发射器的效能，该方法不仅利用同条部署线上的发射器与接收器组成双基地雷达，同时也采用相邻部署线之间的发射器与接收器组成双基地雷达。为此提出一种新的基本布站模式，并以该模式为基础建立2维布站的优化模型。该模型以布站成本最小为准则，覆盖区域为约束条件。为了求解该优化模型，该文提出一种基于贪婪算法的求解方法，该方法可以确定2维布站中发射器与接收器的数量及其位置。最后，仿真试验和分析表明该文方法可以有效降低布站成本，减少发射器的使用数量，证明了该文布站优化方法的有效性。

Two-dimensional Deployment Optimization Method for the Barrier Coverage of Bistatic Radars

To solve the optimization problem of bistatic radar for belt barrier coverage, a two-dimensional deployment optimization method using adjacent deployment lines is proposed. First, the field of interest is approximately represented by a rectangular area, and then the area is divided into multiple identical sub-barrier coverage areas. To give full play to the efficiency of the transmitters, the bistatic radars consisting of the transmitters and the receivers on the same deployment line and the adjacent deployment lines should be considered. Thus, four two-dimensional deployment patterns are introduced and analyzed. Furthermore, an optimization model based on these deployment patterns is proposed. The minimum deployment cost and the coverage area requirements are adopted as the optimization criterion and constraints, respectively. A method based on the greedy algorithm is exploited to solve the optimization model. The deployment locations and the minimum deployment cost can be calculated by the proposed method. Finally, the simulation results and analysis show that, compared with the existing method, the minimum deployment cost and the number of transmitters can be impressively reduced by the proposed method. The effectiveness of the proposed method is proven.