A recursive conflict reduction method and system for aerospace measurement and control resource scheduling

Abstract

The present invention relates to a recursive conflict reduction method and system for aerospace measurement and control resource scheduling. The method uses a heuristic algorithm based on the rule of first allocating the smallest available arc segment flexibility to allocate ground station equipment to each satellite's current work tasks according to the set of communicable time periods between each satellite and ground station equipment, thereby forming a solution space. In the case where there are work tasks that are not allocated to ground station equipment, the recursive conflict reduction strategy and task conversion strategy can effectively identify and reallocate the idle time periods of the ground station equipment, maximize the utilization efficiency of the ground station equipment, and improve the success rate of task scheduling.

Description

Technical Field

[0001] The present invention relates to the field of computer model technology, and in particular to a recursive conflict reduction method and system applied to aerospace measurement and control resource scheduling. Background Art

[0002] Since satellites are distributed in different orbits, while the position of ground measurement and control equipment is fixed, the communication time between satellites and measurement and control equipment is discontinuous, and the feasible solutions to the measurement and control tasks are therefore discrete, which increases the difficulty of finding the global optimal solution for aerospace measurement and control resource scheduling.

[0003] While traditional genetic algorithms can handle TT&C resource scheduling, they are only suitable for small-scale TT&C resource scheduling due to their high computational complexity and long runtime. When the number of TT&C equipment and satellite missions increases significantly, genetic algorithms become unable to effectively solve such large-scale scheduling problems within a limited timeframe.

[0004] In contrast, heuristic scheduling algorithms show higher efficiency when handling large-scale scheduling problems. However, existing heuristic algorithms have poor adaptability when faced with situations where a single measurement and control requirement includes multiple time-related tasks, making it difficult to meet actual needs. Summary of the Invention

[0005] The technical problem to be solved by the present invention is how to overcome the technical shortcomings of existing technologies, namely, the poor adaptability of heuristic algorithms when faced with a single measurement and control requirement involving multiple time-dependent tasks, making it difficult to meet actual needs. To overcome these shortcomings of the existing technologies, the present invention provides a recursive conflict reduction method and system for aerospace measurement and control resource scheduling, comprising a recursive conflict reduction method and a recursive conflict reduction system for aerospace measurement and control resource scheduling.

[0006] The present invention provides a recursive conflict reduction method for aerospace measurement and control resource scheduling, comprising the following steps:

[0007] S1: A heuristic algorithm based on the rule of first allocation with the least flexibility of available arc segments is used to allocate the current work tasks of each satellite to the ground station equipment according to the set of communicable time periods between each satellite and the ground station equipment, and based on the allocation results, it is determined whether the set of work tasks not allocated to the ground station equipment is empty.

[0008] If yes, proceed to step S4;

[0009] If not, proceed to the next step;

[0010] S2: Reassign each work task not assigned to the ground station device in the work task set not assigned to the ground station device through a recursive conflict reduction strategy, and then execute the next step;

[0011] S3: Adjust all work tasks assigned to ground station equipment through task conversion strategy to release idle communication time periods, and then execute the next step;

[0012] S4: Determine whether the completion rate of ground station equipment allocation exceeds a specified threshold.

[0013] If yes, then when the next task allocation time comes, the time is taken as the current time, and the work tasks that have not yet been allocated to the ground station equipment at this time are added to the current work tasks, and then the step S1 is executed again;

[0014] If not, the process returns to step S2.

[0015] The disclosed recursive conflict reduction method for aerospace tracking and control resource scheduling uses a heuristic algorithm based on the rule of first allocating the smallest available arc flexibility. This algorithm allocates ground station equipment to each satellite's current work tasks based on the set of communicable time periods between each satellite and ground station equipment, forming a solution space. For tasks that are not assigned to ground station equipment, the recursive conflict reduction strategy and task transformation strategy are implemented to effectively identify and reallocate idle time periods of ground station equipment (such as tracking and control equipment), maximizing the utilization efficiency of ground station equipment and improving the success rate of task scheduling. Furthermore, these two strategies can flexibly adjust the time of assigned and uncompleted tasks, expanding the solution space and avoiding task conflicts. This allows for more optimal scheduling of satellite work tasks under complex resource conditions, enhancing the flexibility and adaptability of the scheduling system. Compared with traditional genetic algorithms, the method of the present invention significantly reduces computational complexity, rapidly generates initial solutions and gradually optimizes them, improving task completion rates. It is particularly suitable for large-scale and complex aerospace tracking and control tasks, especially those with multiple time-correlated tasks, meeting the requirements of multi-task correlation and efficient scheduling.

