Task uploading method and device based on satellite group task instruction capacity, electronic equipment and storage medium

Abstract

The invention discloses a satellite group task instruction capacity-based task uploading method, which comprises the following steps of: when the number of instructions of a task is less than or equal to the current residual instruction capacity, judging whether the total number of the instructions is less than or equal to the current residual instruction capacity or not; if yes, adding the task to the current to-be-added cache list; if not, judging whether the length of the quasi annotation list is 0 or not; if the current group task is not 0 and the starting time of the upper injection arc section conflicts, re-determining the upper injection arc section of the current group task; adding the current group task into a quasi annotation list; and re-determining the upper injection arc section of the ith task and adding the upper injection arc section into the to-be-added cache list. According to the method, resources are reasonably utilized, so that all the instruction tasks can be uploaded and executed in time, and the instruction task uploading efficiency and execution efficiency are greatly improved. The invention further discloses a device for implementing the method, electronic equipment and a computer readable storage medium.

Description

Technical Field

[0001] The present invention relates to the field of satellite data processing technology, and in particular to a task injection method, device, electronic equipment and storage medium based on satellite group task instruction capacity. Background Art

[0002] Instruction capacity refers to the number of instructions that a spacecraft can store and execute. Instruction capacity is an important parameter in the design and operation of a spacecraft, which determines the complexity of the tasks and the number of operations that the spacecraft can perform. Instruction capacity is mainly used in the field of aerospace science and technology, especially in the design and operation of spacecraft such as satellites and rockets. It reflects the number of instructions that a spacecraft can store and execute, and has a vital impact on the mission execution and performance of the spacecraft. The instruction capacity of a large satellite is released only after all the instructions stored in the satellite have been executed. In the prior art, the instructions of a large satellite can only be manually cleared and released by the ground in the measurement and control arc, which affects the efficiency of mission injection. In addition, all instruction tasks are injected at once. Under the limited instruction capacity, the instruction tasks are executed in sequence, and the injection and execution efficiency is low. Summary of the invention

[0003] In order to solve the above problems existing in the prior art, the present invention provides a task injection method, device, electronic device and storage medium based on the satellite group task instruction capacity. The technical problem to be solved by the present invention is achieved by the following technical solutions:

[0004] A first aspect of an embodiment of the present invention provides a task injection method based on a satellite group task instruction capacity, comprising the following steps:

[0005] The step of traversing the list of tasks to be added is performed: when the number of instructions of the i-th task in the list of tasks to be added is less than or equal to the current remaining instruction capacity, it is determined whether the sum of the total number of instructions in the current cache list to be added and the number of instructions of the i-th task is less than or equal to the current remaining instruction capacity; wherein the order of the tasks in the list of tasks to be added is sorted in ascending order of the start time of the initial addition arc segment;

[0006] If yes, then add the i-th task to the current cache list to be added, and return to execute the step of traversing the list of tasks to be added;

[0007] If not, determine whether the length of the quasi-update list is 0; wherein all tasks in the current cache list to be added are taken as the current group tasks;

[0008] If the length of the quasi-update list is not 0, when the start time of the update arc segment of the first task of the last group of tasks in the quasi-update list is equal to the start time of the initial update arc segment of the first task of the current group of tasks, the update arc segment of the current group of tasks is determined in the available update arc segments according to the execution end time of the last task of the last group of tasks in the quasi-update list;

[0009] Add the current group task to the quasi-update list, clear the current cache list to be added, and obtain the cache list to be added;

[0010] When the start time of the initial upload arc segment of the i-th task is less than or equal to the execution end time of the last task in the previous group of tasks, the upload arc segment of the i-th task is determined in the available upload arc segments according to the execution end time of the last task in the previous group of tasks, and the i-th task is added to the cache list to be added, and the step of traversing the list of tasks to be uploaded is returned.

[0011] In one embodiment of the present invention, the method also includes: if the length of the quasi-update list is 0, then the start time of the initial update arc segment of the first task in the current group task is determined as the start time of the update arc segment of the current group task, and the current group task is added to the quasi-update list.

