A Rule-Based Conflict Resolution Method for Space TT&C Resource Scheduling

Abstract

This application relates to a rule-based conflict resolution method and system for space TT&C resource scheduling. The method includes: obtaining space TT&C resource scheduling result data and multiple conflicting tasks, sorting the multiple conflicting tasks according to the priorities of the conflicting tasks to obtain a conflicting task order list; resolving the conflicts of the conflicting tasks according to the iterative repair rule in accordance with the conflicting task order list. If the resolution is not successful, then using the non-full arc segment optimization rule, increasing alternative idle time windows at the cost of gradually reducing the arc segment duration to resolve a single conflicting task, obtaining a resolved conflicting task list and an unresolved conflicting task list; resolving a single conflicting task in the unresolved conflicting task list according to the constraint relaxation rule by gradually relaxing the constraints at the cost of increasing alternative arc segments to obtain a resolved conflicting task list. Using this method can reduce the workload of manual conflict resolution and improve the efficiency of manual scheduling and resource utilization rate.

Description

Technical Field

[0001] This application relates to the technical field of aerospace TT&C network scheduling, and particularly to a rule-based method and system for resolving conflicts in aerospace TT&C resource scheduling. Background Art

[0002] Aerospace TT&C resource scheduling has developed into a stage mainly based on automatic scheduling supplemented by manual scheduling. Due to the large variety of spacecraft and TT&C resources involved, numerous constraints, many conflicts, and high complexity, it is difficult to solve the aerospace TT&C resource scheduling problem. Currently, there is no optimal solution algorithm with an acceptable time cost. Moreover, due to the rapid growth of the problem scale and task volume, as well as the addition of new resource demand models, the satisfaction rate of automatic scheduling is getting lower and lower. The existing conflict resolution process requires a large amount of manual intervention, resulting in a long time and low efficiency for formulating resource scheduling plans, and it is prone to human errors. Therefore, in addition to researching aerospace TT&C resource scheduling algorithms to improve the satisfaction rate of automatic scheduling, it is also necessary to research methods for automatically resolving conflicts in resource scheduling to reduce the workload of manual conflict resolution, improve the efficiency of manual scheduling, and enhance resource utilization. Summary of the Invention

[0003] Based on this, in view of the above technical problems, it is necessary to provide a rule-based method and system for resolving conflicts in aerospace TT&C resource scheduling that can reduce the workload of manual conflict resolution, improve the efficiency of manual scheduling, and enhance resource utilization.

[0004] A rule-based method for resolving conflicts in aerospace TT&C resource scheduling, the method comprising:

[0005] Obtaining aerospace TT&C resource scheduling result data and multiple conflict tasks; the aerospace TT&C resource scheduling result data mainly includes aerospace TT&C task requirements, resource scheduling plans, and satellite visibility time window data, and conflict tasks refer to aerospace TT&C task requirements that are not satisfied after resource scheduling;

[0006] Sorting the multiple conflict tasks according to the priorities of the conflict tasks to obtain a conflict task order list;

[0007] Resolving conflicts of the conflict tasks according to the conflict task order list according to iterative repair rules. If the resolution is not successful, use non-full arc segment optimization rules to resolve a single conflict task by gradually reducing the arc segment duration at the cost of increasing alternative idle time windows, obtaining a resolved conflict task list and an unresolved conflict task list;

[0008] Resolving a single conflict task in the unresolved conflict task list according to constraint relaxation rules by gradually relaxing constraints at the cost of increasing alternative arc segments, obtaining a resolved conflict task list.

[0009] In one embodiment, the iterative repair rules include a conflict resolution rule based on transferable arcs of scheduled tasks and a conflict resolution rule based on preemptible arcs of scheduled tasks; the iterative repair rules resolve a single conflicting task through the computational cost of one or more iterative repairs; conflict resolution of conflicting tasks is performed according to the conflicting task order list according to the iterative repair rules, including:

[0010] Based on the conflict resolution rule of transferable arcs of scheduled tasks, according to the set of alternative arcs of the current conflicting task, check one by one in chronological order whether all the scheduled tasks conflicting with each alternative arc have transferable arcs. If so, transfer all the scheduled task arcs and allocate this alternative arc for the current conflicting task for conflict resolution; a transferable arc means that the scheduled task has other idle and available arcs outside the currently allocated arcs.