[0016] In a possible implementation, the work tasks in step S1 include measurement control tasks and data transmission tasks; thereby, the practicality of the method can be improved by targeting the satellite's measurement control tasks and data transmission tasks.

[0017] In a possible implementation, step S1 includes the following steps:

[0018] S11: calling the data parsing module to parse the satellite orbit prediction file and the work task requirement file to obtain the current communication time period set between each satellite and the ground station equipment and the current work task requirement duration of each satellite;

[0019] S12: Counting the currently available resources and the quantity of each satellite in the set of communicable time periods obtained in step S11, wherein the currently available resources of the satellite are the currently available time periods in the set of communicable time periods between the satellite and the ground station equipment whose length is not less than the current working task requirement of the satellite;

[0020] S13: Based on the current required working time of each satellite obtained in step S11 and the current available resources and the amount thereof of each satellite obtained in step S12, a matching degree calculation formula is used to obtain the matching degree of the current available resources of each satellite, and the current priority of each satellite is obtained based on the principle that the smaller the number of currently available resources of the satellite, the higher the priority;

[0021] S14: obtaining the flexibility index of each satellite by using the current available resource quantity, the matching degree of the current available resources, and the current priority of each satellite through a flexibility index calculation formula, and obtaining the current ranking of the satellites in ascending order of the flexibility index;

[0022] S15: Based on the current available resources of each satellite obtained in step S12 and the current ranking of the satellites obtained in step S14, the current working tasks of each satellite are assigned to ground station equipment according to the allocation criteria, and according to the allocation result, it is determined whether the set of working tasks not assigned to the ground station equipment is empty.

[0023] If yes, proceed to step S4;

[0024] If not, execute step S2.

[0025] Through the above scheme, not only can the solution space be quickly generated to efficiently execute scheduling task allocation, but also the current number of available resources for each satellite, the matching degree of the current available resources and the current priority are comprehensively considered, and the flexibility index of the satellite established is more objective.

[0026] In a possible implementation, the matching degree calculation formula is as follows:

[0027] ,

[0028] Where,

[0029] Representative i The matching degree of the currently available resources of the satellites;

[0030] Representative i The number of satellites currently available resources;

[0031] Represents the currenti How long does it take for a satellite to perform its mission?

[0032] Representative i The current number of satellites j The length of the available resources.

[0033] The above calculation formula has the characteristics of low computational complexity and high operating efficiency when obtaining the matching degree of the satellite's currently available resources, and further ensures that the satellite's flexibility index is more objective.

[0034] In a possible implementation, the flexibility index is calculated as follows:

[0035] ,

[0036] Where,

[0037] 、 and represents the weight factor;

[0038] Representative i The flexibility index of the satellite;

[0039] Representative i The current priority of the satellite.

[0040] The above calculation formula not only comprehensively considers the current amount of available resources, the matching degree of the current available resources and the current priority of each satellite when obtaining the satellite flexibility index, but also adopts linear operation to reduce the computational complexity and reduce the cost.

[0041] In a possible implementation, step S15 includes the following steps:

[0042] S151: The satellite that is currently ranked first is used as the currently allocated satellite;

[0043] S152: Determine whether there are any unoccupied resources in the currently allocated satellite's available resources.

[0044] If so, unoccupied resources are retrieved from the currently available resources of the satellite, and the ground station equipment corresponding to the unoccupied resources is allocated to the currently allocated satellite to arrange the current working task of the satellite, and then the next step is executed;

[0045] If not, the current working task of the satellite is regarded as a working task that has not been assigned to the ground station equipment, and then the next step is executed;

[0046] S153: Determine whether all satellites in the current satellite sequence have been traversed.

[0047] If so, all work tasks not assigned to the ground station equipment are counted to obtain a set of work tasks not assigned to the ground station equipment;