[0012] In one embodiment of the present invention, determining the up-betting arc segment of the current group of tasks in the available up-betting arc segments according to the execution end time of the last task of the last group of tasks in the quasi-up-betting list includes:

[0013] The available betting arc segment whose start time is greater than the execution end time of the last task in the last group of tasks in the quasi-betting list, and the difference between the execution start time of the first task of the current group task and the start time of the available betting arc segment is greater than the available betting arc segment with the highest arc score in the available betting arc segments of the preset duration, shall be used as the betting arc segment of the current group task.

[0014] In one embodiment of the present invention, the method further comprises:

[0015] The arc score is determined based on the length of the available upcast arc and its weight, the weight of whether the available upcast arc is reserved, the elevation angle of the available upcast arc and its weight, and the weight of the time of the available upcast arc.

[0016] In one embodiment of the present invention, the method further comprises:

[0017] When the start time of the upward betting arc segment of the first task of the last group of tasks in the quasi-upward betting list is not equal to the start time of the initial upward betting arc segment of the first task of the current group of tasks, then the start time of the initial upward betting arc segment of the first task of the current group of tasks is the upward betting arc segment of the current group of tasks.

[0018] In one embodiment of the present invention, the step of determining the upper injection arc segment of the i-th task in the available upper injection arc segments according to the execution end time of the last task in the previous group of tasks comprises:

[0019] The available betting arc segment with the highest arc score among the available betting arc segments whose start time in the available betting arc segment is greater than the execution end time of the last task in the last group of tasks in the quasi-betting list, and whose difference between the execution start time of the i-th task and the start time of the available betting arc segment is greater than the preset duration, shall be used as the betting arc segment for the i-th task.

[0020] In one embodiment of the present invention, the method further comprises:

[0021] When the number of instructions of the i-th task in the task list to be added is greater than the current remaining instruction capacity, it is determined whether the number of instructions of the i+1-th task in the task list to be added is greater than the current remaining instruction capacity.

[0022] A second aspect of an embodiment of the present invention provides a task injection device based on a satellite group task instruction capacity, comprising:

[0023] The traversal module is used to perform the steps of traversing the task list to be added: when the number of instructions of the i-th task in the task list to be added is less than or equal to the current remaining instruction capacity, it is determined whether the sum of the total number of instructions in the current cache list to be added and the number of instructions of the i-th task is less than or equal to the current remaining instruction capacity; wherein the order of the tasks in the task list to be added is in ascending order of the start time of the initial addition arc segment;

[0024] A first adding module, for adding the i-th task to the current cache list to be added, and returning to execute the step of traversing the list of tasks to be added;

[0025] A judging module, for judging whether the length of the quasi-annotation list is 0 if no; wherein all tasks in the current cache list to be added are taken as the current group tasks;

[0026] A determination module, for determining the upper bet segment of the current group of tasks in the available upper bet segments according to the execution end time of the last task of the last group of tasks in the quasi-update list, if the length of the quasi-update list is not 0, when the start time of the upper bet segment of the first task of the last group of tasks in the quasi-update list is equal to the start time of the initial upper bet segment of the first task of the current group of tasks;

[0027] A second adding module is used to add the current group task to the quasi-update list, clear the current cache list to be added, and obtain the cache list to be added;

[0028] A determination adding module is used for determining the upper bet arc segment of the i-th task in the available upper bet arc segments according to the execution end time of the last task in the previous group of tasks when the start time of the initial upper bet arc segment of the i-th task is less than or equal to the execution end time of the last task in the previous group of tasks, and adding the i-th task to the cache list to be added, and returning to execute the step of traversing the list of tasks to be added.

[0029] A third aspect of an embodiment of the present invention provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, a task injection method based on satellite group task instruction capacity provided by the first aspect of an embodiment of the present invention is implemented.

[0030] A fourth aspect of an embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, a task injection method based on satellite group task instruction capacity provided by the first aspect of an embodiment of the present invention is implemented.

[0031] Beneficial effects of the present invention:

[0032] The present invention selects appropriate injection tasks and injection arc segments to inject instruction tasks according to the size of the remaining instruction capacity of 2A and 2B stars, rationally utilizes resources, enables all instruction tasks to be injected and executed in time, and greatly improves the injection efficiency and execution efficiency of instruction tasks.