[0011] In one embodiment, based on the conflict resolution rule of preemptible arcs of scheduled tasks, according to the set of alternative arcs of the current conflicting task, check one by one in chronological order the scheduled tasks conflicting with each alternative arc, and determine whether all the scheduled tasks are transferable arcs or preemptible arcs. If so, transfer the transferable arcs of the scheduled tasks, allocate this alternative arc for the current conflicting task, and at the same time put the preempted scheduled task into the conflicting task set; a preemptible arc means that the scheduled task currently has no transferable arcs, and the allocated arc of the scheduled task can be preempted by the arc of a conflicting task with a higher priority than itself.

[0012] In one embodiment, using the non-full arc optimization rule, a single conflicting task is resolved by gradually reducing the arc duration at the cost of increasing the alternative idle time window, obtaining a conflict task table after resolution and an unresolved conflict task table, including:

[0013] Obtain the set of alternative arcs of the current conflicting task, screen out the candidate alternative arcs that meet the shortest duration requirement of the conflicting task from the set of alternative arcs, and select the alternative arc with the least conflict time from the candidate alternative arcs as the allocation result of the current conflicting task.

[0014] In one embodiment, the constraint relaxation rules include a conflict resolution rule based on time interval constraint relaxation, a conflict resolution rule based on loop constraint relaxation, a conflict resolution rule based on duration or maximum elevation angle constraint relaxation, and a conflict resolution rule based on TT&C time interval constraint relaxation.

[0015] In one embodiment, the conflict resolution rule based on the relaxation of the time interval constraint refers to, for conflict tasks with time interval constraints, increasing the minimum time interval or decreasing the maximum time interval to increase the alternative arcs of the conflict tasks, and selecting alternative arcs based on the minimum relaxation time interval; according to the constraint relaxation rule, increasing alternative arcs at the cost of gradually relaxing the constraints to resolve a single conflict task in the unresolved conflict task table, and obtaining the resolved conflict task table, including:

[0016] According to the conflict resolution rule based on the relaxation of the time interval constraint, obtain all alternative arc sets where the current conflict task violates the time interval constraint; process each alternative arc in sequence according to the chronological order of the alternative arc sets, and select the alternative arc with the minimum relaxation time interval as the candidate alternative arc;

[0017] Judge whether the candidate alternative arc is idle. If so, directly use the candidate alternative arc as the allocation result of the current conflict task. If not, apply the conflict resolution rule based on the transferable arcs of the scheduled tasks to resolve the conflict.

[0018] In one embodiment, the conflict resolution rule based on the relaxation of the loop constraint refers to, for conflict tasks with loop constraints, adjusting the adjacent loops of the specified loop to increase the alternative arcs of the conflict tasks, and selecting alternative arcs based on the earliest available arc in terms of time; the method further includes:

[0019] Obtain all alternative arc sets of the adjacent loops of the specified loop constraint of the current conflict task, process each alternative arc in sequence according to the chronological order of the alternative arc sets, and use the idle alternative arcs as the allocation result of the current conflict task.

[0020] In one embodiment, the conflict resolution rule based on the relaxation of the duration or maximum elevation angle constraint refers to, for conflict tasks with duration or maximum elevation angle constraints, reducing the shortest duration or decreasing the maximum elevation angle limit to increase the alternative arcs of the conflict tasks, and selecting alternative arcs based on the minimum relaxation duration or maximum elevation angle; the method further includes:

[0021] Obtain all alternative arc sets where the current conflict task violates the duration or maximum elevation angle constraint, process each alternative arc in sequence in descending order of the arc time length of the alternative arc sets, and use the idle alternative arcs as the allocation result of the current conflict task.

[0022] In one embodiment, the conflict resolution rule based on the relaxation of the TT&C time interval constraint refers to, for conflict tasks with TT&C time interval constraints, increasing the TT&C time interval range to increase the alternative arcs of the conflict tasks, and selecting alternative arcs based on the minimum relaxation TT&C time interval; the method further includes:

[0023] Obtain all alternative arc segment sets where the current conflicting tasks violate the relaxation of the measurement and control time interval constraints. Process each alternative arc segment in order from the closest distance between the start time of the arc segment in the alternative arc segment set and the time interval to the farthest. Use the idle alternative arc segments as the allocation result of the current conflicting tasks.

[0024] A rule-based conflict resolution system for space TT&C resource scheduling, the system includes a system front-end module, a conflict resolution recommendation execution module, and a database module;

