4.7 Article

Target Capacity Based Resource Optimization for Multiple Target Tracking in Radar Network

期刊

IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 69, 期 -, 页码 2410-2421

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2021.3071173

关键词

Measurement; Target tracking; Simulation; Radar tracking; Search problems; Bayes methods; Resource management; Bayesian Cramé r-Rao lower bound; Multiple target tracking; Radar network; Resource optimization; Target capacity

资金

  1. National Natural Science Foundation of China [62071345]
  2. Fund for Foreign Scholars in University Research and Teaching Programs (111 project) [B18039]
  3. Natural Science Foundation of Shaanxi Province [2020JQ-297]
  4. Aeronautical Science Foundation of China [201920081002]
  5. Foundation of National Radar Signal Processing Laboratory [61424010406]

向作者/读者索取更多资源

This paper presents a target capacity based resource optimization scheme for multiple target tracking in radar networks, aiming to increase the number of tracked targets by coordinating the resource usage of multiple radars. The scheme uses a Bayesian Cramer-Rao lower bound as a metric function and is designed as a non-smooth and non-convex optimization problem. An efficient three-step solution technique is proposed to deal with this problem, incorporating relaxation and fine-tuning processes.
In this paper, a target capacity based resource optimization (TC-RO) scheme is developed for multiple target tracking (MTT) application in radar networks. The key idea of this scheme is to coordinate the transmit power and dell time resource usage of multiple radars in order to increase the number of the targets that can be tracked with predetermined accuracy requirements. We adopt the Bayesian Cramer-Rao lower bound as a metric function to quantify the MTT accuracies, and build the TC-RO scheme as a non-smooth and non-convex optimization problem. To deal with this problem, we design an efficient three-step solution technique which incorporates relaxation and fine-tuning process. Specifically, we first relax the resulting optimization problem as a smooth one by applying sigmoid-type transformation to its objective, and then develop an appropriate method to find a local minimum to the relaxed non-convex problem with guaranteed convergence. After that, the local minimum of the relaxed problem is used as an initial point and a fine-tuning process is performed to search for a reasonable feasible solution to the original non-smooth optimization problem. Simulation results demonstrate that the proposed TC-RO scheme can greatly increase the target capacity of the radar network when compared with the traditional uniform allocation scheme.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据