[0033] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures particularly pointed out in the written description, claims, and drawings.

[0034] The technical solution of the present invention is further described in detail below through the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings:

[0036] Figure 1 A schematic flow chart of a task injection method based on satellite group task instruction capacity provided by an embodiment of the present invention;

[0037] Figure 2 A block diagram of a task injection device based on satellite group task instruction capacity provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0038] The present invention is further described in detail below with reference to specific embodiments, but the embodiments of the present invention are not limited thereto.

[0039] like Figure 1 As shown, a first aspect of an embodiment of the present invention provides a task injection method based on satellite group task instruction capacity, comprising the following steps:

[0040] Step 11, when the number of instructions of the i-th task in the task list to be added is less than the current remaining instruction capacity, determine whether the sum of the total number of instructions in the current cache list to be added and the number of instructions of the i-th task is less than the current remaining instruction capacity.

[0041] The order of the tasks in the task list to be uploaded is sorted in ascending order of the start time of the initial uploaded arc segment.

[0042] Step 12: If yes, add the i-th task to the current cache list to be added until the total number of instructions in the current cache list to be added is equal to the current remaining instruction capacity, and all tasks in the current cache list to be added are used as the current group tasks.

[0043] Step 13: If not, determine whether the length of the quasi-update list is 0.

[0044] Step 14, if the length of the quasi-update list is not 0, when the start time of the update arc segment of the first task of the last group of tasks in the quasi-update list is equal to the start time of the initial update arc segment of the first task of the current group of tasks, the update arc segment of the current group of tasks is determined in the available update arc segments according to the execution end time of the last task of the last group of tasks in the quasi-update list.

[0045] Step 15, adding the current group task to the quasi-update list, clearing the current cache list to be added, and obtaining the cache list to be added.

[0046] Step 16, when the start time of the upper bet arc segment of the i-th task is less than the execution end time of the last task in the previous group of tasks, determine the upper bet arc segment of the i-th task in the available upper bet arc segments according to the execution end time of the last task in the previous group of tasks, and add the i-th task to the cache list to be added, and return to step 11.

[0047] In this embodiment, appropriate injection tasks and injection arcs are selected according to the size of the remaining instruction capacity of large satellites such as 2A and 2B to automatically inject and release instruction tasks, and resources are used rationally so that all instruction tasks can be injected and executed in a timely manner, greatly improving the injection efficiency and execution efficiency of instruction tasks.

[0048] It should be noted that the command capacity of large satellites such as 2A and 2B is released only after all the commands stored in the satellite have been executed.

[0049] A second aspect of an embodiment of the present invention provides a task injection method based on a satellite group task instruction capacity, comprising the following steps:

[0050] Step 201, traverse each task: determine whether the order of the i-th task in the task list to be added is less than the length N of the task list to be added.

[0051] Step 202: If the order of the i-th task in the task list to be added is greater than the length N of the task list to be added, the addition is terminated. At this point, it means that the current list to be added has been completely traversed and the addition is completed.

[0052] Step 203: If the order of the i-th task in the task list to be added is less than or equal to the length N of the task list to be added, it is determined whether the number of instructions of the i-th task in the task list to be added is greater than the current remaining instruction capacity.

[0053] Here, the current remaining instruction capacity is the remaining instruction capacity of the big star except the number of instructions in the registered and quasi-registered lists. Each task corresponds to multiple instructions.

[0054] Step 204: When the number of instructions of the i-th task in the task list to be added is greater than the current remaining instruction capacity, the task is skipped and the process returns to step 201 to traverse the next task. At this point, it means that the current remaining instruction capacity is insufficient and the task cannot be added at present. You can wait for the subsequent satellite to release the instruction capacity before traversing and adding.

[0055] Step 205, when the number of instructions of the ith task in the task list to be added is less than or equal to the current remaining instruction capacity, determine whether the sum of the total number of instructions in the current cache list to be added and the number of instructions of the ith task is less than the current remaining instruction capacity.