[0025] The system front-end module is used to operate the conflict resolution system and provide the presentation of space TT&C resource scheduling result data and the selection of conflict resolution rules;

[0026] The conflict resolution recommendation execution module is used to automatically generate a conflict resolution plan through the operation of selecting conflict resolution rules on the human-computer interaction interface and push it to the human-computer interaction interface;

[0027] The database module is used to store and manage space TT&C mission requirements, resource scheduling plans, satellite visibility time window data, unmet mission lists, conflict resolution rules, and generated conflict resolution plans.

[0028] The above-mentioned rule-based conflict resolution method and system for space TT&C resource scheduling. In this application, the experience of manual conflict resolution is transformed into rule knowledge that can be recognized by a computer. The rule usage strategy is optimized at the cost of minimizing the impact of conflict resolution on other scheduled tasks. A rule-based automatic conflict resolution method is designed. Compared with the prior art, it can effectively reduce the workload of manual conflict resolution and improve the efficiency of manual scheduling. And through the designed iterative repair rules, non-full arc segment optimization rules, and constraint relaxation rules, this application fully explores the available alternative arc segments for each conflicting task, transforms the conflicting tasks into the increased task volume on the corresponding resources, thereby being able to reduce the resource fragmentation time and improve the resource utilization rate. At the same time, the rule-based conflict resolution system for space TT&C resource scheduling designed according to the method of this application has good engineering applicability. On the one hand, it can support the mission requirement data and resource scheduling result data of on-orbit satellites in engineering practice, and can be used for conflict resolution in both the periodic scheduling stage and the dynamic scheduling stage; on the other hand, it transforms the continuously enriched actual engineering experience into conflict resolution rules, thereby being able to effectively improve the efficiency and accuracy of manual scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 It is an application scenario diagram of a rule-based conflict resolution method for space TT&C resource scheduling in an embodiment;

[0030] Figure 2 It is a schematic diagram of the conflict resolution processing flow of the conflict resolution rule based on the transferable arc segments of the scheduled tasks in an embodiment;

[0031] Figure 3 Schematic diagram of the conflict resolution process based on the conflict resolution rules for preemptible arcs of scheduled tasks in an embodiment;

[0032] Figure 4 Schematic diagram of the conflict resolution process based on the non-full arc optimization rules in an embodiment;

[0033] Figure 5 Schematic diagram of the conflict resolution process based on the conflict resolution rules of time interval constraint relaxation in an embodiment;

[0034] Figure 6 Schematic diagram of the conflict resolution process based on the conflict resolution rules of loop constraint relaxation in an embodiment;

[0035] Figure 7 Schematic diagram of the conflict resolution process based on the conflict resolution rules of duration or maximum elevation angle constraint relaxation in an embodiment;

[0036] Figure 8 Schematic diagram of the conflict resolution process based on the conflict resolution rules of TT&C time interval constraint relaxation in an embodiment;

[0037] Figure 9 Structure block diagram of a rule-based space TT&C resource scheduling conflict resolution system in an embodiment;

[0038] Figure 10 Internal structure diagram of a computer device in an embodiment. Detailed implementation manners

[0039] In order to make the objectives, technical solutions and advantages of the present application clearer and more understandable, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0040] In one embodiment, as Figure 1 shown, a rule-based space TT&C resource scheduling conflict resolution method is provided, including the following steps:

[0041] Step 102, obtaining space TT&C resource scheduling result data and multiple conflicting tasks; the space TT&C resource scheduling result data mainly includes space TT&C task requirements, resource scheduling plans, and satellite visibility time window data, and the conflicting tasks refer to the unmet space TT&C task requirements after resource scheduling.

[0042] The basic elements of space TT&C mission requirements mainly include satellite name, mission number, mission priority, mission constraints, etc. The basic elements of the resource scheduling plan mainly include satellite code, mission number, mission priority, TT&C equipment name, start time of the tracking arc segment, end time of the tracking arc segment, etc.; the basic elements of satellite visibility time window data mainly include satellite name, equipment name, name of the site where the equipment is located, start time of the visibility time window, end time, and orbit circle number, etc.

[0043] Step 104, sort the multiple conflicting tasks according to the priorities of the conflicting tasks to obtain a conflicting task order list.

