Phased array radar beam residence scheduling method based on improved time pointer

Abstract

The invention specifically relates to a phased array radar beam residence scheduling method based on an improved time pointer, and belongs to the technical field of phased array radar resource management. Firstly, an adaptive beam residence scheduling method based on a time pointer under a phased array radar is introduced into an alternative list so as to improve the time utilization rate of a system and the scheduling success rate of radar tasks. Particularly, when the number of the tasks in the previous scheduling interval is small and the number of the tasks in the next scheduling interval is large in the tasks in the two adjacent scheduling intervals, greater advantages can be exerted. Meanwhile, in consideration of an expected execution moment criterion, a time offset rate comparison link is added before task scheduling, and a non-general task with a small time offset rate is selected for execution of two tasks with the first two comprehensive priorities in all tasks which can be executed at the current moment. According to the method, the time utilization rate and the task scheduling success rate can be improved, the average time migration rate is reduced, the calculation complexity is small, and the real-time performance can be guaranteed.

Description

Technical Field

[0001] The present invention relates to the field of radar system resource management, and particularly to a phased array radar beam dwell scheduling method based on an improved time pointer. Background Art

[0002] Compared with the system structure of traditional radars, the biggest highlight of phased array radars is their electronically scanned antennas, which are different from traditional radars. Their scanning range can be adaptively changed according to actual working requirements, and they have the characteristics of multi-task collaborative processing ability and flexible switching of working modes. Due to the flexible beam pointing, phased array radars can perform multiple tasks such as target search, verification, tracking, and guidance. Due to the diversity of tasks, there are situations where multiple tasks compete for the same time segment to request execution. This requires us to determine how to schedule task requests based on the request parameters and time resource constraints of different tasks, so as to optimize the time resource utilization rate and task scheduling execution rate of phased array radars.

[0003] Optimizing the task scheduling strategy and improving the scheduling performance are the basis for phased array radars to meet complex environments and exert their powerful performance, and have gradually become one of the core issues in the design of resource management systems. Currently, the adaptive scheduling strategy has gradually become the main aspect of task scheduling research because it can dynamically meet complex environments and changing task requirements. For the selection of phased array radar beam dwell scheduling strategies, it started from the fixed template method scheduling strategy and gradually developed to the multi-template method and the partial template method, with increasing flexibility. Subsequently, the phased array radar beam dwell scheduling method has evolved towards the adaptive beam dwell scheduling algorithm. The execution of phased array radar tasks is to form a beam in a certain direction for irradiation, and there is a certain dwell time. The beam dwell is the specific execution form of radar tasks.

[0004] There are various adaptive beam dwell scheduling algorithms. For example, the most traditional adaptive beam dwell scheduling algorithm is an algorithm that performs "task selection time" based on the priority of the request list. There is also an adaptive beam dwell scheduling algorithm based on the genetic algorithm, which applies the genetic algorithm simulation to radar adaptive task scheduling. There is also the traditional time-pointer-based adaptive beam dwell scheduling algorithm, which is an algorithm that performs "time selection task" based on the time pointer. Radar tasks need to occupy time resources, and time conflicts may occur between different task requests. The essence of these algorithms is to process the task request list to obtain the actual execution list and achieve higher benefits.

[0005] The adaptive beam dwell scheduling method based on a time pointer can achieve a relatively high utilization ratio of time resources and has good timeliness. However, in the traditional phased array radar beam dwell scheduling method based on a time pointer, only the task analysis is performed for the scheduling interval where the time pointer is located. If the task distribution is uneven, it is easy to result in insufficient utilization of time resources, causing waste of time resources, low success rate of task scheduling, and large average time offset rate, thus affecting the benefits of radar task execution. In addition, for the tasks of phased array radar, especially verification and tracking tasks, when the deviation between the expected execution time and the actual execution time is large, that is, the time offset rate is large, the tracking accuracy of the target will also decrease accordingly, which may trigger the "loss of tracking" phenomenon.

[0006] It should be noted that the information disclosed in the above background art section is only used to enhance the understanding of the background of the present invention, and thus may include information that does not constitute the prior art known to those of ordinary skill in the art. Summary of the Invention