[0056] The order of the tasks in the task list to be added is the ascending order of the start time of the initial addition arc segment. Each task to be added corresponds to its own initial addition arc segment.

[0057] In a feasible implementation, the initial betting arc is calculated in advance, and the process of determining the initial betting arc for each task to be bet on in the task list to be bet on includes steps A1 to A4:

[0058] Step A1, traverse each available up-filled arc segment and each task in the available up-filled arc segment of the satellite.

[0059] Step A2, calculate whether the difference between the start time of the available injection arc segment and the execution start time of the task to be injected is greater than 30 seconds and less than 86400 seconds (1 day).

[0060] Step A3: If the conditions are met, the arc scores of the available arcs that meet the conditions are calculated. Specifically, the specific calculation method of the arc score is introduced in detail in the following content.

[0061] Step A4: If the arc score is greater than the threshold, the available arc is the initial arc of the current task to be added, and the next task to be added is traversed. If the arc score is less than the threshold, the next available arc is traversed.

[0062] Optionally, after step A4, the latest betting time for the task to be bet can be calculated:

[0063] Step A5, calculating the latest injection time of the task to be injected: after obtaining the initial injection arc segment, determine whether the execution start time of the initial injection arc segment overlaps with the execution start time of the task to be injected.

[0064] Step A6: If there is overlap, the latest injection time is the execution start time of the task to be injected;

[0065] If there is no overlap, the latest injection time is the start time of the initial injection arc.

[0066] Step 206, when the sum of the total number of instructions in the current cache list to be added and the number of instructions in the i-th task is less than or equal to the current remaining instruction capacity, the i-th task is added to the current cache list to be added, the total number of instructions in the current cache list to be added is updated, and the process returns to step 201 until the sum of the total number of instructions in the current cache list to be added and the number of instructions in the i-th task is greater than the current remaining instruction capacity.

[0067] Step 207: When the sum of the total number of instructions in the current cache list to be added and the number of instructions of the ith task is greater than the current remaining instruction capacity, it is determined whether the length of the quasi-addition list is 0.

[0068] Among them, all tasks in the current cache list to be added are used as the current group tasks, and the tasks in the cache list to be added are sorted in ascending order according to the start time of the initial injection arc segment.

[0069] The current cache list to be added needs to be added to the quasi-update list. The tasks in the quasi-update list are tasks that have determined the update arc and meet the instruction capacity constraint and can be update. Here, because the sum of the total number of instructions in the current cache list to be added and the number of instructions of the i-th task exceeds the current remaining instruction capacity, it means that the i-th task cannot be added to the current cache list to be added and update with the group tasks in the current cache list to be added. At this time, the current cache list to be added can no longer continue to add tasks, and it is necessary to perform the subsequent steps of finding a suitable update arc to complete the addition to the quasi-update list.

[0070] Step 208, if the length of the quasi-update list is 0, the start time of the initial update arc of the first task in the current group task to be added to the cache list is used as the start time of the update arc of the current group task, and the current group task is added to the quasi-update list. Here, the initial update arc of the first task is the update arc of the current group task.

[0071] In this step, if the length of the quasi-update list is 0, it means that the previous tasks in the quasi-update list have been completed, and the current group task is the first group task in the quasi-update list. The uplink arc of each group task is the uplink arc of the first task in the group. The quasi-uplink list includes all relevant information of the task.

[0072] Step 209, if the length of the quasi-update list is not 0, determine the start time of the update arc segment of the first task of the last group of tasks and the execution end time of the last task of the last group of tasks in the quasi-update list, and determine the start time of the update arc segment of the first task of the current group of tasks in the current cache list to be added.

[0073] Step 210, determining whether the start time of the betting arc of the first task of the last group of tasks in the quasi-betting list is equal to the start time of the initial betting arc of the first task of the current group of tasks.

[0074] Step 211, when the start time of the upward betting arc segment of the first task of the last group of tasks in the quasi-upward betting list is not equal to the start time of the initial upward betting arc segment of the first task of the current group of tasks, the start time of the initial upward betting arc segment of the first task in the current group of tasks is used as the start time of the upward betting arc segment of the current group of tasks, and the current cache list to be added is added to the quasi-upward betting list, and the current cache list to be added is cleared at the same time, and then step 215 is executed.