[0044] When there are multiple conflicting tasks that need to be resolved, conflict resolution is performed one by one from high to low in order of task priority; when the task priorities are the same, tasks are randomly selected for processing.

[0045] Step 106, resolve the conflicting tasks according to the iterative repair rule according to the conflicting task order list. If the resolution is not successful, use the non-full arc segment optimization rule to increase the alternative idle time window at the cost of gradually reducing the arc segment duration to resolve a single conflicting task, and obtain a resolved conflicting task list and an unresolved conflicting task list.

[0046] Step 108, resolve a single conflicting task in the unresolved conflicting task list by gradually relaxing the constraints at the cost of gradually relaxing the constraints to increase the alternative arc segments, and obtain a resolved conflicting task list.

[0047] In the above rule-based space TT&C resource scheduling conflict resolution method, the present application transforms the experience of manual conflict resolution into rule knowledge that can be recognized by a computer, optimizes the rule usage strategy at the cost of minimizing the impact on other scheduled tasks during conflict resolution, and designs an automatic conflict resolution method based on rules. Compared with the prior art, it can effectively reduce the workload of manual conflict resolution, improve the efficiency of manual scheduling, and through the designed iterative repair rule, non-full arc segment optimization rule, and constraint relaxation rule, the present application fully explores the alternative arc segments available for each conflicting task, converts the conflicting tasks into the increased task volume on the corresponding resources, thereby being able to reduce the resource fragmentation time and improve the resource utilization rate.

[0048] In one embodiment, the iterative repair rule includes a conflict resolution rule based on the transferable arc segments of the scheduled tasks and a conflict resolution rule based on the preemptable arc segments of the scheduled tasks; the iterative repair rule resolves a single conflicting task through the computational cost of one or more iterative repairs; resolving the conflicting tasks according to the iterative repair rule according to the conflicting task order list includes:

[0049] Based on the conflict resolution rules for transferable arcs of scheduled tasks, according to the set of alternative arcs of the current conflicting task, check one by one in chronological order whether there are transferable arcs for each scheduled task conflicting with the alternative arc. If there are, transfer out all the scheduled task arcs and allocate this alternative arc to the current conflicting task for conflict resolution; a transferable arc refers to an arc that is idle and available for a scheduled task outside the currently allocated arc.

[0050] In a specific embodiment, as Figure 2 shown is the processing procedure of the conflict resolution rules for transferable arcs of scheduled tasks. If the resolution is unsuccessful, use the conflict resolution rules for preemptable arcs of scheduled tasks for conflict resolution.

[0051] In one embodiment, based on the conflict resolution rules for preemptable arcs of scheduled tasks, according to the set of alternative arcs of the current conflicting task, check one by one in chronological order each scheduled task conflicting with the alternative arc, and determine whether all the scheduled tasks are transferable arcs or preemptable arcs. If so, transfer out the transferable arcs of the scheduled tasks, allocate this alternative arc to the current conflicting task, and at the same time put the preempted scheduled tasks into the conflicting task set; a preemptable arc refers to an arc where a scheduled task currently has no transferable arc and the allocated arc of the scheduled task can be preempted by the arc of a conflicting task with a higher priority than itself.

[0052] In a specific embodiment, as Figure 3 shown is the processing procedure of the conflict resolution rules for preemptable arcs of scheduled tasks. If the resolution is not successful, use the non-full arc optimization rules for conflict resolution.

[0053] In one embodiment, using the non-full arc optimization rules, by gradually reducing the arc duration at the cost of increasing the alternative idle time window to resolve a single conflicting task, obtain the resolved conflicting task table and the unresolved conflicting task table, including:

[0054] Obtain the set of alternative arcs of the current conflicting task, screen out the candidate alternative arcs that meet the shortest duration requirements of the conflicting task from the set of alternative arcs, and select the alternative arc with the least conflict time from the candidate alternative arcs as the allocation result of the current conflicting task.

[0055] In a specific embodiment, the process of using the non-full arc optimization rules to resolve the unresolved conflicting tasks is as Figure 4 shown.

[0056] In one embodiment, the constraint relaxation rules include conflict resolution rules based on time interval constraint relaxation, conflict resolution rules based on loop constraint relaxation, conflict resolution rules based on duration or maximum elevation angle constraint relaxation, and conflict resolution rules based on TT&C time interval constraint relaxation.

