scholarly journals Joint Dwell Time and Bandwidth Optimization for Multi-Target Tracking in Radar Network Based on Low Probability of Intercept

Sensors ◽  
2020 ◽  
Vol 20 (5) ◽  
pp. 1269
Author(s):  
Lintao Ding ◽  
Chenguang Shi ◽  
Wei Qiu ◽  
Jianjiang Zhou
Keyword(s):  
Lower Bound ◽  
Target Tracking ◽  
Bandwidth Allocation ◽  
Dwell Time ◽  
Network Systems ◽  
Bandwidth Optimization ◽  
Radar Network ◽  
Multi Target Tracking ◽  
Low Probability ◽  
Low Probability Of Intercept

Radar network systems have been demonstrated to offer numerous advantages for target tracking. In this paper, a low probability of intercept (LPI)-based joint dwell time and bandwidth optimization strategy is proposed for multi-target tracking in a radar network. Since the Bayesian Cramer–Rao lower bound (BCRLB) provides a lower bound on parameter estimation, it can be utilized as the accuracy metric for target tracking. In this strategy, in order to improve the LPI performance of the radar network, the total dwell time consumption of the underlying system is minimized, while guaranteeing a predetermined tracking accuracy. There are two adaptable parameters in the optimization problem: one for dwell time, and the other for bandwidth allocation. Since the nonlinear programming-based genetic algorithm (NPGA) can solve the nonlinear problem well, we develop a method based upon NPGA to solve the resulting problem. The simulation results demonstrate that the proposed strategy has superiority over traditional algorithms, and can achieve a better LPI performance of this radar network.

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

Sensors ◽  
2020 ◽  
Vol 20 (20) ◽  
pp. 5944
Author(s):  
Chenyan Xue ◽  
Ling Wang ◽  
Daiyin Zhu
Keyword(s):  
Target Tracking ◽  
Cooperative Game ◽  
Time Allocation ◽  
Dwell Time ◽  
Nash Bargaining ◽  
Multiple Target Tracking ◽  
Multiple Target ◽  
Allocation Algorithm ◽  
Radar Network ◽  
Target Allocation

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.

Sign in / Sign up

Export Citation Format

Share Document