Dwell Time Allocation Algorithm for Multiple Target Tracking in LPI Radar Network Based on Cooperative Game

Abstract

To solve the problem of dwell time management for multiple target tracking in Low Probability of Intercept (LPI) radar network, a Nash bargaining solution (NBS) dwell time allocation algorithm based on cooperative game theory is proposed. This algorithm can achieve the desired low interception performance by optimizing the allocation of the dwell time of each radar under the constraints of the given target detection performance, minimizing the total dwell time of radar network. By introducing two variables, dwell time and target allocation indicators, we decompose the dwell time and target allocation into two subproblems. Firstly, combining the Lagrange relaxation algorithm with the Newton iteration method, we derive the iterative formula for the dwell time of each radar. The dwell time allocation of the radars corresponding to each target is obtained. Secondly, we use the fixed Hungarian algorithm to determine the target allocation scheme based on the dwell time allocation results. Simulation results show that the proposed algorithm can effectively reduce the total dwell time of the radar network, and hence, improve the LPI performance.

Keywords

• radar network
• low probability of intercept (LPI)
• cooperative game
• Nash bargaining solution (NBS)
• dwell time allocation