[0057] In one embodiment, the conflict resolution rule based on time interval constraint relaxation refers to, for conflict tasks with time interval constraints, increasing the minimum time interval or decreasing the maximum time interval to increase the alternative arcs of the conflict tasks, and selecting alternative arcs based on the minimum relaxation time interval; according to the constraint relaxation rule, increasing alternative arcs at the cost of gradually relaxing the constraints to resolve a single conflict task in the unresolved conflict task list, obtaining the resolved conflict task list, including:

[0058] According to the conflict resolution rule based on time interval constraint relaxation, obtain all alternative arc sets where the current conflict task violates the time interval constraint; process each alternative arc in the order of time of the alternative arc set, and select the alternative arc with the minimum relaxation time interval as the candidate alternative arc;

[0059] Determine whether the candidate alternative arc is idle. If so, directly use the candidate alternative arc as the allocation result of the current conflict task. If not, apply the conflict resolution rule based on the transferable arcs of the scheduled tasks to resolve the conflict.

[0060] In a specific embodiment, the process of resolving unresolved conflict tasks using the conflict resolution rule based on time interval constraint relaxation is as Figure 8 shown.

[0061] In one embodiment, the conflict resolution rule based on loop constraint relaxation refers to, for conflict tasks with loop constraints, adjusting the adjacent loops of the specified loop to increase the alternative arcs of the conflict tasks, and selecting alternative arcs based on the earliest idle arc in time; the method further includes:

[0062] Obtain all alternative arc sets of the adjacent loops of the specified loop constraint of the current conflict task, process each alternative arc in the order of time of the alternative arc set, and use the idle alternative arc as the allocation result of the current conflict task.

[0063] In a specific embodiment, the process of resolving unresolved conflict tasks using the conflict resolution rule based on loop constraint relaxation is as Figure 6 shown.

[0064] In one embodiment, the conflict resolution rule based on duration or maximum elevation angle constraint relaxation refers to, for conflict tasks with duration or maximum elevation angle constraints, reducing the shortest duration or decreasing the maximum elevation angle limit to increase the alternative arcs of the conflict tasks, and selecting alternative arcs based on the minimum relaxation duration or maximum elevation angle; the method further includes:

[0065] Obtain all sets of alternative arcs where the current conflicting task violates the duration or maximum elevation angle constraint. Process each alternative arc in descending order of the arc time length of the set of alternative arcs, and use the idle alternative arcs as the allocation result of the current conflicting task.

[0066] In a specific embodiment, the process of resolving unresolved conflicting tasks using conflict resolution rules based on duration or maximum elevation angle constraint relaxation is as Figure 7 shown.

[0067] In one embodiment, the conflict resolution rule based on measurement and control time interval constraint relaxation refers to, for conflicting tasks with measurement and control time interval constraints, by increasing the measurement and control time interval range, increasing the alternative arcs of the conflicting tasks, and selecting alternative arcs based on the criterion of minimizing the relaxed measurement and control time interval; the method further includes:

[0068] Obtain all sets of alternative arcs where the current conflicting task violates the relaxation of measurement and control time interval constraints. Process each alternative arc in descending order of the distance between the arc start time of the set of alternative arcs and the time interval, and use the idle alternative arcs as the allocation result of the current conflicting task.

[0069] In a specific embodiment, the process of resolving unresolved conflicting tasks using conflict resolution rules based on measurement and control time interval constraint relaxation is as Figure 8 shown.

[0070] It should be understood that although Figure 1 the steps in the flowchart are shown in sequence according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless specifically stated in this article, there is no strict order restriction for the execution of these steps, and these steps can be executed in other orders. Moreover, Figure 1 at least a part of the steps in

[0071] In one embodiment, as Figure 9 shown, a rule-based space measurement and control resource scheduling conflict resolution system is provided, including: a system front-end module, a conflict resolution recommendation execution module, and a database module, where:

[0072] The system front-end module is used to operate the conflict resolution system, providing the presentation of the space TT&C resource scheduling result data and the selection of conflict resolution rules. The system front-end module also includes a task data import module, a conflict resolution rule selection module, and a conflict resolution solution display module. The task data import module is used to import data such as space TT&C mission requirements, resource scheduling plans, satellite visibility time window data, and unmet task lists, and store them in the database. The conflict resolution rule selection module is used to select one or more conflict resolution rules from the conflict resolution rule list. The conflict resolution solution display module is used to present information such as the rules adopted for resolving each conflict task, the allocated arcs, the transferred scheduled tasks, or the preempted scheduled tasks.