[0075] In this step, when the start time of the betting arc segment of the first task of the last group of tasks in the quasi-betting list is not equal to the start time of the initial betting arc segment of the first task of the current group of tasks, it means that the current group of tasks does not conflict with the betting arc segment of the tasks in the quasi-betting list, and the group of tasks can be be bet on according to the initial bet arc segment of the first task of the current group of tasks as the bet arc segment of the entire group.

[0076] Step 212, when the start time of the bet arc of the first task of the last group of tasks in the quasi bet list is equal to the start time of the initial bet arc of the first task of the current group of tasks, the bet arc of the current group of tasks is determined in the available bet arcs according to the execution end time of the last task of the last group of tasks in the quasi bet list. The available bet arcs are all bet arcs that can be used under the current satellite.

[0077] Here, if the start time is equal, it means that the upper injection arcs of the two groups of tasks conflict, and it is necessary to find a new upper injection arc for the current group task in the available upper injection arcs. All available upper injection arcs are grouped by satellite, and the arcs are stored under the corresponding satellite according to the satellite to which they belong. The list of available arcs is stored under the corresponding satellite. The arcs under the same satellite are classified according to the ground station used by the isolated segments, and the isolated segments of different satellites but the same ground stations do not conflict, and the arcs of the same ground station under the same satellite do not conflict. Each satellite has its own available upper injection arc.

[0078] Specifically, searching for a new upward betting arc segment for the current group task again must meet the following requirements: among the available upward betting arc segments, the available upward betting arc segment with the highest arc score, whose start time is greater than the execution end time of the last task of the last group task in the quasi-upward betting list, and whose difference between the execution start time of the first task of the current group task and the start time of the available upward betting arc segment is greater than the preset duration, shall be used as the upward betting arc segment for the current group task.

[0079] Here, among the available bet arcs, the screening start time is greater than the execution end time of the last task of the last group of tasks in the quasi-bet list, and before the execution start time of the first task of the current group of tasks, for example, more than 30 seconds, that is, multiple preliminary available bet arcs of preset duration, that is, the arcs after the execution of the previous group of tasks is completed and 30 seconds before the execution of the current first task begins, and then the bet arcs with the highest arc scores are screened among these preliminary available bet arcs as the new bet arcs to be found for the current group of tasks.

[0080] Furthermore, the arc score is calculated by: determining the arc score according to the length of the preliminary available up-cast arc and its weight, the weight of whether the preliminary available up-cast arc is reserved, the elevation angle of the preliminary available up-cast arc and its weight, and the weight of the time of the preliminary available up-cast arc. Specifically:

[0081] Evaluating_values=A*dt+appointedBonus+B*maxE+daytimeBouns.

[0082] Here, Evaluating_values ​​indicates the arc score, dt indicates the length of the arc, the weight of the arc length A is 1000, the longest arc does not exceed 10 minutes, appointedBonus indicates whether the arc is scheduled, if not, the weight is 2000, otherwise it is 0. Max indicates the elevation of the arc, the weight of the highest elevation is 500, and daytimeBouns indicates the weight of whether it is during the day, the weight is 1500 during the day (the start time of the arc is between 9:00 and 18:00), otherwise it is 0.

[0083] There may or may not be arc segments that meet the above conditions among the available up-annotated arc segments.

[0084] Step 213 , when no available arc segment that meets the above conditions is screened out, the current group task registration is abandoned, the current cache list to be added is cleared, and then step 215 is executed.

[0085] Step 214, when an available arc segment that meets the above conditions is screened, the current group task is added to the quasi-update list, the current cache list to be added is cleared, the cache list to be added is obtained, and then step 215 is executed. There is only one cache list to be added, and multiple tasks that meet the conditions become a group of tasks after being added. The group of tasks is added to the quasi-update list and then cleared. After being cleared, it is used as a new cache list to be added.

[0086] Step 215 , determining whether the start time of the initial injection arc segment of the i-th task is greater than the execution end time of the last task in the previous group of tasks (the group of tasks before clearing the current cache list to be added).

