In this paper, two adaptive channel assignment (CA) schemes are proposed for maneuvering target tracking (MTT) in multistatic passive radar. For a predetermined total number of channels w.r.t. each receiver, (a) the first scheme selects channels to achieve the highest MTT accuracy; (b) the second scheme minimizes the number of channels while guaranteeing a required MTT performance. By utilizing the best-fitting Gaussian approximation, we derive the predicted conditional Cramér-Rao lower bound to evaluate the impact of CA on MTT performance, and formulate CA schemes as convex integer program problems, since channel variables are in binary form. The objective in the first CA problem is smooth, so we apply the -box alternating direction method of multipliers to divide it into several simple subproblems and alternatively solve them in continuous domains without the introduction of relaxation error. The second CA problem may be infeasible when the required accuracy cannot be met with available channels. To tackle it, we introduce a linear rectification function w.r.t the performance constraint, and equivalently reformulate it as a feasible one. Then, a fast multi-start add-one-channel policy is designed to minimize the gap between the actual accuracy and the accuracy requirement. These algorithms offer considerable reductions in computational complexity compared with the branch and bound method and may achieve near-optimal performance. Simulation results demonstrate that these schemes can either achieve the highest MTT accuracy with channels or reduce the number of channels while guaranteeing MTT performance, compared with the traditional random channel allocation scheme

Adaptive Channel Assignment for Maneuvering Target Tracking in Multistatic Passive Radar

Maria Greco
Ultimo
Membro del Collaboration Group
2023-01-01

Abstract

In this paper, two adaptive channel assignment (CA) schemes are proposed for maneuvering target tracking (MTT) in multistatic passive radar. For a predetermined total number of channels w.r.t. each receiver, (a) the first scheme selects channels to achieve the highest MTT accuracy; (b) the second scheme minimizes the number of channels while guaranteeing a required MTT performance. By utilizing the best-fitting Gaussian approximation, we derive the predicted conditional Cramér-Rao lower bound to evaluate the impact of CA on MTT performance, and formulate CA schemes as convex integer program problems, since channel variables are in binary form. The objective in the first CA problem is smooth, so we apply the -box alternating direction method of multipliers to divide it into several simple subproblems and alternatively solve them in continuous domains without the introduction of relaxation error. The second CA problem may be infeasible when the required accuracy cannot be met with available channels. To tackle it, we introduce a linear rectification function w.r.t the performance constraint, and equivalently reformulate it as a feasible one. Then, a fast multi-start add-one-channel policy is designed to minimize the gap between the actual accuracy and the accuracy requirement. These algorithms offer considerable reductions in computational complexity compared with the branch and bound method and may achieve near-optimal performance. Simulation results demonstrate that these schemes can either achieve the highest MTT accuracy with channels or reduce the number of channels while guaranteeing MTT performance, compared with the traditional random channel allocation scheme
2023
Dai, J.; Yan, J.; Pu, W.; Liu, H.; Greco, Maria
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/1176656
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 3
social impact