[0073] The conflict resolution recommendation execution module is used to automatically generate a conflict resolution plan through the operation of selecting conflict resolution rules on the man-machine interface and push it to the man-machine interface.

[0074] The database module is used to store and manage space TT&C mission requirements, resource scheduling plans, satellite visibility time window data, unmet task lists, conflict resolution rules, and generated conflict resolution plans.

[0075] The above rule-based space TT&C resource scheduling conflict resolution system has good engineering applicability. On the one hand, it can support the on-orbit satellite mission requirement data and resource scheduling result data in engineering practice, and can be used for conflict resolution in both the periodic scheduling stage and the dynamic scheduling stage. On the other hand, it can transform the continuously enriched practical engineering experience into conflict resolution rules, thereby effectively improving the efficiency and accuracy of manual scheduling.

[0076] For the specific limitations of the rule-based space TT&C resource scheduling conflict resolution system, reference can be made to the limitations of the rule-based space TT&C resource scheduling conflict resolution method in the above text, which will not be elaborated here. Each module in the above rule-based space TT&C resource scheduling conflict resolution system can be implemented in whole or in part through software, hardware, and their combinations. The above modules can be embedded in the processor of the computer device in hardware form or be independent of it, or can be stored in the memory of the computer device in software form, so that the processor can call and execute the operations corresponding to the above modules.

[0077] In one embodiment, a computer device is provided. The computer device can be a terminal, and its internal structure diagram can be as Figure 10As shown in the figure. The computer device includes a processor, a memory, a network interface, a display screen, and an input system connected via a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, it implements a method for resolving conflicts in spaceflight TT&C resource scheduling based on rules. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen. The input system of the computer device can be a touch layer covering the display screen, or buttons, trackballs, or touchpads provided on the housing of the computer device, or an external keyboard, touchpad, or mouse, etc.

[0078] Those skilled in the art can understand that Figure 10 the structure shown in the figure is only a block diagram of some structures related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine some components, or have different component arrangements.

[0079] Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above methods. Among them, any reference to a memory, storage, database, or other medium used in the various embodiments provided by the present application may include non-volatile and / or volatile memories. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory may include random access memory (RAM) or an external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and Rambus dynamic RAM (RDRAM), etc.

[0080] The technical features of the above embodiments can be combined arbitrarily. For the sake of concise description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as the scope recorded in this specification.

[0081] The above-described embodiments merely represent several implementation manners of the present application. The description is relatively specific and detailed, but it should not be construed as a limitation on the scope of the invention patent. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the appended claims.

Claims

1. A rule-based conflict resolution method for space TT&C resource scheduling, characterized in that The method includes: Obtaining space TT&C resource scheduling result data and multiple conflicting tasks; the space TT&C resource scheduling result data mainly includes space TT&C mission requirements, resource scheduling schemes, and satellite visibility time window data, and the conflicting tasks refer to the unmet space TT&C mission requirements after resource scheduling; Sorting the multiple conflicting tasks according to the priorities of the conflicting tasks to obtain a conflicting task order list; Resolving conflicts of the conflicting tasks according to the conflicting task order list according to the iterative repair rule. If the resolution is not successful, use the non-full arc segment optimization rule to resolve a single conflicting task by gradually reducing the arc segment duration at the cost of increasing alternative idle time windows, obtaining a resolved conflicting task list and an unresolved conflicting task list; Resolving a single conflicting task in the unresolved conflicting task list by gradually relaxing constraints at the cost of increasing alternative arc segments according to the constraint relaxation rule, obtaining a resolved conflicting task list; The iterative repair rule includes a conflict resolution rule based on transferable arcs of scheduled tasks and a conflict resolution rule based on preemptive arcs of scheduled tasks; the iterative repair rule resolves a single conflicting task through the computational cost of one or more iterative repairs; resolving conflicts of the conflicting tasks according to the conflicting task order list according to the iterative repair rule includes: The conflict resolution rule based on transferable arcs of scheduled tasks. According to the alternative arc segment set of the current conflicting task, sequentially determine whether there are transferable arcs for each scheduled task conflicting with each alternative arc segment in chronological order. If so, transfer out all the scheduled task arc segments and allocate this alternative arc segment for the current conflicting task for conflict resolution; the transferable arc refers to an arc segment that is idle and available for a scheduled task outside the currently allocated arc segment; Using the non-full arc segment optimization rule to resolve a single conflicting task by gradually reducing the arc segment duration at the cost of increasing alternative idle time windows, obtaining a resolved conflicting task list and an unresolved conflicting task list, including: Obtaining the alternative arc segment set of the current conflicting task, screening out candidate alternative arc segments that meet the shortest duration requirement of the conflicting task from the alternative arc segment set, and selecting the alternative arc segment with the least conflict time from the candidate alternative arc segments as the allocation result of the current conflicting task; The constraint relaxation rule includes a conflict resolution rule based on time interval constraint relaxation, a conflict resolution rule based on loop constraint relaxation, a conflict resolution rule based on duration or maximum elevation angle constraint relaxation, and a conflict resolution rule based on TT&C time interval constraint relaxation.