[0048] If not, proceed to the next step;

[0049] S154: According to the current order of satellites, the next satellite is selected as the currently allocated satellite, and then the step S152 is executed again.

[0050] The above scheme is not only efficient in solving problems such as satellite mission resource allocation and time management, but also can obtain a relatively feasible solution within a reasonable time. It can be applied to preliminary planning in complex multi-task and multi-resource scenarios.

[0051] In a possible implementation, step S2 includes the following steps:

[0052] S21: Based on the current satellite ranking obtained in step S14, extracting the work task that is not assigned to the ground station device and has the highest satellite ranking from the set of work tasks that have not been assigned to the ground station device as the current task;

[0053] S22: Determine whether there is any available resource with a remaining length not less than the required duration of the current mission among all currently available resources of the satellite corresponding to the current mission.

[0054] If yes, the remaining part of the available resources is allocated to the current task, and then step S24 is executed;

[0055] If not, based on the current satellite ranking obtained in step S14, the last ranked task is extracted from all tasks that have occupied the currently available resources of the satellite corresponding to the current task, and then the next step is executed;

[0056] S23: Determine whether all work tasks not assigned to the ground station device in the work task set not assigned to the ground station device have been traversed.

[0057] If yes, the last work task extracted and sorted in step S22 is used as the work task not assigned to the ground station device to update the work task set not assigned to the ground station device, and then step S3 or the next step is executed;

[0058] If not, the last task extracted and sorted in step S22 is used as the current task, and then the process returns to step S22;

[0059] S24: Determine whether all work tasks not assigned to the ground station device in the work task set not assigned to the ground station device have been traversed.

[0060] If yes, execute step S3;

[0061] If not, the next work task that is not assigned to the ground station device in the current order of the satellite is extracted from the work task set that is not assigned to the ground station device as the current task, and then the step S22 is executed again.

[0062] The above-mentioned recursive conflict reduction strategy is used to reallocate each work task that is not assigned to the ground station device in the work task set that is not assigned to the ground station device, and reallocate the occupied time period to the idle time period, thereby reducing resource conflicts, releasing more high-quality time periods, and providing sufficient resource support for the execution of subsequent tasks.

[0063] In a possible implementation, step S3 includes the following steps:

[0064] S31: Determine whether there are any unoccupied resources among the currently available resources of all satellites.

[0065] If so, these unoccupied resources are integrated into a set of unoccupied resources, and then the next step is executed;

[0066] If not, execute step S4;

[0067] S32: taking an unoccupied resource from the set of unoccupied resources, setting the unoccupied resource as the current resource, and then executing the next step;

[0068] S33: Determine whether the current resource meets the conversion conditions of a work task that has been assigned to the ground station equipment.

[0069] If so, the current resource is allocated to the work task that has been assigned to the ground station equipment, and then the next step is executed;

[0070] If not, proceed to the next step;

[0071] S34: Determine whether all unoccupied resources in the set of unoccupied resources have been traversed.

[0072] If yes, execute step S4;

[0073] If not, an unoccupied resource is taken from the set of unoccupied resources, and this unoccupied resource is used as the current resource, and then the process returns to step S33.

[0074] The above-mentioned task conversion strategy can optimize the work tasks assigned to the ground station equipment, readjust the work tasks assigned to the ground station equipment to the convertible idle available time periods, and then try to arrange the work tasks in the nearest idle time periods, release more high-quality time periods, and increase the solution space to provide resources for the work tasks that are not assigned to the ground station equipment.

[0075] In a possible implementation, in step S33, if the current resources simultaneously meet the conditions of matching the time range of a work task assigned to a ground station device, having no resource conflicts and task constraints, then it is deemed to meet the conversion conditions of a work task assigned to a ground station device; thereby ensuring that the resource redistribution of the work task is reasonable.

[0076] Another technical solution of the present invention is to provide a recursive conflict reduction system for aerospace tracking and control resource scheduling, comprising:

[0077] A data parsing module is configured to receive satellite orbit prediction files and work task requirement files in real time, and parse the satellite orbit prediction files and work task requirement files to obtain a set of communication time periods between each satellite and the ground station equipment and a work task requirement duration for each satellite;

