Optimization method of linear barrier coverage deployment for multistatic radar

To address the problem of building linear barrier coverage with the location restriction, an optimization method for deploying multistatic radars is proposed, where the location restriction splits the deployment line into two segments. By proving the characteristics of deployment patterns, an optimal deployment sequence consisting of multiple deployment patterns is proposed and exploited to cover each segment. The types and numbers of deployment patterns are determined by an algorithm that combines the integer linear programming (ILP) and exhaustive method (EM). In addition, to reduce the computation amount, a formula is introduced to calculate the upper threshold of receivers' number in a deployment pattern. Furthermore, since the objective function is non-convex and non-analytic, the overall model is divided into two layers concerning two suboptimization problems. Subsequently, another algorithm that integrates the segments and layers is proposed to determine the deployment parameters, such as the minimum cost, parameters of the optimal deployment sequence, and the location of the split point. Simulation results demonstrate that the proposed method can effectively determine the optimal deployment parameters under the location restriction.

Automated summary

To address the problem of building linear barrier coverage with location restriction, this paper proposes an optimization method for deploying multistatic radars. The deployment line is divided into two segments due to the location restriction. An optimal deployment sequence consisting of multiple deployment patterns is proposed and exploited to cover each segment by proving the characteristics of deployment patterns. The algorithm combines integer linear programming (ILP) and exhaustive method (EM) to determine the types and numbers of deployment patterns.