[0087] Before this step, the number of instructions of the i-th task does not meet the condition, so it continues to be added in this step.

[0088] Step 216 , if the start time of the initial arc segment of the i-th task is greater than the execution end time of the last task in the previous group of tasks, execute step 218 .

[0089] In this step, the start time of the initial injection arc segment of the i-th task does not conflict with the time of the previous group task, so the i-th task is added to the cleared cache list to be added.

[0090] Step 217, if the start time of the initial upper annotation arc segment of the i-th task is less than or equal to the execution end time of the last task in the previous group of tasks, determine the upper annotation arc segment of the i-th task in the available upper annotation arc segments according to the execution end time of the last task in the previous group of tasks.

[0091] In this step, searching for a new upward betting arc segment for the i-th task again requires that: the start time in the available upward betting arc segments is greater than the execution end time of the last task in the last group of tasks in the quasi-update list, and the difference between the execution start time of the i-th task and the start time of the available upward betting arc segment is greater than the preset duration of the available upward betting arc segments. The available upward betting arc segment with the highest arc segment score is used as the upward betting arc segment for the i-th task.

[0092] Here, among the available bet arcs, a plurality of preliminary available bet arcs are screened, the start time of which is greater than the execution end time of the last task of the last group of tasks in the quasi-bet list and before the execution start time of the i-th task (for example, more than 30 seconds, i.e., the preset duration), and then the bet arc with the highest arc score is screened among these preliminary available bet arcs, as a new bet arc for the i-th task. The arc score calculation method is the same as the arc score calculation method in step 212.

[0093] Step 218, adding the ith task to the emptied cache list to be added, and updating the total number of instructions in the list, and returning to step 201, until the last task in the task list to be added is added to the current cache list to be added.

[0094] Step 219, after the last group of the current cache list to be added is added to the quasi-update list, the tasks in the quasi-update list are up-update according to their respective up-update arc segments.

[0095] In a feasible implementation, the latest betting time may be calculated before placing bets. The calculation method is the same as steps A5 and A6. The task betting is performed no later than the latest betting time.

[0096] In this embodiment, appropriate injection tasks and injection arcs are selected according to the size of the remaining instruction capacity of the 2A and 2B stars to inject instruction tasks, and resources are used rationally so that all instruction tasks can be injected and executed in a timely manner, which greatly improves the injection efficiency and execution efficiency of instruction tasks.

[0097] like Figure 2As shown, the third aspect of the embodiment of the present invention provides a task injection device based on the satellite group task instruction capacity, including:

[0098] The traversal module 31 is used to perform the steps of traversing the task list to be added: when the number of instructions of the i-th task in the task list to be added is less than or equal to the current remaining instruction capacity, it is determined whether the sum of the total number of instructions in the current cache list to be added and the number of instructions of the i-th task is less than or equal to the current remaining instruction capacity; wherein the order of the tasks in the task list to be added is in ascending order of the start time of the initial addition arc segment;

[0099] The first adding module 32 is used for adding the i-th task to the current cache list to be added, and returning to execute the step of traversing the list of tasks to be added;

[0100] The judging module 33 is used to judge whether the length of the quasi-update list is 0 if no; wherein all the tasks in the current cache list to be added are taken as the current group tasks;

[0101] A determination module 34 is used for determining the upper bet segment of the current group task in the available upper bet segments according to the execution end time of the last task of the last group task in the quasi-update list if the length of the quasi-update list is not 0, when the start time of the upper bet segment of the first task of the last group task in the quasi-update list is equal to the start time of the initial upper bet segment of the first task of the current group task;

[0102] The second adding module 35 is used to add the current group task to the quasi-update list, clear the current cache list to be added, and obtain the cache list to be added;

[0103] Determine the adding module 36, which is used to determine the upper injection arc segment of the i-th task in the available upper injection arc segments according to the execution end time of the last task in the previous group of tasks when the start time of the initial upper injection arc segment of the i-th task is less than or equal to the execution end time of the last task in the previous group of tasks, and add the i-th task to the cache list to be added, and return to execute the step of traversing the list of tasks to be injected.

