This paper addresses the problem of joint node selection and power allocation for phased array radar network in maneuvering multi-target tracking under non-ideal detection. Based on the objective of minimizing the total transmission power of all radar nodes while satisfying the target tracking accuracy thresholds and the given system resource constraints, a joint optimization problem model under non-ideal detection condition is established. A closed-form analytical expression for the predicted conditional Cramér–Rao lower bound (PC-CRLB) is derived, which is used as a measure of multi-target tracking accuracy under non-ideal detection. To tackle the nonlinear and non-convex optimization problem, a cyclic iterative framework based on a relaxed interior point method and a heuristic signal-to-noise ratio (SNR)-based initial point selection algorithm is adopted, and a joint node selection and power allocation under non-ideal detection (JNSPA-NID) scheme is proposed. Simulation results indicate that the proposed algorithm effectively reduces the total transmission power of the system while meeting the specified multi-target tracking accuracy requirements under non-ideal detection conditions compared to other comparative algorithms.

Adaptive dwell scheduling is essential to achieve full performance for a simultaneous multi-beam radar system. The dwell scheduling for such a radar system considering desired execution time criterion is studied in this paper. The primary objective of this model is to achieve maximum scheduling gain and minimum scheduling cost while adhering to not only time, aperture, and frequency constraints, but also electromagnetic compatibility (EMC) constraint. The dwell scheduling algorithm is proposed to solve the above optimization problem, where several separation points are set on the timeline, so that each separator divides the scheduling interval into two sides. For the two sides, the dual-side time pointers are introduced, which move from the separator to both ends of the scheduling interval. The dwell tasks are analyzed in sequence at each analysis point based on their two-level synthetical priority. These tasks are then executed simultaneously by sharing the whole aperture under various constraints to accomplish multiple tasks concurrently. The above process is respectively conducted at each separator, and the final scheduling result is the one with the minimal cost among all. Simulation results prove that the proposed algorithm can achieve real-time dwell scheduling and outperform the existing algorithms in terms of scheduling performance.

Dwell scheduling is a key for phased array radar to realize multi-function and it becomes especially challenging in complex tactical situations. In this manuscript, a real-time radar dwell scheduling algorithm based on a unified pulse interleaving framework is proposed. A unified pulse interleaving framework that can realize pulse interleaving analysis for phased array radars with different receiving modes is put forward, which greatly improves the time utilization of the system. Based on above framework, a real-time two-stage approach is proposed to solve the optimization problem of dwell scheduling. The importance and urgency criteria are guaranteed by the first pre-schedule stage, and the desired execution time criterion is improved at the second stage with the modified particle swarm optimization (PSO). Simulation results demonstrate that the proposed algorithm has better comprehensive scheduling performance than up-to-date algorithms that consider the pulse interleaving technique for both single beam and multiple beams receiving modes. Besides, the proposed algorithm can realize dwell scheduling in realtime.