[0078] The recursive conflict reduction module is electrically connected to the data analysis module and is configured to execute the recursive conflict reduction method for aerospace measurement and control resource scheduling in the present invention.

[0079] The system disclosed in the present invention significantly reduces the computational complexity by setting a data parsing module and a data analysis module, parsing satellite orbit prediction files and work task requirement files through the data analysis module, and executing the recursive conflict reduction method for aerospace measurement and control resource scheduling in the present invention through the recursive conflict reduction module, thereby being able to quickly generate an initial solution and gradually optimize it, thereby improving the task completion rate. It is particularly suitable for large-scale and complex aerospace measurement and control tasks, especially for multiple time-related tasks, and meets the needs of multi-task association and efficient scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0080] Figure 1 This is a flow chart of a recursive conflict reduction method for aerospace tracking and control resource scheduling disclosed in Example 1 of this application;

[0081] Figure 2 This is a flow chart of step S1 disclosed in Example 1 of this application;

[0082] Figure 3 This is a flow chart of step S15 disclosed in Example 1 of this application;

[0083] Figure 4This is a flow chart of step S2 disclosed in Example 1 of this application;

[0084] Figure 5 This is the flow chart of step S3 disclosed in Example 1 of this application. DETAILED DESCRIPTION

[0085] First, those skilled in the art should understand that these embodiments are merely used to explain the technical principles of the embodiments of the present application and are not intended to limit the scope of protection of the embodiments of the present application. Those skilled in the art may adjust them as needed to suit specific application scenarios.

[0086] Two embodiments will be used below, and the present application will be further described in detail in conjunction with the accompanying drawings and specific embodiments.

[0087] Example 1:

[0088] See also Figure 1 The present application discloses a recursive conflict reduction method for aerospace tracking and control resource scheduling. Figure 1 Flowchart of the method, which includes the following steps:

[0089] S1: The heuristic algorithm of the minimum first allocation rule of available arc flexibility (Min-Flexibility) is used to allocate the current work tasks of each satellite to the ground station equipment according to the current communication time period set between each satellite and the ground station equipment, and the work task set that is not allocated to the ground station equipment is determined based on the allocation result.

[0090] If yes, proceed to step S4;

[0091] If not, execute step S2.

[0092] In this embodiment, the working tasks include measurement control tasks and data transmission tasks, and further, the ground station equipment includes measurement control equipment and data transmission equipment.

[0093] See also Figure 2 In this embodiment, step S1 includes the following steps:

[0094] S11: calling the data parsing module to parse the satellite orbit prediction file and the work task requirement file to obtain the current communication time period set between each satellite and the ground station equipment and the current work task requirement duration of each satellite.

[0095] S12: Count the current available resources and their quantity of each satellite in the set of communicative time periods obtained in step S11, wherein the current available resources of the satellite are the communicative time periods in the set of communicative time periods between the satellite and the ground station equipment whose length is not less than the current working task requirement of the satellite.

[0096] S13: Based on the current working task requirement duration of each satellite obtained in step S11 and the current available resources and their quantity of each satellite obtained in step S12, the matching degree of the currently available resources of each satellite is obtained using a matching degree calculation formula, and the current priority of each satellite is obtained based on the principle that the smaller the number of currently available resources of the satellite, the higher the priority.

[0097] In this embodiment, the matching degree calculation formula is as follows:

[0098] ,

[0099] Where,

[0100] Representative i The matching degree of the currently available resources of the satellites;

[0101] Representative i The number of satellites currently available resources;

[0102] Represents the current i How long does it take for a satellite to perform its mission?

[0103] Representative i The current number of satellites j The length of the available resources.

[0104] S14: The flexibility index of each satellite is obtained by using the current available resource quantity, the matching degree of the current available resources, and the current priority of each satellite through a flexibility index calculation formula, and the current ranking of the satellites is obtained in ascending order of the flexibility index.

[0105] In this embodiment, the flexibility index is calculated as follows:

[0106] ,

[0107] Where,

[0108] 、 and represents the weight factor;

[0109] Representative i The flexibility index of the satellite;

