6 April 2021 in IEEE Transactions on Signal Processing
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 Cramér-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.
1 March 2021 in IEEE Systems Journal
In this article, a quality of service constrained-resource allocation (QoSC-RA) scheme is built for multiple target tracking (MTT) in radar sensor network. This QoSC-RA scheme can not only divide radar sensors into several groups to illuminate multiple targets separately but also optimize the transmit resource of the radar sensors in different groups. In such a case, we can minimize the total resource consumption of a radar sensor network while achieving the desired MTT accuracy. The QoSC-RA scheme is formulated as a mathematical optimization problem and is shown to possess two sets of conflict constraints (the QoS constraints and the resource constraints). When the problem is feasible, we analyze its optimality based on the Karush–Kuhn–Tucker conditions and subsequently design appropriate solution methods to solve it efficiently. When the problem is infeasible, we relax it as a feasible one by enlarging its feasible domain and use a gradient projection method to achieve a compromise solution. Simulation results demonstrate that the QoSC-RA process can achieve predetermined MTT performance with smaller resource consumption than the uniform allocation scheme.
26 January 2023 in IEEE Transactions on Geoscience and Remote Sensing
This paper considers the 3D collaborative trajectory optimization (CTO) of multiple unmanned aerial vehicles to improve multitarget tracking performance with asynchronous angle of arrival measurements. The predicted conditional Cramér-Rao lower bound is adopted as a performance measure to predict and subsequently control tracking error online. Then, the CTO problem is cast as a time-varying nonconvex problem subjected to constraints arising from dynamic and security (height, collision, and obstacle/target/threat avoidance). Finally, a comprehensive solution method (CSM) is presented to tackle the resulting problem, according to its unique structures. Specifically, if all security constraints are inactive, the CTO can be simplified as a non-convex problem with convex dynamic constraints, which can be solved by the nonmonotone spectral projected gradient (NSPG) method. Oppositely, an alternating direction penalty method (ADPM) is presented to solve the CTO problem with some positive security constraints. The ADPM introduces auxiliary vectors to decouple the complex constraints and separates the CTO into several subproblems and tackles them alternately, while locally adjusting the penalty factor at each iteration. We show the subproblem w.r.t. the position vector is nonconvex but with convex constraints, which can be efficiently solved by the NSPG method. The sub-problems w.r.t. the auxiliary vectors are separable and have closed-form solutions. Simulation results demonstrate that the CSM outperforms the unoptimized method in terms of tracking performance. Besides, the CSM achieves the near-optimal performance provided by the genetic algorithm with much lower computational complexity.
17 October 2022 in IEEE Transactions on Geoscience and Remote Sensing
In this article, a composed resource optimization (CRO) scheme is developed for an active and passive radar network engaged in multiple target tracking (MTT). The motivation of the CRO scheme is to collaboratively optimize the transmit resources of active radars, as well as the receiving processing resources of passive radars, to improve the overall MTT performance. We utilize the predicted conditional Cramér–Rao lower bound to evaluate the impact of allocation strategies on tracking performance and formulate the CRO as a mixed-integer nonlinear program problem since the adaptable parameters w.r.t. the target selection process are in binary form. To solve the problem, we propose an alternating direction method of multiplier-based algorithm. This algorithm transforms the original problem into an equality constrained problem by introducing two auxiliary vectors. In such a case, the CRO problem can be tackled by alternately solving several simple subproblems. Specifically, the subproblem w.r.t. the resource vector is convex, and the subproblems w.r.t. the auxiliary vectors are separable. Simulation results demonstrate that the proposed CRO scheme outperforms the traditional allocation schemes in terms of MTT performance. In addition, the performance of the CRO scheme is close to the optimal performance provided by the exhaustive method, but the computation load of the CRO scheme is lower than that of the exhaustive method. Finally, physical interpretations are presented to support our conclusions.
1 January 2021 in Signal Processing
1 November 2022 in IEEE Transactions on Aerospace and Electronic Systems
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 $Q$ 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 $l_{2}$ -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 $Q$ channels or reduce the number of channels while guaranteeing MTT performance, compared with the traditional random channel allocation scheme.