[0007] The present invention provides a phased array radar beam dwell scheduling method based on an improved time pointer, which is used to solve the problems in the traditional phased array radar beam dwell scheduling method based on a time pointer, such as insufficient utilization of time resources, low success rate of task scheduling, and large average time offset rate, thus affecting the benefits of radar task execution.

[0008] Other features and advantages of the present invention will become apparent through the following detailed description, or be learned in part through the practice of the present invention.

[0009] According to the first aspect of the present invention, there is provided a phased array radar beam dwell scheduling method based on an improved time pointer, the method comprising:

[0010] Determine a task request list T and initialize a time pointer;

[0011] Delete tasks or form the task request list T at the current moment according to the relationship between the latest executable time, the earliest executable time of the tasks in the task request list T and the time pointer * ;

[0012] Calculate the comprehensive priority corresponding to each task in the task request list T at the current moment * Select the two tasks with the highest comprehensive priority, calculate the time offset rate; select tasks to be placed in the task execution list based on the time offset rate, and at the same time delete the selected tasks from the task request list T and update the time pointer;

[0013] When there is no task to be processed in the task request list T, tasks are taken from the radar total task list whose expected execution time is in the next scheduling interval, but the actual execution time can be in the current scheduling interval, to form the task alternative list T for the current scheduling interval + ;

[0014] Judge the task alternative list T + to check whether the earliest executable time of the tasks in it is less than or equal to the current time. If satisfied, take out the task to form the task alternative request list T at the current time +* ;

[0015] Calculate the comprehensive priority corresponding to each task in the task alternative request list T +* at the current time, select the two tasks with the highest comprehensive priority, and calculate the time offset rate of the two tasks respectively; select tasks based on the time offset rate and put them into the task execution list, and at the same time delete the selected tasks from the total task request list and update the time pointer; until the time pointer is greater than the current scheduling interval

[0016] In some exemplary embodiments, the method for determining the task request list T includes:

[0017] For the currently ongoing scheduling interval [t0, t0 + SI], take out all tasks from the radar total task list whose expected execution time wt i is within this scheduling interval, that is, the expected execution time wt i satisfies the following formula;

[0018] t0 ≤ wt i <t0 + SI

[0019] where t0 is the start time of the current scheduling interval and SI is the length of the scheduling interval;

[0020] Assume that there are Q tasks satisfying the above formula, then these Q tasks form the task request list T = T1, T2, …, T Q Apply for scheduling.

[0021] In some exemplary embodiments, deleting tasks or forming the task request list T at the current time according to the relationship between the latest executable time, the earliest executable time and the time pointer of the tasks in the task request list T * , includes:

[0022] Judge whether the latest executable time of the tasks in the task request list T is less than the time pointer. If satisfied, put the task into the delete task list;

[0023] Determine whether the earliest executable time of the task in the task request list is less than or equal to the time pointer and whether the latest executable time is greater than or equal to the time pointer. If satisfied, take out the task to form the task request list T at the current moment. * 。

[0024] In some exemplary embodiments, the latest executable time is the sum of the expected execution time and the time window; the earliest executable time is the difference between the expected execution time and the time window.

[0025] In some exemplary embodiments, the selecting tasks based on the time offset rate and putting them into the task execution list includes:

[0026] If the task with a smaller time offset rate is a general task and its comprehensive priority is not the highest, put the task with the highest comprehensive priority into the task execution list; otherwise, put the task with a smaller time offset rate into the task execution list; wherein, the general task is set manually.

[0027] In some exemplary embodiments, the updating the time pointer includes:

[0028] Set the actual execution time to the moment pointed to by the current time pointer.

[0029] In some exemplary embodiments, the method further includes:

[0030] When the time pointer is greater than the scheduling interval, put the tasks that are not executed in the current scheduling interval and meet the delay conditions into the delay list.

[0031] According to the second aspect of the present invention, there is provided a storage medium, on which a computer program is stored, and when the computer program is executed by a processor, it implements the phased array radar beam dwell scheduling method based on the improved time pointer described in the first aspect above.

[0032] According to the third aspect of the present invention, there is provided a computer program product, on which a computer program is stored, and when the computer program is executed by a processor, it implements the phased array radar beam dwell scheduling method based on the improved time pointer described in the first aspect above.