[0104] In one embodiment of the present invention, if the length of the quasi-update list is 0, the start time of the initial update arc segment of the first task in the current group task is determined as the start time of the update arc segment of the current group task, and the current group task is added to the quasi-update list.

[0105] In one embodiment of the present invention, determining the betting arc segment of the current group task in the available betting arc segments according to the execution end time of the last task of the last group task in the quasi-betting list includes:

[0106] The available up-betting arc segment whose start time is greater than the execution end time of the last task in the last group of tasks in the quasi-up-betting list, and the difference between the execution start time of the first task of the current group task and the start time of the available up-betting arc segment is greater than the available up-betting arc segment with the highest arc score in the preset duration, will be used as the up-betting arc segment for the current group task.

[0107] In one embodiment of the present invention, the arc segment score is determined based on the length of the arc segment and its weight, the weight of whether the arc segment is predetermined, the elevation angle of the arc segment and its weight, and the weight of the time of the arc segment.

[0108] In one embodiment of the present invention, when the start time of the upward betting arc segment of the first task of the last group of tasks in the quasi-upward betting list is not equal to the start time of the initial upward betting arc segment of the first task of the current group of tasks, then the start time of the initial upward betting arc segment of the first task of the current group of tasks is the upward betting arc segment of the current group of tasks.

[0109] In one embodiment of the present invention, determining the upper injection arc segment of the i-th task in the available upper injection arc segments according to the execution end time of the last task in the previous group of tasks includes:

[0110] The available betting arc segment with the highest arc score among the available betting arc segments whose start time in the available betting arc segment is greater than the execution end time of the last task in the last group of tasks in the quasi-betting list, and whose difference between the execution start time of the i-th task and the start time of the available betting arc segment is greater than the preset duration, shall be used as the betting arc segment for the i-th task.

[0111] In one embodiment of the present invention, when the number of instructions of the i-th task in the task list to be added is greater than the current remaining instruction capacity, it is determined whether the number of instructions of the i+1-th task in the task list to be added is greater than the current remaining instruction capacity.

[0112] A third aspect of an embodiment of the present invention provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, a task injection method based on the satellite group task instruction capacity provided by the above-mentioned embodiment of the present invention is implemented.

[0113] A fourth aspect of an embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of a task injection method based on satellite group task instruction capacity provided in the above-mentioned embodiment of the present invention are implemented.

[0114] The memory may include a random access memory (RAM) or a non-volatile memory (NVM), such as at least one disk memory. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

[0115] The above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware systems.

[0116] The method provided in the embodiment of the present invention can be applied to electronic devices. Specifically, the electronic device can be: a desktop computer, a portable computer, an intelligent mobile terminal, a server, etc. This is not limited here, and any electronic device that can implement the present invention belongs to the protection scope of the present invention.

[0117] As for the device / electronic device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0118] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (apparatus), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0119] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0120] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0121] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. A task injection method based on satellite group task instruction capacity, characterized in that: The following steps are involved: The step of traversing the list of tasks to be added is performed: when the number of instructions of the i-th task in the list of tasks to be added is less than or equal to the current remaining instruction capacity, it is determined whether the sum of the total number of instructions in the current cache list to be added and the number of instructions of the i-th task is less than or equal to the current remaining instruction capacity; wherein the order of the tasks in the list of tasks to be added is sorted in ascending order of the start time of the initial addition arc segment; If yes, then add the i-th task to the current cache list to be added, and return to execute the step of traversing the list of tasks to be added; If not, determine whether the length of the quasi-update list is 0; wherein all tasks in the current cache list to be added are taken as the current group tasks; If the length of the quasi-update list is not 0, when the start time of the update arc segment of the first task of the last group of tasks in the quasi-update list is equal to the start time of the initial update arc segment of the first task of the current group of tasks, the update arc segment of the current group of tasks is determined in the available update arc segments according to the execution end time of the last task of the last group of tasks in the quasi-update list; Add the current group task to the quasi-update list, clear the current cache list to be added, and obtain the cache list to be added; When the start time of the initial upload arc segment of the i-th task is less than or equal to the execution end time of the last task in the previous group of tasks, the upload arc segment of the i-th task is determined in the available upload arc segments according to the execution end time of the last task in the previous group of tasks, and the i-th task is added to the cache list to be added, and the step of traversing the list of tasks to be uploaded is returned.