[0110] Representative i The current priority of the satellite.

[0111] It should be noted that the weight factor 、 and The setting needs to meet the following conditions at the same time: the fewer the number of available resources, the lower the flexibility index; the smaller the matching degree of available resources, the lower the flexibility index; the higher the priority, the lower the flexibility index. In response to this requirement, this embodiment uses a BP neural network trained based on the mean square error loss function to obtain the information. The neural network is based on the first i The current priority of the satellite , the matching degree of currently available resources and the number of available resources As input, the weight factor can be finally obtained 、 and , then put it into the flexibility index calculation formula to get the i The flexibility index of the satellite is improved, thereby improving operational efficiency.

[0112] S15: Based on the current available resources of each satellite obtained in step S12 and the current ranking of the satellites obtained in step S14, the current working tasks of each satellite are allocated to the ground station equipment according to the allocation criteria, and the working task set not allocated to the ground station equipment is determined to be empty according to the allocation result.

[0113] If yes, proceed to step S4;

[0114] If not, execute step S2.

[0115] See also Figure 3 In this embodiment, step S15 includes the following steps:

[0116] S151: The satellite currently at the top of the ranking is used as the currently allocated satellite.

[0117] S152: Determine whether there are any unoccupied resources in the currently allocated satellite's available resources.

[0118] If so, unoccupied resources are retrieved from the currently available resources of the satellite, and the ground station equipment corresponding to the unoccupied resources is allocated to the currently allocated satellite to arrange the current work task of the satellite. After that, the retrieved unoccupied resources are deemed to be occupied, and the next step is executed;

[0119] If not, the current working task of the satellite is regarded as a working task that has not been assigned to the ground station equipment, and then the next step is executed.

[0120] S153: Determine whether all satellites in the current satellite sequence have been traversed.

[0121] If so, all work tasks not assigned to the ground station equipment are counted to obtain a set of work tasks not assigned to the ground station equipment;

[0122] If not, proceed to the next step.

[0123] S154: According to the current order of satellites, the next satellite is selected as the currently allocated satellite, and then the process returns to step S152.

[0124] S2: Reassign each work task not assigned to the ground station device in the work task set not assigned to the ground station device through a recursive conflict reduction strategy, and then execute the next step.

[0125] See also Figure 4 In this embodiment, step S2 includes the following steps:

[0126] S21: Based on the current satellite ranking obtained in step S14, the work task that is not assigned to the ground station device and has the highest current satellite ranking is extracted from the set of work tasks that have not been assigned to the ground station device as the current task.

[0127] S22: Determine whether there is any available resource with a remaining length not less than the required duration of the current mission among all currently available resources of the satellite corresponding to the current mission.

[0128] If yes, the remaining part of the available resources is allocated to the current task, and then step S24 is executed;

[0129] If not, based on the current ranking of the satellites obtained in step S14, the last ranked task is extracted from all the tasks that have occupied the currently available resources of the satellite corresponding to the current task, and then the next step is executed.

[0130] S23: Determine whether all work tasks not assigned to the ground station device in the work task set not assigned to the ground station device have been traversed.

[0131] If yes, the last work task extracted and sorted in step S22 is used as the work task not assigned to the ground station device to update the work task set not assigned to the ground station device, and then execute the next step;

[0132] If not, the last task extracted and sorted in step S22 is used as the current task, and then the process returns to step S22.

[0133] S24: Determine whether all work tasks not assigned to the ground station device in the work task set not assigned to the ground station device have been traversed.

[0134] If yes, proceed to step S3;

[0135] If not, the next work task of the satellite that is not assigned to the ground station device in the current order is extracted from the work task set that is not assigned to the ground station device as the current task, and then the process returns to step S22.

[0136] S3: All work tasks assigned to ground station equipment are adjusted through task conversion strategy to release idle communication time periods, and then the next step is executed.

[0137] See also Figure 5 In this embodiment, step S3 includes the following steps:

[0138] S31: Determine whether there are any unoccupied resources among the currently available resources of all satellites.

[0139] If so, these unoccupied resources are integrated into a set of unoccupied resources, and then the next step is executed;

[0140] If not, execute step S4.

