Remote sensing satellite storage inspection method and system based on remote control instruction
Through the remote sensing satellite storage inspection method based on remote control instructions, the problem of insufficient satellite storage space is solved, accurate judgment and conflict inspection of storage space are realized, and the normal execution of in-orbit satellite missions is ensured.
Patent Information
- Application Number
- CN202411121034.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-15
- Publication Date
- 2024-12-03
AI Technical Summary
The existing methods cannot accurately judge the problem of insufficient satellite storage space, resulting in storage conflicts and difficulties in judging priority in the planning and execution of in-orbit satellite missions.
A remote sensing satellite storage inspection method based on remote control instructions is proposed. By collecting service instructions, memory erasing instructions and telemetry frames, ordering instructions, priority conflict determination, and storage space calculation, and determining whether the remaining satellite storage in the current period is sufficient. If not enough Replan the task.
Accurate judgment and conflict inspection of satellite storage space are realized, the efficiency and accuracy of mission planning are improved, and the normal execution of in-orbit satellite services is ensured.
Smart Images

Figure CN119065839A_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the technical field of satellite on-orbit management, and in particular relates to an on-orbit satellite storage inspection method based on ground remote control instructions. Background Art
[0002] Satellite telemetry, tracking and control (TT&C) plays a very important role in the on-orbit operation and maintenance of satellites. Ground personnel can obtain the status and orbit information of on-orbit satellites through telemetry and tracking. Remote control is a widely used remote control method for on-orbit satellites. By injecting remote control commands, ground operators can adjust the satellite's parameters, attitude or perform specific tasks to change the satellite's operating status or handle faults.
[0003] For remote sensing satellites, their most important business is the ground imaging mission and data transmission business, and the storage of remote sensing satellites is an important factor in determining the success or failure of the mission. Since satellite telemetry data is not real-time data, when conducting mission planning, how to estimate the satellite storage status during mission execution becomes the top priority in mission planning.
[0004] The planning of imaging and data transmission tasks is completed by the ground-based mission planning system. The mission planning system is an important component of the imaging satellite operation and management platform and serves as the nerve center of the satellite ground business application system.
[0005] When planning tasks in the planning system, the plan is submitted in decision units and business instructions are generated. One or more decisions can be submitted at the same time. A decision can contain multiple tracking and receiving plans. A tracking and receiving plan contains several imaging tasks and one data transmission task. The tracking and receiving plan usually represents the data transmission of several imaging tasks using the ground station at one time. When generating business instructions in tracking and receiving plans, imaging instructions and a data transmission instruction corresponding to the number of imaging tasks in the plan will be generated. At the same time, when the imaging task needs to be compressed, the corresponding compression instruction will be generated.
[0006] The storage consumption generated by imaging tasks and compression tasks will vary due to parameters such as business duration and write rate, but the storage location of all businesses is in units of file numbers. Even if the storage consumption of businesses using the same file number is different, only the storage consumption generated by the task with the latest execution time will be used. This behavior is called file number overwrite. The planning system will generate memory erase instructions at an appropriate time. Among them, memory erase business instructions are divided into clearing instructions and file number deletion instructions. Clearing instructions will clear all data in the drive letter, while file number deletion instructions will delete data in units of file numbers.
[0007] The instructions that have been generated and posted in the database will be marked as valid. When making judgments based on instructions, the validity of the instructions in the database can be preliminarily determined through the status field of the instructions. However, due to changes in satellite missions and emergency needs, planners sometimes use priority replacement methods to replace previously posted instructions with higher-priority instructions. When performing a mission, the satellite will perform the highest-priority task in the same time period. Therefore, the instructions marked as posted in the database are not completely valid instructions, and an algorithm is needed to determine their true validity. This process is called priority conflict check.
[0008] Satellite imaging tasks are usually divided into combined tasks and non-combined tasks. A combined task is a collection of tasks. The execution time of tasks in the collection is close to each other, and the satellite's attitude maneuver duration will also be adjusted accordingly. Instructions that need to be prioritized must be time-conflicting, so special processing is required when determining conflicting priorities.
[0009] In addition, in the planning system, mission planning is submitted in decision units and business instructions are generated. One or more decisions can be submitted at the same time. One decision can contain multiple tracking and receiving plans. When a tracking and receiving plan generates instructions, there are other tracking and receiving plans in the cache that have not generated instructions, and there is a potential storage conflict. At the same time, different satellite mission planners have different habits when planning. Therefore, the storage of business consumption contained in the tracking and receiving plans in the cache also needs to be included in the calculation scope. Summary of the invention
[0010] The present invention aims to solve the problem that the existing method cannot accurately judge that the satellite storage space is insufficient.
[0011] To this end, the present invention proposes a remote sensing satellite storage inspection method and system based on remote control instructions.
[0012] A remote sensing satellite storage inspection method based on remote control instructions includes:
[0013] S1: Collecting satellite service instructions, memory erase instructions and the most recently stored related telemetry frame, determining the start time and end time of the method, and obtaining the instruction set within the time period;
[0014] S2: Determine whether the instructions in the instruction set are business instructions, obtain business instructions and non-business instructions, sort the business instructions according to the execution time sequence, and obtain a business instruction set;
[0015] S3: performing priority conflict determination on the service instruction set, removing service instructions with priority conflicts, merging the remaining service instructions with the non-service instructions, and then sorting them to obtain a second instruction set;
[0016] S4: Calculate the satellite storage remaining in the current period according to the instructions in the second instruction set;
[0017] S5: Obtain all imaging tasks in the tracking and receiving plan for which the instruction is generated at this time, and calculate the storage space consumed by this tracking and receiving plan;
[0018] S6: Calculate the storage space consumed by the imaging tasks in other tracking reception plans in this plan in the system cache;
[0019] S7: Calculate whether the remaining satellite storage in the current period is not less than the sum of the storage space consumed by the current tracking and receiving plan and the storage space consumed by the imaging tasks of other tracking and receiving plans in this plan in the system cache. If it is not less than, generate instructions to complete the injection; if it is less than, re-plan.
[0020] Furthermore, a preferred solution is provided: the service instructions of the satellite include: imaging instructions and data compression instructions.
[0021] Furthermore, a preferred solution is provided: S3 performs determination based on a priority instruction conflict determination algorithm.
[0022] Furthermore, a preferred solution is provided: S3 includes:
[0023] S3.1: Divide the service instruction set into a combined service instruction set and a non-combined service instruction set, and arrange them in order according to the instruction execution time;
[0024] S3.2: Define a bidirectional queue Q A , instruction temporary storage location c T , Q A The highest priority task is P, and the set of tasks to be judged completed is R. c ;
[0025] S3.3: traverse the combined business instruction set in order, set the traversal instruction to c, and enter S3.8 after the loop ends;
[0026] S3.4: If Q A If it is empty, add instruction c to the end of the queue, set P as the priority of instruction c, enter S3.3, and continue the loop;
[0027] S3.5: If Q A is not empty, and the difference between the end time of the execution of the tail instruction and the start time of the execution of instruction c is greater than the threshold, and the task cannot be combined, then Q AAll instructions in the task are integrated into one task. The execution start time of the task is the execution start time of the first instruction in the team, and the execution end time is the execution end time of the last instruction in the team. The task priority is P, and the task is added to the set R. c ; Clear the queue Q after completion A , P is set to 0; enter S3.3 and continue the loop;
[0028] S3.6: If Q A is not empty, the end time of the execution of the tail instruction and the start time of the execution of instruction c are within the range of combinable tasks, and there is no time conflict between the execution of the two instructions, then add instruction c to queue Q A , P is set to the maximum value of P and instruction c priority; enter S3.3 and continue the loop;
[0029] S3.7: If Q A If it is not empty, and there is a time conflict in the execution of the tail instruction, then compare the priority of P with that of instruction c. If instruction c has a higher priority or they have the same priority but are generated later, then pop out the tail instruction, otherwise go to S3.3. This process is executed repeatedly until queue Q A If it is empty or instruction c does not conflict with the end-of-queue instruction, add instruction c to queue Q. A , P is set to the maximum value of P and instruction c priority; go to step 3.3 and continue the loop;
[0030] S3.8: Traverse the set of non-combined business instructions in order, and compare whether there is a time conflict between the non-combined business instructions in order. If there is a conflict, compare the priorities of the two. The one with the highest priority or the same priority and the one with the later generation time is retained. The instruction is regarded as a task. The execution start time of the task is the instruction execution start time, the execution end time is the instruction execution end time, the task priority is the instruction priority, and the task is added to the set R u ;
[0031] S3.9: Merge set R c and the set R u , sort by task start time, and compare whether there is a time conflict in task execution time. If there is a conflict, compare the priorities of the two. The task with the highest priority or the task with the later generation time is retained when the priorities are the same; the instructions contained in the conflict-free task set after the traversal is completed are recorded as the second instruction set.
[0032] Furthermore, a preferred solution is provided: the S4 uses an on-orbit satellite storage remainder calculation algorithm to calculate the satellite storage remainder in the current period.
[0033] Furthermore, a preferred solution is provided: S4 includes:
[0034] S4.1: Sort the second instruction set in order of instruction execution time, assuming that the satellite hard disk writing speed is s, the imaging processing box compression factor is K, and the satellite storage surplus is S;
[0035] S4.2: traverse the second instruction set in order, the traversed instruction is set to c, the number of cameras opened during imaging is N, the imaging time is t, the hash table recording the file number and the corresponding storage consumption is set to w, and after the loop ends, enter S4.6;
[0036] S4.3: If the traversed instruction is an imaging service instruction, the storage consumption of the imaging service is calculated. The storage consumption Cost is:
[0037] Cost = s*N*t,
[0039] The storage file number used by the instruction is recorded as n. If w(n) exists, then S=S+w(n); calculate the storage consumption of the imaging service so that S=S-Cost, w(n)=Cost; enter S4.2 and continue the loop;
[0040] S4.4: If the traversed instruction is a compression service instruction, the storage consumption of the compression service is calculated. The storage consumption Cost is:
[0041] Cost = s*N*t*K,
[0043] The storage file number used by the instruction is recorded as n. If w(n) exists, then S=S+w(n); calculate the storage consumption of the imaging service so that S=S-Cost, w(n)=Cost; enter S4.2 and continue the loop;
[0044] S4.5: If the traversed instruction is a file number deletion service instruction, the storage file number deleted by the instruction is recorded as n, S=S+w(n); enter S4.2 and continue the loop;
[0045] S4.6: After calculation, S is the storage margin of the on-orbit satellite during the mission execution period.
[0046] Furthermore, a preferred solution is provided: S5 includes:
[0047] S5.1: Get all the imaging task sets I in the tracking and receiving plan submitted this time, assuming that the satellite hard disk writing speed is s, the imaging processing box compression factor is K, and the storage consumption is Cost A ;
[0048] S5.2: traverse the imaging task set I in order, the traversed imaging task is set to i, the number of cameras opened during imaging is N, the imaging time is t, and after the loop is completed, enter S5.4;
[0049] S5.3: If imaging task i is not compressed, the storage cost is:
[0050] Cost=s*N*t
[0051] If imaging task i is compressed, the storage cost is:
[0052] Cost = s*N*t*(1+N)
[0053] After the calculation is completed, Cost A =Cost A +Cost; enter S5.1 and continue the cycle;
[0054] S5.4: Cost after calculation A This refers to the storage space consumed by all businesses in the tracking and receiving plan submitted this time.
[0055] The present invention also proposes a remote sensing satellite storage inspection system based on remote control instructions, comprising:
[0056] Acquisition module: used to collect satellite business instructions, memory erase instructions and the most recently stored related telemetry frames, determine the start time and end time of the method, and obtain the instruction set within the time period;
[0057] A determination module: used to determine whether an instruction in the instruction set is a business instruction, obtain business instructions and non-business instructions, sort the business instructions according to the execution time sequence, and obtain a business instruction set;
[0058] A merging module is used to determine the priority conflicts of the service instruction set, remove the service instructions with priority conflicts, merge the remaining service instructions with the non-service instructions, and then sort them to obtain a second instruction set;
[0059] A first calculation module: used for calculating the satellite storage remaining in the current period according to the instructions in the second instruction set;
[0060] The second calculation module is used to obtain all imaging tasks in the tracking and receiving plan for generating the instruction at this time, and calculate the storage space consumed by this tracking and receiving plan;
[0061] The third calculation module is used to calculate the storage space consumed by the imaging tasks in other tracking and receiving plans in this plan in the system cache;
[0062] Judgment module: used to calculate whether the remaining satellite storage in the current period is not less than the sum of the storage space consumed by the current tracking and receiving plan and the storage space consumed by the imaging tasks of other tracking and receiving plans in this plan in the system cache. If it is not less than, an instruction is generated to complete the injection; if it is less than, re-planning is performed.
[0063] The present invention also proposes a computer device, including a memory and a processor, wherein a computer program is stored in the memory. When the processor runs the computer program stored in the memory, the processor executes a remote sensing satellite storage inspection method based on remote control instructions described in any combination of the above-mentioned schemes.
[0064] The present invention also proposes a computer-readable storage medium, which is used to store a computer program, and the computer program executes the steps of a remote sensing satellite storage inspection method based on remote control instructions described in any combination of the above solutions.
[0065] Compared with the prior art, the advantages of the present invention are:
[0066] The method of the present invention analyzes the effective instructions in the satellite planning system database, designs an algorithm, calculates the storage margin of the on-orbit satellite, the satellite storage consumed by the current business, and the potential storage consumption in the planning system cache, and optimizes the traditional algorithm to achieve the purpose of performing storage conflict check before the remote control instruction is injected.
[0067] The method described in the present invention is accurate, efficient, widely adaptable and easy to expand.
[0068] The simulation test and daily business application statistics show that the results obtained by using the remote sensing satellite storage inspection method proposed in the present invention are relatively accurate and reasonable, meet the business application requirements, and effectively ensure the execution of on-orbit satellite business.
[0069] The present invention is applicable to satellite on-orbit management application scenarios. BRIEF DESCRIPTION OF THE DRAWINGS
[0070] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.
[0071] Figure 1 The present invention is a flowchart of a remote sensing satellite storage inspection method based on remote control instructions as described in the first specific implementation mode of the present invention. DETAILED DESCRIPTION
[0072] In the following description, specific details such as specific system structures and technologies are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.
[0073] It should be understood that when used in this specification and the appended claims, the term "comprising" indicates the presence of described features, integers, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.
[0074] It should also be understood that the terms used in this application specification are only for the purpose of describing specific embodiments and are not intended to limit the present application. As used in this application specification and the appended claims, the singular forms "a", "an" and "the" are intended to include plural forms unless the context clearly indicates otherwise.
[0075] The following is a clear and complete description of the technical solutions in the embodiments of the present application in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0076] In the following description, many specific details are set forth to facilitate a full understanding of the present application, but the present application may also be implemented in other ways different from those described herein, and those skilled in the art may make similar generalizations without violating the connotation of the present application. Therefore, the present application is not limited to the specific implementation methods disclosed below.
[0077] Implementation method 1:
[0078] Reference Figure 1 This embodiment will be described.
[0079] A storage inspection method for a remote sensing satellite based on remote control instructions comprises the following steps:
[0080] Step 1: According to the satellite's business instructions (such as imaging instructions, data compression instructions, etc.) and memory erase instructions and the most recent storage-related telemetry frame, obtain the start time T of the entire method determination A and end time T B , get all instruction sets C within this time period.
[0081] Step 2: Determine whether it is a business instruction based on the instruction characteristics, sort the instructions according to the execution time of the business instructions, and obtain the sequential business instruction set C A .
[0082] Step 3: Traverse the business instruction set and based on the priority instruction conflict judgment algorithm, A Determine the priority conflict, filter out the business instructions that are conflicting in priority, merge them with the non-business instructions, and sort them into the instruction set C. R .
[0083] Step 3.1: C A According to whether the instruction is a combination, it is divided into a combination business instruction set C c and non-combined business instruction set C u , arrange the collections in order according to the instruction execution time.
[0084] Step 3.2: Define a bidirectional queue Q A , instruction temporary storage location c T , queue Q A The highest priority task in the task list is P. The set of tasks that have completed the judgment is R. c .
[0085] Step 3.3: Traverse the combined business instruction set C in order c , the traversed instruction is set to c, and after the loop ends, go to step 3.8.
[0086] Step 3.4: If Q A If it is empty, add instruction c to the end of the queue and set P as the priority of instruction c. Go to step 3.3 and continue the loop.
[0087] Step 3.5: If Q A is not empty, and the difference between the end time of the execution of the tail instruction and the start time of the execution of instruction c is greater than the threshold, and the task cannot be combined, then Q A All instructions in the task are integrated into one task. The execution start time of the task is the execution start time of the first instruction in the team, and the execution end time is the execution end time of the last instruction in the team. The task priority is P, and the task is added to the set R. c . Clear the queue Q after completion A , P is set to 0. Go to step 3.3 and continue the loop.
[0088] Step 3.6: If Q A is not empty, the end time of the execution of the tail instruction and the start time of the execution of instruction c are within the range of combinable tasks, and there is no time conflict between the execution of the two instructions, then add instruction c to queue Q A, P is set to the maximum value of P and instruction c priority. Go to step 3.3 and continue the loop.
[0089] Step 3.7: If Q A If P is not empty and there is a time conflict in the execution of the tail instruction, then compare the priority of P with that of instruction c. If instruction c has a higher priority or they have the same priority but are generated later, then pop the tail instruction, otherwise go to step 3.3. This process is repeated until queue Q A If it is empty or instruction c does not conflict with the end-of-queue instruction, add instruction c to queue Q. A , P is set to the maximum value of P and instruction c priority. Go to step 3.3 and continue the loop.
[0090] Step 3.8: Traverse the combined business instruction set C in order u , sequentially compare whether there is a time conflict between non-combined business instructions. If there is a conflict, compare the priorities of the two. The one with the highest priority or the same priority and the later generation time is retained. The instruction is regarded as a task. The execution start time of the task is the instruction execution start time, the execution end time is the instruction execution end time, the task priority is the instruction priority, and the task is added to the set R u .
[0091] Step 3.9: Merge set R c and the set R u , sort by task start time, and compare whether there is a time conflict in task execution time. If there is a conflict, compare the priorities of the two. The task with the highest priority or the same priority and the task with the later generation time is retained. The instructions contained in the conflict-free task set after the traversal is completed are recorded as instruction set C R .
[0092] Step 4: Calculate the satellite storage surplus S during the mission execution period according to the instruction through the on-orbit satellite storage surplus calculation algorithm.
[0093] Step 4.1: Set the instruction set C R Sort the instructions in order of execution time. Assume that the satellite hard disk write speed is s, the imaging processing box compression factor is K, and the satellite storage surplus is S.
[0094] Step 4.2: Traverse the instruction set C in order R , the traversed instruction is set to c, the number of cameras opened during imaging is N, the imaging duration is t, and the hash table recording the file number and the corresponding storage consumption is set to w. After the loop ends, go to step 4.6.
[0095] Step 4.3: If the traversed instruction is an imaging service instruction, the storage consumption of the imaging service is calculated. The storage consumption Cost is:
[0096] Cost=s*N*t
[0097] The storage file number used by the instruction is n. If w(n) exists, then S = S + w(n). Calculate the storage consumption of the imaging service so that S = S - Cost and w(n) = Cost. Go to step 4.2 and continue the loop.
[0098] Step 4.4: If the traversed instruction is a compression service instruction, the storage consumption of the compression service is calculated. The storage consumption Cost is:
[0099] Cost=s*N*t*K
[0100] The storage file number used by the instruction is n. If w(n) exists, then S = S + w(n). Calculate the storage consumption of the imaging service so that S = S - Cost and w(n) = Cost. Go to step 4.2 and continue the loop.
[0101] Step 4.5: If the traversed instruction is a file number deletion service instruction, record the number of the stored file deleted by the instruction as n, S=S+w(n). Go to step 4.2 and continue the loop.
[0102] Step 4.6: After the calculation, S is the storage margin of the on-orbit satellite during the mission execution period.
[0103] Step 5: Get all imaging tasks in the tracking and receiving plan that generates the instruction at this time, and calculate the storage space Cost consumed by this tracking and receiving plan A .
[0104] Step 5.1: Get all the imaging task sets I in the tracking and receiving plan submitted this time, assuming that the satellite hard disk writing speed is s, the imaging processing box compression factor is K, and the storage consumption is Cost A .
[0105] Step 5.2: Traverse the imaging task set I in order, the imaging task to be traversed is set to i, the number of cameras opened during imaging is N, and the imaging duration is t. After the loop is completed, go to step 5.4.
[0106] Step 5.3: If imaging task i is not compressed, the storage cost is:
[0107] Cost=s*N*t
[0108] If imaging task i is compressed, the storage cost is:
[0109] Cost = s*N*t*(1+N)
[0110] After the calculation is completed, Cost A =Cost A+Cost. Go to step 5.1 and continue the cycle.
[0111] Step 5.4: Calculate the cost after completion A This refers to the storage space consumed by all businesses in the tracking and receiving plan submitted this time.
[0112] Step 6: Calculate the storage space cost consumed by the imaging tasks in other tracking reception plans in the system cache. B .
[0113] Step 7: Calculate whether the remaining satellite storage in the current period is not less than the sum of the storage space consumed by this tracking and receiving plan and the storage space consumed by the imaging tasks of other tracking and receiving plans in this plan in the system cache. If it is not less than, generate instructions to complete the bet. If it is less than, re-plan. That is, judge S≥Cost A +Cost B Is it true? If so, generate instructions and complete the annotation; if not, throw an exception and prompt re-planning.
[0114] Implementation method 2:
[0115] In order to verify the effectiveness and accuracy of the storage inspection method of a remote sensing satellite based on remote control commands, the method is implemented in a local test environment and the implemented method is tested.
[0116] The test is based on a certain satellite command, simulating the process of establishing strips to create imaging requirements, planning satellite missions to generate decisions, and submitting decisions to generate commands. After submitting the decision, the commands to be generated mainly include imaging commands and compression commands.
[0117] The purpose of this test is to verify whether the algorithm can judge the problem of insufficient satellite storage space in the process of generating instructions in complex business scenarios. In order to ensure the integrity and accuracy of the test, the following four simulated submission services are established. The imaging time in the service is about 50 seconds. In the simulated submission service, the number of imaging and compression services, the number of tracking reception plans, and the number of submitted decisions are used as variables. The control variable method is used during the experiment to verify the impact of each parameter change on the algorithm. The situation is shown in Table 1.
[0118] Form 1 Simulation Submission Business
[0119]
[0120] In addition, it is necessary to simulate the situation of the instructions that have been placed in the database to test the satellite margin estimation part in the algorithm. To this end, two situations of the instructions that have been placed are designed in the local database with the clearing instruction as the boundary.
[0121] Table 2 simulates the instructions that have been placed
[0122]
[0123] In the simulated submission service, service 1 is the reference group, service 2 verifies the algorithm calculation after the imaging and compression services change. Services 3 and 4 respectively verify the algorithm calculation under the conditions of changes in the tracking reception plan and decision submission number.
[0124] The injected instruction part is simulated, case 1 is the reference group, and case 2 mainly tests the impact of memory erase service and priority replacement imaging task on the algorithm during the storage margin calculation part of the on-orbit satellite.
[0125] The simulated submitted business and the simulated injected instruction are partially crossed, with a total of 8 test conditions. Conditions 1-4 are the test results of each simulated submitted business under the simulated injected instruction condition 1, and conditions 4-8 are the test results of each simulated submitted business under condition 2. The test results of each test condition are shown in Table 3:
[0126] Table 3 Test results of various working conditions
[0127] Condition 1 Insufficient storage Condition 5 Ample storage Condition 2 Ample storage Condition 6 Ample storage Condition 3 Insufficient storage Condition 7 Ample storage Condition 4 Insufficient storage Condition 8 Ample storage
[0128] After inspection, the test results are consistent with the expected results, and the relevant numerical calculations are accurate. The test results prove that the above method can better judge the problem of insufficient satellite storage space in the planning system.
[0129] Those skilled in the art will appreciate that the above are only preferred embodiments of the present invention, and the various embodiments of the present disclosure and / or the features described in the claims may be combined or combined in various ways, even if such combinations or combinations are not explicitly described in the present disclosure. It is not intended to limit the present invention. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art may still modify the technical solutions described in the aforementioned embodiments, or perform equivalent substitutions on some of the technical features therein. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention shall be included in the protection scope of the present invention.
[0130] Although the preferred embodiments of the present invention have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.
[0131] 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.
[0132] Those skilled in the art will appreciate that the embodiments of the present disclosure may be provided as methods, systems or computer program products. Therefore, the present disclosure may take the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware. Moreover, the present disclosure may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0133] The present disclosure is described with reference to flowcharts and / or block diagrams of methods, devices (systems) and computer program products according to embodiments of the present disclosure. It should be understood that each process and / or block in the flowchart and / or block diagram and 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 produce 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 These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing device to work in a specific way, so that the instructions stored in the computer-readable memory produce a product including an instruction device, which implements the functions specified in the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0134] 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 The steps for the functions specified in one or more boxes.
[0135] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present disclosure rather than to limit its protection scope. Although the present disclosure has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that after reading the present disclosure, those skilled in the art can still make various changes, modifications or equivalent substitutions to the specific implementation methods of the invention, but these changes, modifications or equivalent substitutions are all within the protection scope of the disclosed claims to be approved.
Claims
1. A remote sensing satellite storage inspection method based on remote control instructions, characterized in that: The method comprises: S1: Collecting satellite service instructions, memory erase instructions and the most recently stored related telemetry frame, determining the start time and end time of the method, and obtaining the instruction set within the time period; S2: Determine whether the instructions in the instruction set are business instructions, obtain business instructions and non-business instructions, sort the business instructions according to the execution time sequence, and obtain a business instruction set; S3: performing priority conflict determination on the service instruction set, removing service instructions with priority conflicts, merging the remaining service instructions with the non-service instructions, and then sorting them to obtain a second instruction set; S4: Calculate the satellite storage remaining in the current period according to the instructions in the second instruction set; S5: Obtain all imaging tasks in the tracking and receiving plan for which the instruction is generated at this time, and calculate the storage space consumed by this tracking and receiving plan; S6: Calculate the storage space consumed by the imaging tasks in other tracking reception plans in this plan in the system cache; S7: Calculate whether the remaining satellite storage in the current period is not less than the sum of the storage space consumed by the current tracking and receiving plan and the storage space consumed by the imaging tasks of other tracking and receiving plans in this plan in the system cache. If it is not less than, generate instructions to complete the injection; if it is less than, re-plan.
2. A remote sensing satellite storage inspection method based on remote control instructions according to claim 1, characterized in that: The satellite's service instructions include: imaging instructions and data compression instructions.
3. A remote sensing satellite storage inspection method based on remote control instructions according to claim 1, characterized in that: The S3 makes a determination based on a priority instruction conflict determination algorithm.
4. A remote sensing satellite storage inspection method based on remote control instructions according to claim 3, characterized in that: The S3 includes: S3.1: Divide the service instruction set into a combined service instruction set and a non-combined service instruction set, and arrange them in order according to the instruction execution time; S3.2: Define a bidirectional queue Q A , instruction temporary storage location c T , Q A The highest priority task is P, and the set of tasks to be judged completed is R. c ; S3.3: traverse the combined business instruction set in order, set the traversal instruction to c, and enter S3.8 after the loop ends; S3.4: If Q A If it is empty, add instruction c to the end of the queue, set P as the priority of instruction c, enter S3.3, and continue the loop; S3.5: If Q A is not empty, and the difference between the end time of the execution of the tail instruction and the start time of the execution of instruction c is greater than the threshold, and the task cannot be combined, then Q A All instructions in the task are integrated into one task. The execution start time of the task is the execution start time of the first instruction in the team, and the execution end time is the execution end time of the last instruction in the team. The task priority is P, and the task is added to the set R. c ; Clear the queue Q after completion A , P is set to 0; enter S3.3 and continue the loop; S3.6: If Q A is not empty, the end time of the execution of the tail instruction and the start time of the execution of instruction c are within the range of combinable tasks, and there is no time conflict between the execution of the two instructions, then add instruction c to queue Q A , P is set to the maximum value of P and instruction c priority; enter S3.3 and continue the loop; S3.7: If Q A If it is not empty, and there is a time conflict in the execution of the tail instruction, then compare the priority of P with that of instruction c. If instruction c has a higher priority or they have the same priority but are generated later, then pop out the tail instruction, otherwise go to S3.
3. This process is executed repeatedly until queue Q A If it is empty or instruction c does not conflict with the end-of-queue instruction, add instruction c to queue Q. A , P is set to the maximum value of P and instruction c priority; go to step 3.3 and continue the loop; S3.8: Traverse the set of non-combined business instructions in order, and compare whether there is a time conflict between the non-combined business instructions in order. If there is a conflict, compare the priorities of the two. The one with the highest priority or the same priority and the one with the later generation time is retained. The instruction is regarded as a task. The execution start time of the task is the instruction execution start time, the execution end time is the instruction execution end time, the task priority is the instruction priority, and the task is added to the set R u ; S3.9: Merge set R c and the set R u , sort by task start time, and compare whether there is a time conflict in task execution time. If there is a conflict, compare the priorities of the two. The task with the highest priority or the task with the later generation time is retained when the priorities are the same; the instructions contained in the conflict-free task set after the traversal is completed are recorded as the second instruction set.
5. The remote sensing satellite storage inspection method based on remote control instructions according to claim 1 is characterized in that: The S4 uses an on-orbit satellite storage margin calculation algorithm to calculate the satellite storage margin in the current period.
6. A remote sensing satellite storage inspection method based on remote control instructions according to claim 1, characterized in that: The S4 includes: S4.1: Sort the second instruction set in order of instruction execution time, assuming that the satellite hard disk writing speed is s, the imaging processing box compression factor is K, and the satellite storage surplus is S; S4.2: traverse the second instruction set in order, the traversed instruction is set to c, the number of cameras opened during imaging is N, the imaging time is t, the hash table recording the file number and the corresponding storage consumption is set to w, and after the loop ends, enter S4.6; S4.3: If the traversed instruction is an imaging service instruction, the storage consumption of the imaging service is calculated. The storage consumption Cost is: Cost = s*N*t, The storage file number used by the instruction is recorded as n. If w(n) exists, then S=S+w(n); calculate the storage consumption of the imaging service so that S=S-Cost, w(n)=Cost; enter S4.2 and continue the loop; S4.4: If the traversed instruction is a compression service instruction, the storage consumption of the compression service is calculated. The storage consumption Cost is: Cost = s*N*t*K, The storage file number used by the instruction is recorded as n. If w(n) exists, then S=S+w(n); calculate the storage consumption of the imaging service so that S=S-Cost, w(n)=Cost; enter S4.2 and continue the loop; S4.5: If the traversed instruction is a file number deletion service instruction, the storage file number deleted by the instruction is recorded as n, S=S+w(n); enter S4.2 and continue the loop; S4.6: After calculation, S is the storage margin of the on-orbit satellite during the mission execution period.
7. The remote sensing satellite storage inspection method based on remote control instructions according to claim 1 is characterized in that: The S5 includes: S5.1: Get all the imaging task sets I in the tracking and receiving plan submitted this time, assuming that the satellite hard disk writing speed is s, the imaging processing box compression factor is K, and the storage consumption is Cost A ; S5.2: traverse the imaging task set I in order, the traversed imaging task is set to i, the number of cameras opened during imaging is N, the imaging time is t, and after the loop is completed, enter S5.4; S5.3: If imaging task i is not compressed, the storage cost is: Cost=s*N*t If imaging task i is compressed, the storage cost is: Cost = s*N*t*(1+N) After the calculation is completed, Cost A =Cost A +Cost; enter S5.1 and continue the cycle; S5.4: Cost after calculation A This refers to the storage space consumed by all businesses in the tracking and receiving plan submitted this time.
8. A remote sensing satellite storage inspection system based on remote control instructions, characterized in that: The system is implemented by a remote sensing satellite storage inspection method based on remote control instructions according to any one of claims 1 to 7, and the system comprises: Acquisition module: used to collect satellite business instructions, memory erase instructions and the most recently stored related telemetry frames, determine the start time and end time of the method, and obtain the instruction set within the time period; A determination module: used to determine whether an instruction in the instruction set is a business instruction, obtain business instructions and non-business instructions, sort the business instructions according to the execution time sequence, and obtain a business instruction set; A merging module is used to determine the priority conflicts of the service instruction set, remove the service instructions with priority conflicts, merge the remaining service instructions with the non-service instructions, and then sort them to obtain a second instruction set; A first calculation module: used for calculating the satellite storage remaining in the current period according to the instructions in the second instruction set; The second calculation module is used to obtain all imaging tasks in the tracking and receiving plan for generating the instruction at this time, and calculate the storage space consumed by this tracking and receiving plan; The third calculation module is used to calculate the storage space consumed by the imaging tasks in other tracking and receiving plans in this plan in the system cache; Judgment module: used to calculate whether the remaining satellite storage in the current period is not less than the sum of the storage space consumed by the current tracking and receiving plan and the storage space consumed by the imaging tasks of other tracking and receiving plans in this plan in the system cache. If it is not less than, an instruction is generated to complete the injection; if it is less than, re-planning is performed.
9. Computer device, characterized in that The method comprises a memory and a processor, wherein a computer program is stored in the memory, and when the processor runs the computer program stored in the memory, the processor executes the method according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that The computer-readable storage medium is used to store a computer program, and the computer program executes the steps of any one of claims 1-7.
Citation Information
Cited By
Satellite storage resource optimization method and system based on dynamic file number allocation and priority management
CN120596018A