2. The method according to claim 1, wherein The method further includes: Based on the conflict resolution rule for preemptible arcs of scheduled tasks, according to the set of alternative arcs of the current conflicting task, judge each scheduled task conflicting with each alternative arc one by one in chronological order, and determine whether all scheduled tasks are transferable arcs or preemptible arcs. If so, transfer the transferable arcs of the scheduled tasks, allocate this alternative arc to the current conflicting task, and at the same time put the preempted scheduled task into the conflict task set; the preemptible arc refers to the situation where the scheduled task currently has no transferable arc, and the allocated arc of the scheduled task is preempted by the arc of a conflicting task with a higher priority than itself.

3. The method according to claim 1, wherein The conflict resolution rule based on time interval constraint relaxation means that for conflicting tasks with time interval constraints, by increasing the minimum time interval or decreasing the maximum time interval, the alternative arcs of the conflicting tasks are increased, and the alternative arcs are selected based on the minimum relaxation time interval; according to the constraint relaxation rule, increase the alternative arcs at the cost of gradually relaxing the constraints to resolve a single conflicting task in the unresolved conflict task table, and obtain the resolved conflict task table, including: According to the conflict resolution rule based on time interval constraint relaxation, obtain all sets of alternative arcs of the current conflicting task that violate the time interval constraint; process each alternative arc in the order of time of the set of alternative arcs, and select the alternative arc with the minimum relaxation time interval as the candidate alternative arc; Judge whether the candidate alternative arc is idle. If so, directly use the candidate alternative arc as the allocation result of the current conflicting task. If not, apply the conflict resolution rule based on the transferable arcs of scheduled tasks to resolve the conflict.

4. The method according to claim 3, characterized in that, The conflict resolution rule based on loop constraint relaxation means that for conflicting tasks with loop constraints, by adjusting the adjacent loops of the specified loop, the alternative arcs of the conflicting tasks are increased, and the alternative arcs are selected based on the earliest idle arc in time; The method further includes: Obtain all sets of alternative arcs of the adjacent loops of the specified loop constraint of the current conflicting task, process each alternative arc in the order of time of the set of alternative arcs, and use the idle alternative arc as the allocation result of the current conflicting task.

5. The method according to claim 4, wherein The conflict resolution rule based on duration or maximum elevation angle constraint relaxation means that for conflicting tasks with duration or maximum elevation angle constraints, by reducing the shortest duration or decreasing the maximum elevation angle limit, the alternative arcs of the conflicting tasks are increased, and the alternative arcs are selected based on the minimum relaxation duration or maximum elevation angle; The method further includes: Obtain all sets of alternative arcs of the current conflicting task that violate the duration or maximum elevation angle constraint, process each alternative arc in descending order of the arc time length of the set of alternative arcs, and use the idle alternative arc as the allocation result of the current conflicting task.

6. The method according to claim 5, wherein The conflict resolution rule based on TT&C time interval constraint relaxation means that for conflicting tasks with TT&C time interval constraints, by increasing the TT&C time interval range, the alternative arcs of the conflicting tasks are increased, and the alternative arcs are selected based on the minimum relaxation TT&C time interval; The method further includes: Obtain all alternative arc segment sets that violate the relaxation of the measurement and control time interval constraint for the current conflicting task. Process each alternative arc segment in turn according to the distance from the start time of the arc segment in the alternative arc segment set to the time interval, from near to far. Take the idle alternative arc segments as the allocation result of the current conflicting task.

Images