4.7 Article

Resource Allocation for Multitarget Tracking and Data Reduction in Radar Network With Sensor Location Uncertainty

Journal

IEEE TRANSACTIONS ON SIGNAL PROCESSING
Volume 69, Issue -, Pages 4843-4858

Publisher

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

Keywords

Radar; Radar tracking; Target tracking; Resource management; Uncertainty; Optimization; Radar cross-sections; Radar network; power allocation; measurement selection; multitarget tracking; sensor location uncertainty

Funding

  1. National Natural Science Foundation of China [61871307]
  2. Aviation Science fund [20170181001, 20172081010]

Ask authors/readers for more resources

Traditional networked radar systems for target tracking often face heavy data processing burden and neglect sensor location uncertainties. This paper introduces a joint power allocation and measurement selection strategy for radar networks considering sensor uncertainties. By utilizing a distributed fusion architecture and formulating the strategy as a bi-objective optimization problem, the proposed approach outperforms traditional allocation strategies in numerical simulations.
Traditional networked radar systems for target tracking usually suffer from a heavy data processing burden, and do not consider the sensor location uncertainties (SLUs), by assuming that radar locations are known perfectly, which is applicable only for static platforms. In this paper, considering sensors mounted on moving platforms, we propose a joint power allocation and measurement selection (JPAMS) strategy for multitarget tracking and data reduction in radar networks with the SLUs. The mechanism is to optimize the transmitted power and select the propagation paths with informative measurements, simultaneously. First, we adopt a distributed fusion architecture to estimate both states of targets and radars in clutter. Based on the distributed fusion architecture, the predicted conditional Cramer-Rao lower bound (PC-CRLB) considering the SLU and the measurement origin uncertainty is derived. Second, the JPAMS strategy is formulated as a bi-objective optimization problem, where the sum of weighted PC-CRLBs and the number of selected propagation paths are used as the performance metrics with respect to tracking and data reduction. The corresponding optimization is a NP-hard problem containing both continuous and binary variables. Third, to solve this nonconvex problem, we propose a sparsity-enhancing sequential convex programming algorithm. Finally, numerical simulations demonstrate the superiority of the proposed JPAMS strategy over the traditional allocation strategies.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available