[0033] According to the fourth aspect of the present invention, there is provided an electronic device, including:

[0034] A processor; and

[0035] A memory for storing executable instructions of the processor;

[0036] Wherein, the processor is configured to implement the phased array radar beam dwell scheduling method based on the improved time pointer described in the first aspect above when executing the executable instructions.

[0037] The phased array radar beam dwell scheduling method based on an improved time pointer provided by the embodiments of the present invention improves the traditional phased array radar beam dwell scheduling method based on a time pointer. The purpose of adding an alternative list is to make more full use of time resources, enable more tasks to enter the execution list from the request list, improve the scheduling success rate, and the purpose of adding a link to compare the time offset rate before scheduling is to reduce the average time offset rate, so that the benefits of the finally executed radar tasks are higher.

[0038] Specifically as follows:

[0039] 1. The present invention adds an alternative list between the task execution list, delay list, and deletion list of the traditional phased array radar beam dwell scheduling method based on a time pointer. For tasks in two adjacent scheduling intervals, when there are fewer tasks in the previous scheduling interval and more tasks in the next scheduling interval, there will be a phenomenon in the final scheduling result that there is idle time in the previous scheduling interval, and the tasks in the next scheduling interval are delayed or deleted due to limited time resources, resulting in a waste of time resources and a low task scheduling rate. The existence of the alternative list enables the remaining idle time to be used by the tasks in the next scheduling interval when the tasks in the previous scheduling interval are completed. The improved method can improve the utilization rate of time resources and the success rate of radar task scheduling.

[0040] 2. The present invention adds a link to compare before scheduling on the basis of the traditional phased array radar beam dwell scheduling method based on a time pointer, considering the expected execution time criterion. Extract the two tasks with the highest comprehensive priority among the tasks that can be scheduled at the current moment, add the time offset rate to the scheduling link, compare the expected execution times of the two tasks with the highest comprehensive priority with the current moment, and select the non-general task with a smaller time offset rate for scheduling, which can make the actual execution time of the tasks scheduled at the current moment closer to the expected execution time. This method can effectively reduce the average time offset rate and the task scheduling obtains higher real-time performance.

[0041] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and cannot limit the present invention. Description of the Drawings

[0042] The drawings here are incorporated into the specification and constitute a part of this specification, showing embodiments in line with the present invention, and are used together with the specification to explain the principles of the present invention. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0043] Figure 1 It is a schematic diagram of task requests for beam dwell scheduling;

[0044] Figure 2 Schematic diagram for comparing the improved method and the traditional method of the present invention;

[0045] Figure 3 Schematic diagram of the phased array radar beam dwell scheduling method based on the improved time pointer according to an exemplary embodiment of the present invention;

[0046] Figure 4 Comparison chart of the time utilization rate (SSR) between the method of the exemplary embodiment of the present invention and the traditional method;

[0047] Figure 5 Comparison chart of the time utilization rate (TUR) between the method of the exemplary embodiment of the present invention and the traditional method;

[0048] Figure 6 Comparison chart of the average time shift rate (ASTR) between the method of the exemplary embodiment of the present invention and the traditional method. Detailed implementation manners

[0049] Example embodiments will now be described more fully with reference to the accompanying drawings. However, the example embodiments can be implemented in various forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The features, structures, or characteristics described may be combined in any suitable manner in one or more embodiments.

[0050] In addition, the accompanying drawings are only schematic illustrations of the present invention and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repeated description will be omitted. Some of the block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in the form of software, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

[0051] In the prior art, a real-time phased array radar beam dwell scheduling method based on dual time pointers was proposed. First, a separation point was set within the scheduling interval, and a beam dwell scheduling method based on time pointers was respectively used when performing tasks on both sides of the separation point, constituting a dual time pointer scheduling method. Among the beam dwell scheduling sequences obtained under different separation points, the task scheduling sequence with the minimum cost was selected as the final scheduling result. This is also a method for obtaining an execution list based on the time pointer algorithm, but it uses the method of merging after adopting dual time pointers.