[0141] S32: Take an unoccupied resource from the set of unoccupied resources, use the unoccupied resource as the current resource, and then execute the next step.

[0142] S33: Determine whether the current resource meets the conversion conditions of a work task that has been assigned to the ground station equipment.

[0143] If so, the current resource is allocated to the work task that has been assigned to the ground station equipment, and then the next step is executed;

[0144] If not, proceed to the next step.

[0145] In step S33 of this embodiment, if the current resource satisfies the time range matching, resource-free and task constraint conditions of a certain work task that has been assigned to a ground station device, it is deemed to meet the conversion conditions of a certain work task that has been assigned to a ground station device. The current resource satisfies the time range matching of a certain work task that has been assigned to a ground station device, which means that the starting time of the current resource is earlier than the starting time of the available resources allocated to the work task that has been assigned to the ground station device. The current resource satisfies the resource-free condition of a certain work task that has been assigned to a ground station device, which means that the ground station device corresponding to the current resource is the same as the ground station device of the work task that has been assigned to the ground station device. The current resource satisfies the task constraint conditions of a certain work task that has been assigned to a ground station device, which means that the length of the current resource is not less than the required duration of the work task that has been assigned to the ground station device.

[0146] S34: Determine whether all unoccupied resources in the set of unoccupied resources have been traversed.

[0147] If yes, execute step S4;

[0148] If not, an unoccupied resource is taken from the set of unoccupied resources, and this unoccupied resource is used as the current resource, and then the process returns to step S33.

[0149] S4: Determine whether the completion rate of ground station equipment allocation exceeds a specified threshold. In this embodiment, the specified threshold is 95%.

[0150] If yes, then when the next task allocation time comes, the time is taken as the current time, and the work tasks that have not yet been allocated to the ground station equipment at this time are added to the current work tasks, and then the step S1 is executed again;

[0151] If not, the process returns to step S2.

[0152] The recursive conflict reduction method for aerospace tracking and control resource scheduling disclosed in this embodiment uses a heuristic algorithm based on the rule of first allocating the least flexible available arc segments. This algorithm allocates ground station equipment to each satellite's current work tasks based on the set of available communication time periods between each satellite and ground station equipment, forming a solution space. For tasks that are not assigned to ground station equipment, the recursive conflict reduction strategy and task transformation strategy effectively identify and reallocate idle time periods of ground station equipment (such as tracking and control equipment), maximizing the utilization efficiency of ground station equipment and improving the success rate of task scheduling. Furthermore, these two strategies flexibly adjust the time of assigned and uncompleted tasks, expanding the solution space and avoiding task conflicts. This allows for more optimal scheduling of satellite work tasks under complex resource conditions and enhances the flexibility and adaptability of the scheduling system. Compared with traditional genetic algorithms, the method in this embodiment significantly reduces computational complexity, rapidly generates initial solutions and gradually optimizes them, improving task completion rates. It is particularly suitable for large-scale and complex aerospace tracking and control missions, especially those with multiple time-dependent tasks, meeting the requirements of multi-task correlation and efficient scheduling.

[0153] Example 2:

[0154] This embodiment further discloses a recursive conflict reduction system applied to aerospace measurement and control resource scheduling. The recursive conflict reduction system includes a data parsing module and a recursive conflict reduction module. The recursive conflict reduction module is electrically connected to the data parsing module.

[0155] In this recursive conflict reduction system, a data parsing module is configured to receive satellite orbit prediction files and work task requirement files in real time, and parse these files to obtain the current set of communicable time periods between each satellite and ground station equipment and the current work task requirement duration for each satellite. The recursive conflict reduction module is configured to execute the recursive conflict reduction method for aerospace tracking and control resource scheduling disclosed in Example 1 of the present invention.

[0156] Corresponding to the beneficial effects of Example 1, the recursive conflict reduction system disclosed in this embodiment significantly reduces the computational complexity, can quickly generate an initial solution and gradually optimize it, and ultimately improve the completion rate of assigned tasks. It is particularly suitable for large-scale and complex aerospace measurement and control tasks, especially for multiple time-related tasks, and meets the needs of multi-task association and efficient scheduling.

