A Task Scheduling Algorithm for Phased-Array Radar Based on Dynamic Three-Way Decision

Abstract

The time resource management of phased-array radars is the key to fulfilling their performance, such as how phased-array radar can efficiently and reasonably schedule tasks under limited resources. Therefore, this paper proposes a task scheduling algorithm for phased-array radar based on dynamic three-way decision. The algorithm introduces three-way decision into the scheduling algorithm and divides the target into three threat areas according to the threat degree (i.e., threat area, nonthreat area, and potential threat area). Different threat domains are assigned different weights and combine the working mode and the task deadline to carry out comprehensive priority planning, so that the radar can reasonably allocate time according to the difference of the target threat level and the threat area in the tracking stage. In addition, an improved adaptive threshold algorithm is proposed to obtain a dynamic three-way decision to achieve the adaptation of the algorithm. A set of performance indicators have been defined to evaluate the algorithm. The relevant experiments have demonstrated that the proposed algorithm can effectively improve the processing capability of phased-array radars when dealing with high-threat targets.

Phased-Array Radar Task Scheduling Method for Hypersonic-Glide Vehicles

“…(3) Check if the current prescheduling task request queue is empty. If not empty, go to step (4); otherwise, go to step (7).…”

“…(6) Determine whether the end condition is satisfied; if the end condition is not satisfied, jump to step (2) to continue the iteration. Otherwise, jump to step (7). (7) Check the feasibility of the optimal solution, that is, whether the optimal solution satisfies the three constraints.…”

“…Otherwise, jump to step (7). (7) Check the feasibility of the optimal solution, that is, whether the optimal solution satisfies the three constraints. If not satisfied, go to step (8).…”

“…Different scheduling schemes constitute alternative branches, and the final scheduling scheme was determined by deleting the branches with lower utility functions. According to the threat level of the target, references [6], [7] used a three-way decision method to divide the target into threat targets, nonthreat targets, and potential threat targets, and set different dwell times for each type of target to improve the time resource utilization rate of radar task scheduling. References [8]- [10] made full use of the waiting period between the transmitting pulse and receiving pulse of the phased-array radar, and designed a pulse interleaving scheduling algorithm, which improves the time resource utilization and scheduling success rate of the radar.…”

“…The quantization function of task time offsetIn(7), the quantization function of the task time offset is taken as the probability density function of the normal distribution. When the scheduling interval is 50 ms, the quantization function is shown inFig.5.…”