[0052] In the prior art, a real-time phased array radar beam dwell scheduling method based on heuristic backtracking is also proposed. First, the actual execution task queue, delayed task queue, and deleted task queue within the current scheduling interval are determined through a time pointer, ensuring the importance and urgency criteria in beam dwell scheduling. Subsequently, the actual execution time of the tasks in the actual execution task queue is adjusted by the heuristic backtracking method. However, this method processes the obtained execution queue and only uses a scheduling algorithm based on the time pointer to obtain the execution queue. The focus of the present invention is on how to obtain the execution queue during this process and improve the scheduling algorithm based on the time pointer.

[0053] In the traditional phased array radar beam dwell scheduling method based on the time pointer, problems such as insufficient utilization of time resources, low success rate of task scheduling, and large average time offset rate will occur, thus affecting the benefits of radar task execution.

[0054] The phased array radar beam dwell scheduling method of the present invention is a method for adaptively scheduling the beam dwell tasks requested to be executed by the phased array radar. The radar has multiple tasks to execute, such as confirmation tasks, precision tracking tasks, search tasks, etc. Task execution requires a certain beam dwell time, and task requests may conflict in time. Not all tasks will be executed, so it is necessary to process the task request list to obtain a task execution list with higher benefits.

[0055] As Figure 1 shown, for the tasks in two adjacent scheduling intervals, when there are fewer tasks in the previous scheduling interval and more tasks in the next scheduling interval, there will be idle time in the previous scheduling interval in the final scheduling result, and the tasks in the next scheduling interval will be delayed or deleted due to limited time resources and busy tasks. As Figure 3 shown, in addition to establishing an execution task list, a delay list, and a deletion list in the traditional phased array radar beam dwell scheduling method based on the time pointer, the present invention also adds an alternative list. Due to the existence of a time window in the task parameters, for tasks with an expected execution time in the next scheduling interval, their actual execution time can be advanced to the previous scheduling interval. The alternative list stores the tasks with an expected execution time in the next scheduling interval and whose actual execution time can be advanced to the previous scheduling interval. The existence of the alternative list enables the remaining idle time to be used by the tasks in the next scheduling interval when the tasks in the previous scheduling interval are completed.

[0056] The traditional time-pointer algorithm schedules the task with the highest comprehensive priority at the current moment, which may lead to a large deviation between the actual execution time and the expected execution time of the task. Considering the expected execution time criterion, the present invention adds a comparison link before scheduling on the basis of the traditional time-pointer algorithm. Instead of directly selecting the task with the highest comprehensive priority among the tasks that can be scheduled at the current moment in the traditional method for direct scheduling, the present invention extracts the two non-ordinary tasks with the highest comprehensive priority among the tasks that can be scheduled at the current moment, compares the expected execution time of these two tasks with the current moment, and selects the task with a smaller time offset rate for scheduling, so that the actual execution time of the task scheduled at the current moment is closer to the expected execution time, thereby achieving a lower average time offset rate in turn.