[0157] In the description of the embodiments of the present application, it should be noted that in the description of the present application, terms such as "inside" and "outside" indicating directions or positional relationships are based on the directions or positional relationships shown in the accompanying drawings. This is only for the convenience of description and does not indicate or imply that the device or component must have a specific orientation, be constructed and operated in a specific orientation. Therefore, it cannot be understood as a limitation on the present application.

[0158] In the description of the present application, the description with reference to the terms "one embodiment", "some embodiments", "in the present embodiment", "specific example", or "some examples" means that the specific features, mechanisms, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, mechanisms, materials or characteristics described can be combined in a suitable manner in any one or more embodiments or examples. In addition, those skilled in the art can combine and combine different embodiments or examples described in this specification and the features of different embodiments or examples, unless they are contradictory.

[0159] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in the present application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A recursive conflict reduction method for aerospace tracking and control resource scheduling, characterized in that: The steps include: S1: A heuristic algorithm based on the rule of first allocation with the least flexibility of available arc segments is used to allocate the current work tasks of each satellite to the ground station equipment according to the set of communicable time periods between each satellite and the ground station equipment, and based on the allocation results, it is determined whether the set of work tasks not allocated to the ground station equipment is empty. If yes, proceed to step S4; If not, proceed to the next step; S2: Reassign each work task not assigned to the ground station device in the work task set not assigned to the ground station device through a recursive conflict reduction strategy, and then execute the next step; S3: Adjust all work tasks assigned to ground station equipment through task conversion strategy to release idle communication time periods, and then execute the next step; S4: Determine whether the completion rate of ground station equipment allocation exceeds a specified threshold. If yes, then when the next task allocation time comes, the time is taken as the current time, and the work tasks that have not yet been allocated to the ground station equipment at this time are added to the current work tasks, and then the step S1 is executed again; If not, then go back to step S2; In step S1, the process of allocating ground station equipment to the current working task of each satellite includes: obtaining a current ranking of satellites according to the flexibility index from small to large; then allocating ground station equipment to the current working task of each satellite according to an allocation criterion based on the current available resources of each satellite and the current ranking of the satellite; The step S2 comprises the following steps: S21: Based on the current order of the satellites, extracting the work task that is not assigned to the ground station device and is at the front of the current order of the satellites from the set of work tasks that are not assigned to the ground station device as the current task; S22: Determine whether there is any available resource with a remaining length not less than the required duration of the current mission among all currently available resources of the satellite corresponding to the current mission. If yes, the remaining part of the available resources is allocated to the current task, and then step S24 is executed; If not, based on the current ranking of the satellite, extract the last ranked task from all the tasks that have occupied the current available resources of the satellite corresponding to the current task, and then execute the next step; S23: Determine whether all work tasks not assigned to the ground station device in the work task set not assigned to the ground station device have been traversed. If yes, the last work task extracted and sorted in step S22 is used as the work task not assigned to the ground station device to update the work task set not assigned to the ground station device, and then step S3 or the next step is executed; If not, the last task extracted and sorted in step S22 is used as the current task, and then the process returns to step S22; S24: Determine whether all work tasks not assigned to the ground station device in the work task set not assigned to the ground station device have been traversed. If yes, execute step S3; If not, the next work task that is not assigned to the ground station device in the current order of the satellite is extracted from the work task set that is not assigned to the ground station device as the current task, and then the step S22 is executed again.

2. The recursive conflict reduction method for aerospace tracking and control resource scheduling according to claim 1, characterized in that: The work tasks in step S1 include measurement control tasks and data transmission tasks.