2. The method according to claim 1, characterized in that The method also includes: if the length of the quasi-update list is 0, the start time of the initial update arc segment of the first task in the current group task is determined as the start time of the update arc segment of the current group task, and the current group task is added to the quasi-update list.

3. The method according to claim 2, characterized in that The step of determining the up-betting arc segment of the current group of tasks in the available up-betting arc segments according to the execution end time of the last task of the last group of tasks in the quasi-up-betting list comprises: The available betting arc segment whose start time is greater than the execution end time of the last task in the last group of tasks in the quasi-betting list, and the difference between the execution start time of the first task of the current group task and the start time of the available betting arc segment is greater than the available betting arc segment with the highest arc score in the available betting arc segments of the preset duration, shall be used as the betting arc segment of the current group task.

4. The method according to claim 3, characterized in that The method further comprises: The arc score is determined based on the length of the available upcast arc and its weight, the weight of whether the available upcast arc is reserved, the elevation angle of the available upcast arc and its weight, and the weight of the time of the available upcast arc.

5. The method according to claim 1, characterized in that The method further comprises: When the start time of the upward betting arc segment of the first task of the last group of tasks in the quasi-upward betting list is not equal to the start time of the initial upward betting arc segment of the first task of the current group of tasks, then the start time of the initial upward betting arc segment of the first task of the current group of tasks is the upward betting arc segment of the current group of tasks.

6. The method according to claim 1, characterized in that The step of determining the upper injection arc segment of the i-th task in the available upper injection arc segments according to the execution end time of the last task in the previous group of tasks comprises: The available betting arc segment with the highest arc score among the available betting arc segments whose start time in the available betting arc segment is greater than the execution end time of the last task in the last group of tasks in the quasi-betting list, and whose difference between the execution start time of the i-th task and the start time of the available betting arc segment is greater than the preset duration, shall be used as the betting arc segment for the i-th task.

7. The method according to claim 1, characterized in that The method further comprises: When the number of instructions of the i-th task in the task list to be added is greater than the current remaining instruction capacity, it is determined whether the number of instructions of the i+1-th task in the task list to be added is greater than the current remaining instruction capacity.

8. A task injection device based on the satellite group task instruction capacity, characterized in that: include: The traversal module is used to perform the steps of traversing the task list to be added: when the number of instructions of the i-th task in the task list to be added is less than or equal to the current remaining instruction capacity, it is determined whether the sum of the total number of instructions in the current cache list to be added and the number of instructions of the i-th task is less than or equal to the current remaining instruction capacity; wherein the order of the tasks in the task list to be added is in ascending order of the start time of the initial addition arc segment; A first adding module, for adding the i-th task to the current cache list to be added, and returning to execute the step of traversing the list of tasks to be added; A judging module, for judging whether the length of the quasi-annotation list is 0 if no; wherein all tasks in the current cache list to be added are taken as the current group tasks; A determination module, for determining the upper bet segment of the current group of tasks in the available upper bet segments according to the execution end time of the last task of the last group of tasks in the quasi-update list, if the length of the quasi-update list is not 0, when the start time of the upper bet segment of the first task of the last group of tasks in the quasi-update list is equal to the start time of the initial upper bet segment of the first task of the current group of tasks; A second adding module is used to add the current group task to the quasi-update list, clear the current cache list to be added, and obtain the cache list to be added; A determination adding module is used for determining the upper bet arc segment of the i-th task in the available upper bet arc segments according to the execution end time of the last task in the previous group of tasks when the start time of the initial upper bet arc segment of the i-th task is less than or equal to the execution end time of the last task in the previous group of tasks, and adding the i-th task to the cache list to be added, and returning to execute the step of traversing the list of tasks to be added.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the satellite breakpoint data processing method based on remote sensing images as described in any one of claims 1 to 7 is implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the satellite breakpoint data processing method based on remote sensing images according to any one of claims 1 to 7 is implemented.

Images