[0057] Suppose there is a task request list T = T1, T2, …, T within the current scheduling interval [t0, t0 + SI]. Q Applying for scheduling, where t0 is the start time of the current scheduling interval, SI is the length of the scheduling interval, then t0 + SI is the end time of the current scheduling interval. The resident task model is T i = [ID, p i , wt i , Δt i , lt i , η i , st i , where ID is the task identifier, and each task has a different ID. P i is the working mode priority corresponding to the task type of this task, wt i is the expected execution time of the task, Δt i is the resident duration of the task, lt i is the time window of the task. η i is the scheduling attribute of the task. Initially, η i = 0, and η i is modified to 1 when the task is executed, and η i is modified to -1 when the task is deleted. st i is the actual execution time of the task, which is generated when the scheduling module schedules the task into the execution list.

[0058] In this exemplary embodiment, a phased array radar beam dwell scheduling method based on an improved time pointer is provided. First, in the traditional phased array radar beam dwell scheduling method based on the time pointer, in addition to establishing a task execution list, a delay list, and a deletion list, an alternative list is newly added, so that the idle time can be more fully utilized, improving the utilization rate of system time resources and the success rate of radar task scheduling. In addition, before the task scheduling is put into the execution list in the traditional phased array radar beam dwell scheduling method based on the time pointer, a pre-scheduling comparison link is added, and the task with a smaller time offset rate among the top two tasks with the highest comprehensive priority at the current moment is selected for scheduling execution, reducing the average time offset rate, and the calculation amount is small, and higher real-time performance can be obtained.

[0059] Reference Figure 3 As shown, the following steps may be specifically included:

[0060] Step 1: For the current scheduling interval [t0, t0 + SI], take out the expected execution time wt i of all tasks within this scheduling interval, that is, the expected execution time wt i satisfies formula (1). Assuming that there are a total of Q tasks that satisfy formula (1), then these Q tasks form a request list T = T1, T2,..., T Q for scheduling application.

[0061] t0 ≤ wt i <t0 + SI (1)

[0062] Step 2: Initialize the time pointer tp = max(t0, st end + Δt end ), where st end + Δt end is the moment when the last task in the previous scheduling interval is executed, st end is the execution moment of the last task in the previous scheduling interval, and Δt end is the dwell duration.

[0063] Step 3: For the tasks in the task request list T with the latest executable time, that is, the tasks that satisfy formula (2) and the sum of the expected execution time and the time window is less than the time pointer tp, set their scheduling attribute η i = -1, indicating that these tasks can no longer be executed, and put them into the deletion task list, and continue with Step 4.

[0064] wt i + lt i <tp (2)

[0065] Step 4: Determine whether all tasks in the task request list T have been processed.

[0066] If not, determine whether there is a task in the task request list T that satisfies formula (3), that is, the earliest executable time of the task is less than or equal to the current time tp, and the latest executable time of the task is greater than or equal to the current time tp. If not, it indicates that there is no task to be executed at the current time. Let tp = tp + 1 and go to step 6; if there is, take out all the eligible tasks to form the task request list at the current time Continue with step 5;

[0067] wt i -lt i ≤tp≤wt i +lt i (3)

[0068] If so, take out the tasks from the radar total task list whose expected execution time is in the next scheduling interval but whose actual execution time can be in the current scheduling interval, that is, the tasks that satisfy formula (4). Take out all the eligible tasks. Assume that there are X tasks that satisfy formula (4) to form the task alternative list for the current scheduling interval Judge whether X is 0. If X = 0, it indicates that there is no task to be executed in the current scheduling interval, and end the task scheduling for the current scheduling interval [t0, t0 + SI]. Otherwise, go to step 7

[0069]

[0070] Step 5: For the task request list T at the current time * First calculate the comprehensive priority P corresponding to each task according to formula (5) i , where is the serial number of the tasks in T * sorted from high to low according to the working mode priority P i . The larger the working mode priority P i , the larger . is the serial number of the tasks in T * sorted from near to far according to the deadline. The smaller the interpolation between the deadline and the current time tp, the larger .

[0071]

[0072] Then select the two tasks with the highest comprehensive priority and calculate the time skew rate TSR of the two tasks respectively according to formula (6).

[0073]

[0074] If the task with the smaller time skew rate TSR is a general task and its comprehensive priority is not the highest, the task with the highest comprehensive priority is still Tex , put it into the task execution list; otherwise, the task with a smaller time shift rate TSR is T ex , put it into the task execution list. In this embodiment, the tasks include four task types: verification, precise tracking, ordinary tracking, and search. Among them, verification, precise tracking, and ordinary tracking are non-general tasks, and search is a general task.

[0075] At the same time, set the actual execution time st ex to the moment pointed to by the current time pointer tp, update the time pointer tp, modify the parameters as shown in equation (7), and delete the task from the task request list T, then continue with step 6;

[0076]

[0077] where, Δt ex is the dwell time of the executed task.

[0078] Step 6: When the time pointer tp ≥ t0 + SI, end the task scheduling for the current scheduling interval [t0, t0 + SI], and put the tasks that are not executed in the current scheduling interval and meet the delay conditions into the delay list, otherwise go to step 3.

[0079] Step 7: Judge whether there is a task in the task alternative list T + that satisfies equation (8), that is, the earliest executable time of the task is less than or equal to the current time tp. If not, it means that there is no task to be executed at the current moment, let tp = tp + 1 and go to step 9; if there is, take out all the eligible tasks to form the task alternative request list at the current moment Continue with step 8.

[0080] wt i -lt i ≤ tp (8)

[0081] Step 8: For the task alternative request list T at the current moment +* , first calculate the comprehensive priority P corresponding to each task according to equation (5) i . Then select the two tasks with the highest comprehensive priority, and calculate the time shift rates of the two tasks respectively according to equation (6). If the task with a smaller time shift rate TSR is a general task and its comprehensive priority is not the highest, then still take the task with the highest comprehensive priority as T ex , put it into the task execution list; otherwise, take the task with a smaller time shift rate TSR as T ex , put it into the task execution list. At the same time, set the actual execution time st ex to the moment pointed to by the current time pointer tp, update the time pointer tp, modify the parameters as shown in equation (7), and delete the task from the total task request list;

[0082] Step 9: When the time pointer tp ≥ t0 + SI, end the task scheduling for the current scheduling interval [t0, t0 + SI]; otherwise, go to Step 7.

[0083] The phased array radar beam dwell scheduling method based on an improved time pointer provided by the present invention is an improvement on the existing traditional beam dwell scheduling method based on a time pointer. Compared with the traditional method, an alternative list is newly added. The purpose of adding the alternative list is to make more full use of time resources, enabling more tasks to enter the execution list from the request list, improving the scheduling success rate. Specifically, in the "if" part of the judgment in Step 4, it needs to satisfy equation (4), which can reduce the waste of idle time at the end of the scheduling interval and utilize this time to execute more tasks. Therefore, the task scheduling success rate is also improved. In contrast, the utilization rate of time resources and the task scheduling success rate are increased. Especially when there are fewer tasks in the previous scheduling interval and more tasks in the next scheduling interval among the tasks in two adjacent scheduling intervals, the advantages are more obvious. Specifically, as Figure 2 shown, when the tasks in scheduling interval 1 are completed but there is still idle time at the end, the existing traditional method will continue to execute from the next scheduling interval 2, resulting in waste of idle time. The improved method adds an alternative list, enabling the idle time of scheduling interval 1 to be continued to be used to execute the tasks of scheduling interval 2.

[0084] Compared with the traditional method, a link for comparing the task time offset rate before scheduling is added. The purpose of adding the link for comparing the time offset rate before scheduling is to reduce the average time offset rate, making the benefits of the finally executed radar tasks higher. Specifically, in Step 5, equation (6) is calculated, and the task with a smaller time offset rate among the two tasks with the highest comprehensive priority is selected for scheduling execution. In contrast, such processing will reduce the average time offset rate of the tasks finally entering the execution list, which is the advantage.

[0085] In addition, this processing method does not require overly complex calculations and has good real-time performance.

[0086] Next, the method of the embodiment of the present invention and the traditional method are compared and described through simulation. In the simulation scenario, four task types of verification, precision tracking, ordinary tracking, and search are considered. For more intuitive observation and comparison, the simulation time is set to 500 ms, and the ratio of the number of tasks of the four types of tasks of confirmation, precision tracking, ordinary tracking, and search is set to 1:2:3:4.

[0087] Table 1. Radar beam dwell task parameter table

[0088]

[0089] The time utilization rate is defined as the ratio of the sum of the residence durations of successfully scheduled and executed tasks to the total duration. The task scheduling success rate is defined as the ratio of the number of successfully scheduled and executed radar tasks to the total number of all requested scheduled tasks. The average time offset rate is defined as the average of the ratios of the offsets between the actual execution times and the expected execution times of all successfully scheduled and executed tasks to the time windows of those tasks.

[0090] To comprehensively evaluate the performance of the present invention, the task scheduling success rate (SSR), the time utilization rate (TUR), and the average time offset rate (ASTR) are used as performance evaluation indicators, and the above indicators are defined as follows:

[0091] The task scheduling success rate (SSR) is defined as the ratio of the number of successfully scheduled and executed radar events to the total number of all requested scheduled events.

[0092] SI = N / M (9)

[0093] Where N is the total number of successfully scheduled and executed radar events, and M is the total number of all requested scheduled events.

[0094] The time utilization rate (TUR) is defined as the ratio of the sum of the residence durations of successfully scheduled and executed tasks to the total simulation duration.

[0095]

[0096] Where t is the total simulation duration, and Δt i is the time residence length of the i-th successfully scheduled task.

[0097] The average time offset rate (ASTR) is defined as the average of the ratios of the offsets between the actual execution times and the expected execution times of all successfully scheduled and executed tasks to the time windows of those tasks.

[0098]

[0099] Where N is the total number of successfully scheduled tasks, wt i and st i are the expected execution time and the actual execution time of the i-th successfully scheduled task respectively, and lt i is the time window length of the i-th scheduled task.

[0100] The proposed adaptive task scheduling method based on the improved time pointer of the present invention is compared with the traditional adaptive task scheduling method based on the time pointer, and 100 Monte Carlo experiments are carried out. Figures 4 to 6 It is a comparison chart of the statistical results under three different indicators.

[0101] Figure 4is the task scheduling success rate curve, which reflects whether the requested radar tasks are executed as much as possible. When the number of tasks is small, both the traditional method and the improved method can execute all tasks; when the number of tasks increases, the improved method executes more tasks than the traditional method, because the improved method will obtain the alternative list to continue task scheduling when the task requested in the current scheduling interval is processed; when the number of tasks increases to a certain extent, the task scheduling success rates of the improved method and the traditional method tend to be consistent, because at this time the number of tasks requested to be executed is large, and the previous scheduling interval has fewer opportunities to execute the alternative list. If there are more cases in which the tasks in the previous scheduling interval are small and the tasks in the next scheduling interval are large in the tasks of two adjacent scheduling intervals, the difference in task scheduling success rate between the improved method and the traditional method can be more intuitively seen.

[0102] Figure 5 is the time utilization curve, which reflects whether the time resources are fully utilized as much as possible. When the number of tasks is small, both the traditional method and the improved method can execute all tasks, and the time utilization is basically fixed; when the number of tasks increases, the time utilization of the improved method is higher than that of the traditional method, because the improved method will continue to process the tasks in the alternative list when there is free time after the task request in the current scheduling interval is completed, making full use of the free time; when the number of tasks increases to a certain extent, the time utilization of the improved method and the traditional method tends to be consistent, because at this time the number of tasks requested for execution is large and the free time is almost 0. If there are more cases in which the tasks in the previous scheduling interval are small and the tasks in the next scheduling interval are large in the tasks of two adjacent scheduling intervals, the difference in time resource utilization between the improved method and the traditional method can be more intuitively seen.

[0103] Figure 6 is the average time deviation rate curve, which reflects whether the actual execution time of the scheduled task is as close to the expected execution time as possible. When the number of tasks is small, there are fewer scheduling conflicts between tasks in time, so the improved method is closer to the traditional method. When the number of tasks increases, it can be clearly found that the average time deviation rate of the improved method is lower than that of the traditional method. This is because the traditional method does not consider the expected time criterion when scheduling, while the improved method takes the expected time criterion into account and adds a comparison link before scheduling, thereby reducing the time deviation rate.

[0104] In summary, compared with the scheduling method based on traditional time pointers, the method proposed in the present invention can make better use of time resources and achieve a higher task scheduling success rate. It also takes into account the expected time criteria, has a lower time offset rate, and has a small amount of calculation, thus ensuring the real-time nature of the scheduling analysis.

[0105] It should be noted that, on the other hand, the present application also provides a storage medium, which may be included in an electronic device; or may exist alone without being assembled into the electronic device. The above storage medium carries one or more programs, and when the above one or more programs are executed by an electronic device, the electronic device implements the methods described in the following embodiments. For example, the electronic device may implement the steps of the method as shown in Figure 1 each step of the method shown.

[0106] In one embodiment, the present application provides a computer program product, including a computer program, which when executed by a processor implements the steps in the above method embodiments.

[0107] In addition, the above drawings are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present invention, rather than for limiting purposes. It is easy to understand that the processes shown in the above drawings do not indicate or limit the time sequence of these processes. Additionally, it is also easy to understand that these processes may be executed synchronously or asynchronously in, for example, multiple modules.

[0108] Those skilled in the art will readily think of other embodiments of the present invention after considering the specification and practicing the invention herein. The present application aims to cover any variations, uses, or adaptations of the present invention, which follow the general principles of the present invention and include common general knowledge or conventional technical means in the technical field not disclosed by the present invention. The specification and embodiments are only regarded as exemplary, and the true scope and spirit of the present invention are pointed out by the claims.

[0109] It should be understood that the present invention is not limited to the exact structures described above and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present invention is only defined by the appended claims.

Claims

1. A phased array radar beam dwell scheduling method based on improved time pointer, characterized in that: The method comprises: Determine the task request list T and the initialization time pointer; According to the relationship between the latest executable time, the earliest executable time and the time pointer of the task in the task request list T, the task is deleted or the current task request list T is formed. * ; Calculate the current task request list T * The comprehensive priority corresponding to each task, select the two tasks with the highest comprehensive priority, and calculate the time offset rate; select tasks based on the time offset rate and put them into the task execution list, and delete the selected tasks from the task request list T and update the time pointer; When there is no pending task in the task request list T, take out the tasks whose expected execution time is in the next scheduling interval but whose actual execution time can be in the current scheduling interval from the radar total task list to form the task candidate list T of the current scheduling interval. + ; Judgment task candidate list T + Is the earliest executable time of the task in the current time less than or equal to the current time? If so, the task is taken out to form the current time task candidate request list T +* ; Calculate the current task candidate request list T +* According to the comprehensive priority of each task in the task list, the two tasks with the highest comprehensive priority are selected, and the time offset rate of the two tasks is calculated respectively; tasks are selected based on the time offset rate and put into the task execution list, and the selected tasks are deleted from the total task request list and the time pointer is updated; until the time pointer is greater than the current scheduling interval.

2. The phased array radar beam dwell scheduling method based on improved time pointer according to claim 1 is characterized in that: The method for determining the task request list T includes: For the currently ongoing scheduling interval [t0, t0+SI], take the expected execution time wt from the radar total task list i All tasks within the scheduling interval, that is, the expected execution time wt i Satisfy the following formula; t0≤wt i <t0+SI Where t0 is the start time of the current scheduling interval, and SI is the length of the scheduling interval; Assuming that there are Q tasks that satisfy the above formula, the Q tasks form a task request list T = T1, T2, ..., T Q Request scheduling.

3. The phased array radar beam dwell scheduling method based on improved time pointer according to claim 1, characterized in that: The task request list T is deleted or formed according to the relationship between the latest executable time, the earliest executable time and the time pointer of the task in the task request list T. * ,include: Determine whether the latest executable time of the task in the task request list T is less than the time pointer. If so, put the task into the deleted task list; Determine whether the earliest executable time of the task in the task request list is less than or equal to the time pointer and whether the latest executable time is greater than or equal to the time pointer. If so, take out the task to form the current task request list T * .

4. The phased array radar beam dwell scheduling method based on improved time pointer according to claim 3 is characterized in that: The latest executable time is the sum of the expected execution time and the time window; the earliest executable time is the difference between the expected execution time and the time window.

5. The phased array radar beam dwell scheduling method based on improved time pointer according to claim 1, characterized in that: The step of selecting tasks based on the time offset rate and putting them into the task execution list includes: If the task with a smaller time offset rate is a general task and its comprehensive priority is not the highest, the task with the highest comprehensive priority is placed in the task execution list, otherwise the task with a smaller time offset rate is placed in the task execution list; among them, the general task is set manually.

6. The phased array radar beam dwell scheduling method based on improved time pointer according to claim 1, characterized in that: The updating time pointer includes: Set the actual execution time to the moment indicated by the current time pointer.

7. The phased array radar beam dwell scheduling method based on improved time pointer according to claim 1, characterized in that: The method further comprises: When the time pointer is greater than the scheduling interval, the tasks that have not been executed in the current scheduling interval and meet the delay conditions are put into the delay list.

8. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the phased array radar beam dwell scheduling method based on an improved time pointer is implemented as claimed in any one of claims 1 to 7.

9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the phased array radar beam dwell scheduling method based on an improved time pointer according to any one of claims 1 to 7 is implemented.

10. An electronic device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to execute the phased array radar beam dwell scheduling method based on improved time pointer according to any one of claims 1 to 7 by executing the executable instructions.

Images