3. The recursive conflict reduction method for aerospace measurement and control resource scheduling according to claim 1 or 2, characterized in that: The step S1 comprises the following steps: S11: calling the data parsing module to parse the satellite orbit prediction file and the work task requirement file to obtain the current communication time period set between each satellite and the ground station equipment and the current work task requirement duration of each satellite; S12: Counting the currently available resources and the quantity of each satellite in the set of communicable time periods obtained in step S11, wherein the currently available resources of the satellite are the currently available time periods in the set of communicable time periods between the satellite and the ground station equipment whose length is not less than the current working task requirement of the satellite; S13: Based on the current required working time of each satellite obtained in step S11 and the current available resources and the amount thereof of each satellite obtained in step S12, a matching degree calculation formula is used to obtain the matching degree of the current available resources of each satellite, and the current priority of each satellite is obtained based on the principle that the smaller the number of currently available resources of the satellite, the higher the priority; S14: obtaining the flexibility index of each satellite by using the current available resource quantity, the matching degree of the current available resources, and the current priority of each satellite through a flexibility index calculation formula, and obtaining the current ranking of the satellites in ascending order of the flexibility index; S15: Based on the current available resources of each satellite obtained in step S12 and the current ranking of the satellites obtained in step S14, the current working tasks of each satellite are assigned to ground station equipment according to the allocation criteria, and according to the allocation result, it is determined whether the set of working tasks not assigned to the ground station equipment is empty. If yes, execute step S4; If not, execute step S2.

4. The recursive conflict reduction method for aerospace tracking and control resource scheduling according to claim 3 is characterized in that: The matching degree calculation formula is as follows: , Where, Representative i The matching degree of the currently available resources of the satellites; Representative i The number of satellites currently available resources; Represents the current i How long does it take for a satellite to perform its mission? Representative i The current number of satellites j The length of the available resources.

5. The recursive conflict reduction method for aerospace tracking and control resource scheduling according to claim 4 is characterized in that: The flexibility index is calculated as follows: , Where, 、 and represents the weight factor; Representative i The flexibility index of the satellite; Representative i The current priority of the satellite.

6. The recursive conflict reduction method for aerospace tracking and control resource scheduling according to claim 4 or 5, characterized in that: The step S15 includes the following steps: S151: The satellite that is currently ranked first is used as the currently allocated satellite; S152: Determine whether there are any unoccupied resources in the currently allocated satellite's available resources. If so, unoccupied resources are retrieved from the currently available resources of the satellite, and the ground station equipment corresponding to the unoccupied resources is allocated to the currently allocated satellite to arrange the current working task of the satellite, and then the next step is executed; If not, the current working task of the satellite is regarded as a working task that has not been assigned to the ground station equipment, and then the next step is executed; S153: Determine whether all satellites in the current satellite sequence have been traversed. If so, all work tasks not assigned to the ground station equipment are counted to obtain a set of work tasks not assigned to the ground station equipment; If not, proceed to the next step; S154: According to the current order of satellites, the next satellite is selected as the currently allocated satellite, and then the step S152 is executed again.

7. The recursive conflict reduction method for aerospace tracking and control resource scheduling according to claim 6, characterized in that: The step S3 comprises the following steps: S31: Determine whether there are any unoccupied resources among the currently available resources of all satellites. If so, these unoccupied resources are integrated into a set of unoccupied resources, and then the next step is executed; If not, execute step S4; S32: taking an unoccupied resource from the set of unoccupied resources, setting the unoccupied resource as the current resource, and then executing the next step; S33: Determine whether the current resource meets the conversion conditions of a work task that has been assigned to the ground station equipment. If so, the current resource is allocated to the work task that has been assigned to the ground station equipment, and then the next step is executed; If not, proceed to the next step; S34: Determine whether all unoccupied resources in the set of unoccupied resources have been traversed. If yes, execute step S4; If not, an unoccupied resource is taken from the set of unoccupied resources, and this unoccupied resource is used as the current resource, and then the process returns to step S33.

8. The recursive conflict reduction method for aerospace tracking and control resource scheduling according to claim 7 is characterized in that: In step S33, if the current resources simultaneously meet the conditions of matching the time range of a work task assigned to the ground station device, having no resource conflict and task constraints, it is determined to meet the conversion conditions of a work task assigned to the ground station device.

9. A recursive conflict reduction system for aerospace tracking and control resource scheduling, characterized in that: include: A data parsing module is configured to receive satellite orbit prediction files and work task requirement files in real time, and parse the satellite orbit prediction files and work task requirement files to obtain a set of communication time periods between each satellite and the ground station equipment and a work task requirement duration for each satellite; A recursive conflict reduction module is electrically connected to the data analysis module and is configured to execute the recursive conflict reduction method for aerospace measurement and control resource scheduling described in any one of claims 1 to 8.

Images