Imaging satellite task synthesis method and system based on maximum weight group search, product, equipment and storage medium

Abstract

The invention discloses an imaging satellite task synthesis method and system based on maximum weight group search, a product, equipment and a storage medium, belongs to the technical field of imaging satellite task planning, and solves the problem that target points as many as possible can not be synthesized in each observation in the prior art. And the technical problem of influence of different orbits, breadths and data delivery requirements on task synthesis in a satellite constellation can be flexibly solved. Extracting parameter information of the visible imaging window; constructing a composite matrix; and judging whether the composite matrixes are singular matrixes or not, if so, outputting all the established composite strips, and ending the process. And if not, establishing a synthesis strip of the maximum weight group, deleting the tasks in the synthesis strip of the maximum weight group and the tasks conflicting with the tasks, updating the synthesis matrix, and then re-judging whether the synthesis matrix is a singular matrix or not. The imaging satellite task synthesis method is used for synthesizing target points as many as possible in each observation, and can flexibly cope with different synthesis targets.

Description

Technical Field

[0001] The present invention relates to the technical field of imaging satellite mission planning, and in particular to an imaging satellite mission synthesis method, system, product, equipment and storage medium based on maximum weight clique search. Background Art

[0002] Imaging satellites are a type of Earth observation satellite that acquires ground imagery from space. They are widely used in fields such as environmental monitoring, military reconnaissance, and disaster response. Due to their fixed orbital characteristics and the need for attitude maneuvers to accurately point the sensor at the target before each imaging session, imaging satellites are limited in the number of imaging missions they can perform within each orbit. To improve the observation efficiency of these satellites, it is often considered to combine multiple missions that meet certain conditions and require multiple observations into a single observation. This not only reduces the number of attitude maneuvers and energy consumption of the satellite sensor but also ensures that the remote sensing data acquired from each mission is time-coherent. Most importantly, it increases the number of missions an imaging satellite can observe within a given orbit, significantly improving observation efficiency and achieving efficient utilization of imaging satellite resources. This provides more comprehensive remote sensing imagery information for various applications.

[0003] In traditional remote sensing image acquisition, densely packed point targets are typically assigned to multiple independent capture missions. These missions are often performed at different times, angles, or satellite configurations. This multi-shot acquisition method often results in redundant data and wastes capture resources.

[0004] In the prior art, Chinese patent document CN119440753A discloses a "multi-satellite collaborative task scheduling and planning method based on an adaptive genetic algorithm with fused and merged observations." First, regional tasks are decomposed through geometric sampling to construct discrete observation points. Second, tasks are converted into weighted meta-task sets, and the optional satellites and time windows are calculated by combining satellite resources, tasks, and attitude constraints. Further, meta-tasks that meet the conditions are detected and merged to construct a merged observation model with the goal of maximizing observation benefits. Finally, an adaptive genetic algorithm is used to optimize the solution to ensure that the constraints are met and to generate an executable multi-satellite collaborative observation scheduling plan. However, this technical solution simply merges the meta-tasks in each orbital cycle that meets the constraints, and cannot flexibly address the impact of different orbits, widths, and data delivery requirements in the satellite constellation on task synthesis.

[0005] In summary, the existing technology lacks a technical problem of an imaging satellite mission synthesis method that can synthesize as many target points as possible into each observation and can flexibly cope with the impact of different orbits, widths and data delivery requirements in the satellite constellation on mission synthesis. Summary of the Invention

[0006] The present invention solves the technical problem that the existing technology lacks an imaging satellite mission synthesis method that can synthesize as many target points as possible into each observation and can flexibly cope with the impact of different orbits, widths and data delivery requirements in the satellite constellation on mission synthesis.

[0007] The imaging satellite mission synthesis method based on maximum weight clique search of the present invention comprises the following steps: Step 1: extract parameter information of the visible imaging window of the task to be synthesized; Step 2: construct a synthesis matrix based on the parameter information of the visible imaging window of the task to be synthesized; Step 3: Determine whether all matrices in the composite matrix are singular matrices. If so, output all the composite strips that have been established and end the process. If not, execute steps 4 and 5. Step 4: Calculate the maximum weight group based on the composite matrix and establish the composite strip corresponding to the maximum weight group; Step 5: Delete the tasks to be synthesized contained in the synthesis strip corresponding to the maximum weight group, as well as the tasks to be synthesized that conflict with the synthesis strip corresponding to the maximum weight group, update the synthesis matrix, and execute step 3.

[0008] Furthermore, in an embodiment of the present invention, the parameter information of the visible imaging window of the task to be synthesized in step 1 includes the start time, end time, side swing, corresponding satellite code, shooting task code and task benefit of the task to be synthesized.

[0009] Furthermore, in the embodiment of the present invention, the synthesis matrix is ​​constructed based on the parameter information of the visible imaging window of the task to be synthesized in step 2, specifically: Based on the parameter information of the visible imaging window of the task to be synthesized, determine whether any two tasks to be synthesized can be synthesized. If so, set the value of the intersection of the rows and columns of the matrices corresponding to the two tasks to be synthesized to 1; if not, set the value of the intersection of the rows and columns of the matrices corresponding to the two tasks to be synthesized to 0 to obtain a synthesized matrix.

[0010] Furthermore, in the embodiment of the present invention, the maximum weight group is obtained by calculation in step 4, specifically: Based on the synthetic matrix, multiple maximum weight groups in the synthetic matrix are obtained, the task value weights of the multiple maximum weight groups in the synthetic matrix are calculated respectively, and the maximum weight group with the largest task value weight is taken as the maximum weight group.

[0011] Furthermore, in the embodiment of the present invention, the step 4 of establishing the synthetic strip corresponding to the maximum weight group is specifically as follows: According to different synthesis targets, the side swing of the synthetic strip corresponding to the maximum weight group is calculated, the center point time of the synthetic strip corresponding to the maximum weight group and the shooting duration of the synthetic strip corresponding to the maximum weight group are calculated, and the synthetic strip corresponding to the maximum weight group is obtained.

[0012] Furthermore, in an embodiment of the present invention, the different synthesis targets include a synthesis target of obtaining a synthesis strip with minimum side swing, and a synthesis target of obtaining a synthesis strip with the minimum total vertical track distance between the task to be synthesized and the center point of the synthesis strip.

[0013] The imaging satellite mission synthesis system based on maximum weight clique search of the present invention includes the following modules: An extraction module extracts parameter information of the visible imaging window of the task to be synthesized; A construction module constructs a synthesis matrix based on parameter information of the visible imaging window of the task to be synthesized; A judgment module determines whether all matrices in the composite matrix are singular matrices. If so, all the composite strips that have been established are output and the process ends. If not, the calculation module and the update module are executed. The calculation module calculates the maximum weight group according to the synthesis matrix and establishes the synthesis strip corresponding to the maximum weight group; The updating module deletes the tasks to be synthesized contained in the synthesis strip corresponding to the maximum weight group and the tasks to be synthesized that conflict with the synthesis strip corresponding to the maximum weight group, updates the synthesis matrix, and executes the judgment module.

[0014] A computer program product according to the present invention includes a computer program or an instruction, and is characterized in that when the computer program or the instruction is executed by a processor, any of the above-mentioned imaging satellite mission synthesis methods based on maximum weight clique search is implemented.

[0015] An electronic device according to the present invention is characterized in that it comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus; Memory for storing computer programs; The processor is configured to implement any of the above-mentioned imaging satellite mission synthesis methods based on maximum weight clique search when executing the program stored in the memory.

[0016] The computer-readable storage medium of the present invention is characterized in that a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, it implements any of the above-mentioned imaging satellite mission synthesis methods based on maximum weight clique search.

[0017] This invention solves the technical problem of the existing technology lacking an imaging satellite mission synthesis method that can synthesize as many target points as possible into each observation and can flexibly cope with the impact of different orbits, widths, and data delivery requirements in the satellite constellation on mission synthesis. Specific beneficial effects include: 1. The imaging satellite mission synthesis method based on maximum weight clique search described in the present invention extracts parameter information of the visible imaging window of the task to be synthesized, determines whether any two tasks to be synthesized can be synthesized under the same satellite, constructs a synthesis matrix based on the synthesis relationship of the tasks to be synthesized, and uses a maximum clique algorithm to sequentially and cyclically obtain the maximum weight clique. Synthesis strips corresponding to non-conflicting maximum weight cliques are established, which can quickly synthesize as many target points as possible into each observation. 2. The imaging satellite mission synthesis method based on maximum weight clique search described in the present invention can flexibly determine the roll degree, center point time, and shooting duration of the task to be synthesized based on different synthesis objectives during the process of creating the synthesis strip. This can flexibly address the impact of different orbital altitudes, orbital planes, widths, and data delivery requirements in the satellite constellation on mission synthesis, consider the task combination situation, and efficiently complete the task synthesis process. This method of creating the synthesis strip can synthesize observation windows with minimal observation roll and shortest shooting duration, thereby improving imaging quality. 3. The imaging satellite mission synthesis method based on maximum weight clique search described in the present invention determines whether any two points can be photographed simultaneously based on the side swing difference and time difference. The maximum weight clique obtained based on the maximum weight clique algorithm can ensure that they can be photographed simultaneously in one shot, ensuring that the synthetic image can accurately capture the target point to be photographed. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] The above and / or additional aspects and advantages of the present invention will become apparent and readily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which: Figure 1 This is a schematic diagram of the synthesis conditions of the tasks to be synthesized according to the first embodiment; Figure 2 is an example diagram of a partial composite matrix according to the first embodiment; Figure 3 This is a schematic diagram of the distribution of points to be synthesized in a certain area of ​​a satellite in a certain orbit according to the first embodiment; Figure 4 The abstracted task synthesis topology graph and the maximum weight group therein described in the first embodiment; Figure 5 is a schematic diagram of the tasks to be synthesized represented by the maximum weight group described in the first embodiment; Figure 6 Schematic diagrams of two situations when calculating the sway of a synthetic strip with the synthetic target of minimum sway as described in the first embodiment; Figure 7 Schematic diagram of calculating the sway of a synthetic strip with the smallest total vertical-to-track distance as the synthetic target in the first embodiment; Figure 8 This is a flow chart of the imaging satellite mission synthesis method based on maximum weight clique search described in Implementation Method 1. DETAILED DESCRIPTION

[0019] The following will clearly and completely describe various embodiments of the present invention in conjunction with the accompanying drawings. The embodiments described with reference to the accompanying drawings are exemplary and intended to be used to explain the present invention, but should not be understood as limiting the present invention.

[0020] Implementation method 1. The imaging satellite mission synthesis method based on maximum weight group search described in this implementation method comprises the following steps: Step 1: extract parameter information of the visible imaging window of the task to be synthesized; Step 2: construct a synthesis matrix based on the parameter information of the visible imaging window of the task to be synthesized; Step 3: Determine whether all matrices in the composite matrix are singular matrices. If so, output all the composite strips that have been established and end the process. If not, execute steps 4 and 5. Step 4: Calculate the maximum weight group based on the composite matrix and establish the composite strip corresponding to the maximum weight group; Step 5: Delete the tasks to be synthesized contained in the synthesis strip corresponding to the maximum weight group, as well as the tasks to be synthesized that conflict with the synthesis strip corresponding to the maximum weight group, update the synthesis matrix, and execute step 3.

[0021] In this embodiment, the parameter information of the visible imaging window of the task to be synthesized in step 1 includes the start time, end time, side swing, corresponding satellite code, shooting task code and task benefit of the task to be synthesized.

[0022] In this embodiment, the synthesis matrix is ​​constructed based on the parameter information of the visible imaging window of the task to be synthesized in step 2, specifically: Based on the parameter information of the visible imaging window of the task to be synthesized, determine whether any two tasks to be synthesized can be synthesized. If so, set the value of the intersection of the rows and columns of the matrices corresponding to the two tasks to be synthesized to 1; if not, set the value of the intersection of the rows and columns of the matrices corresponding to the two tasks to be synthesized to 0 to obtain a synthesized matrix.

[0023] In this embodiment, the maximum weight group is obtained by calculation in step 4, specifically: Based on the synthetic matrix, multiple maximum weight groups in the synthetic matrix are obtained, the task value weights of the multiple maximum weight groups in the synthetic matrix are calculated respectively, and the maximum weight group with the largest task value weight is taken as the maximum weight group.

[0024] In this embodiment, the step 4 of establishing the synthetic strip corresponding to the maximum weight group is specifically as follows: According to different synthesis targets, the side swing of the synthetic strip corresponding to the maximum weight group is calculated, the center point time of the synthetic strip corresponding to the maximum weight group and the shooting duration of the synthetic strip corresponding to the maximum weight group are calculated, and the synthetic strip corresponding to the maximum weight group is obtained.

[0025] In this embodiment, the different synthesis targets include a synthesis target of obtaining a synthesis strip with minimum side swing, and a synthesis target of obtaining a synthesis strip with the minimum total vertical track distance between the task to be synthesized and the center point of the synthesis strip.

[0026] The existing technology has the technical problem of lacking an imaging satellite mission synthesis method that can synthesize as many target points as possible into each observation and can flexibly cope with the impact of different orbits, widths and data delivery requirements in the satellite constellation on mission synthesis.

[0027] To solve the above technical problems, this embodiment provides an imaging satellite task synthesis method based on maximum weight clique search. First, all visible imaging windows of the task to be synthesized are obtained. Based on the width of a certain satellite and the maximum shooting time limit during synthesis, it is determined whether any two tasks to be synthesized can be synthesized under this satellite. The tasks to be synthesized are abstracted into a point graph. If different tasks to be synthesized can be synthesized, the two points are connected by edges. In this way, a synthetic graph of the satellite is abstracted. The synthesis relationships are recorded in the synthesis matrix. Using the maximum weight clique algorithm, the maximum weight clique is obtained in a loop in sequence. Synthetic strips that do not conflict with each other are established based on the maximum weight clique. Specifically, the following steps are included: Step 1: extract parameter information of the visible imaging window of the task to be synthesized; A visible imaging window is a candidate satellite imaging interval within a specified time period during which a satellite maintains a certain yaw angle to acquire images of a certain area on the Earth's surface. The center point of each imaging window is the point to be synthesized. This information is derived from the remote sensing satellite's orbit information, orbit calculation methods, and the longitude and latitude of the mission point.

[0028] This implementation will extract relevant parameter information such as the start time, end time, side swing (the side swing of the center point of the visible imaging window is consistent with the side swing of the visible imaging window), the corresponding satellite code, the shooting mission code, the mission benefit, etc. of each visible imaging window that meets the information requirements such as side swing, cloud cover, and solar altitude angle.

[0029] Step 2: Based on the parameter information of the visible imaging window of the task to be synthesized, determine whether any two tasks to be synthesized can be synthesized. If so, the value at the intersection of the rows and columns of the matrices corresponding to the two tasks to be synthesized is 1; if not, the value at the intersection of the rows and columns of the matrices corresponding to the two tasks to be synthesized is 0. The values ​​are recorded to obtain a synthesized matrix. To describe how to use various parameter information and synthesis rules to establish a synthesis matrix, the basic parameters of the synthesis matrix, the parameter information of the visible imaging window, and the meaning of the corresponding positions of the synthesis matrix are introduced. Table 1 shows the symbolic definitions of the basic parameters.

[0030] Table 1

[0031] The basis for synthetic judgment is: like Figure 1 As shown, each satellite No. Visible imaging window With the Visible imaging window The center point can be synthesized if the following conditions are met: ; (1) ; (2) in, For satellite Visible imaging window The visible time, For satellite Visible imaging window The visible time, For satellite Visible imaging window The center point side swing angle, For satellite Visible imaging window The center point side swing angle.

[0032] Since the parameters of the point to be synthesized and the visible imaging window are consistent except for the visible time in this embodiment, the meaning of the visible imaging window and the point to be synthesized will not be distinguished in the following except for the visible time.

[0033] Create a synthetic matrix for each satellite, and determine and write the values ​​of each position in the synthetic matrix in turn, such as Figure 2 As shown, the value at the intersection of the rows and columns of each matrix represents the state of whether the row number and column number tasks can be synthesized. If the value , it means and The two tasks can be combined if It means and The two tasks cannot be combined.

[0034] Step 3: Determine whether all matrices in the composite matrix are singular matrices. If so, output all the composite strips that have been established and end the process. If not, execute steps 4 and 5. Step 4: Based on the synthesis matrix, multiple maximum weight groups in the synthesis matrix are obtained, and the task value weights of the multiple maximum weight groups in the synthesis matrix are calculated respectively. The maximum weight group with the largest task value weight is taken as the maximum weight group. According to different synthesis targets, the side swing of the synthesis strip corresponding to the maximum weight group is calculated. Based on the side swing of the synthesis strip corresponding to the maximum weight group, the center point time of the synthesis strip corresponding to the maximum weight group and the shooting duration of the synthesis strip corresponding to the maximum weight group are calculated to obtain the synthesis strip corresponding to the maximum weight group. The specific steps include: Step 41, according to the maximum clique algorithm, find the maximum weight clique in the composite matrix; Any clique in the composite matrix is ​​a possible composite. By definition, all tasks in a clique can be combined into a single observation. The task value weights of smaller sub-cliques contained within a maximal clique are necessarily smaller than the maximal clique itself. Therefore, simply comparing the task value weights of each maximal clique can yield the maximum-weighted clique in the composite matrix.

[0035] This step uses the most commonly used classical recursive algorithm to find all the maximum weight cliques in each satellite composite matrix. The following briefly describes the specific process of using the Bron-Kerbosch algorithm to find the maximum clique in the composite matrix.

[0036] 1. Initialization: Input an undirected composite graph G.

[0037] Define three sets: P: The set of candidate nodes that may join the clique. (Initially, it is all nodes in the graph) R: Current clique. (The complete subgraph found, initially empty) X: A collection of nodes that have been processed. (Cannot be added to the group again, initially empty) 2. Design recursive function: The basic idea of ​​recursion is to select a node from the candidate node set P and add it to the current cluster R, while expanding the cluster, and return the complete cluster at the end of the recursion.

[0038] The basic operations of recursion are as follows: (1) Baseline conditions: If both P and X are empty, it means that the current clique R is a maximal clique, and R is returned.

[0039] (2) Iteration: Traverse each node v in the candidate node set P: remove node v from P and add it to the group R.

[0040] (3) Update P and X sets: The new candidate set P′=P∩N(v) is the intersection of the neighboring nodes of the current node and P.

[0041] The new exclusion set X′=X∩N(v) is the intersection of the neighboring nodes of the current node and X.

[0042] During the recursive call, the search continues on the updated P′ and X′.

[0043] Then move the node v to the exclusion set X, indicating that the processed node will no longer participate in subsequent recursion.

[0044] 3. Recursive return: Each recursion returns a found maximal clique and continues to explore other possible cliques.

[0045] Output all maximal cliques returned recursively, and the Bron-Kerbosch algorithm process ends.

[0046] like Figure 3 As shown in the figure, it is a schematic diagram of the distribution of points to be synthesized in a certain area of ​​a satellite orbit. Figure 4 As shown in the following formulas (1) and (2), the task side swing difference and task time difference are used to topologically transform the task synthesis problem into a simple point-edge graph, which is convenient for reference to the graph algorithm for calculation. After all the maximum clusters are obtained, the value weights of the tasks to be synthesized in all the maximum clusters are calculated according to the benefits of the tasks to be synthesized, and the largest weight cluster is selected, as shown in the following example: Figure 5 As shown, the points contained in the maximum weight group can be used to establish the synthetic strip with the maximum current benefit.

[0047] Step 42, calculating the center point time and the shooting duration, and establishing and recording the synthetic strip corresponding to the maximum weight group; Calculate the side swing of the center point of the composite strip: Based on actual delivery requirements, the goal is to minimize the side swing or the sum of the vertical distances between each task and the strip center point. The center point and duration of the composite strip are calculated. This is how a complete composite strip is recorded and established.

[0048] It is currently known that a series of point targets can be synthesized into a single observation. However, the sideways angle and shooting time of the center point of the synthesized strip still need to be determined: Assume that the synthetic strip h contains n tasks. Next, determine the side swing value of the synthetic strip h according to different synthetic goals.

[0049] like Figure 6 As shown, if the goal is to obtain the synthetic strip with minimum side swing, and , then the side swing of the composite strip h will be assigned to 0.

[0050] If the goal is to obtain a composite strip with minimum side swing, and ,when Corresponding task side swing value , then the side swing of the synthetic strip h is ;when Corresponding task side swing value , then the side swing of the synthetic strip h is .

[0051] like Figure 7 As shown, if the goal is to minimize the sum of the vertical distances between each synthetic task and the center point of the strip (to obtain as much information as possible about the area around each target point), the side swing of the synthetic strip h is .

[0052] Calculate the center point time and shooting duration of the synthetic strip: Synthesized strip center point time: ; (3) At this time, the shooting time of the synthetic strip can be shortened to the shortest. The shooting time of the synthetic strip is: ; (4) Step 5: Delete the tasks to be synthesized contained in the synthesis strip corresponding to the maximum weight group, as well as the tasks to be synthesized that conflict with the synthesis strip corresponding to the maximum weight group, update the synthesis matrix, and execute step 3; Delete all tasks included in the synthetic strip created in step 4. Delete all tasks that conflict with the synthetic strip corresponding to the current maximum weight group based on the satellite's maneuverability. If the task has a visible imaging window If any of the following two inequalities is met, it is considered that the synthetic task conflict.

[0053] ; (5) ; (6) Deleting all tasks that conflict with the synthesis strip corresponding to the current maximum weight group can ensure that there is no longer any possibility of conflict with the synthesis task. The conflicting task window enters the next round of synthesis process again, taking into account the task combination situation, thereby ensuring that all tasks finally synthesized do not conflict with each other.

[0054] If there are still non-singular matrices in all the synthesized matrices, then return to step 3. If all the synthesized matrices are singular matrices, then end the task synthesis process. Figure 8 As shown in FIG, a flow chart of the imaging satellite mission synthesis method based on maximum weight clique search is shown.

[0055] Implementation method 2. The imaging satellite mission synthesis system based on maximum weight group search described in this implementation method includes the following modules: An extraction module extracts parameter information of the visible imaging window of the task to be synthesized; A construction module constructs a synthesis matrix based on parameter information of the visible imaging window of the task to be synthesized; A judgment module determines whether all matrices in the composite matrix are singular matrices. If so, all the composite strips that have been established are output and the process ends. If not, the calculation module and the update module are executed. The calculation module calculates the maximum weight group according to the synthesis matrix and establishes the synthesis strip corresponding to the maximum weight group; The updating module deletes the tasks to be synthesized contained in the synthesis strip corresponding to the maximum weight group and the tasks to be synthesized that conflict with the synthesis strip corresponding to the maximum weight group, updates the synthesis matrix, and executes the judgment module.

[0056] Implementation method three. A computer program product described in this implementation method includes a computer program or instructions, which, when executed by a processor, implements the imaging satellite mission synthesis method based on maximum weight clique search described in implementation method one.

[0057] Embodiment 4. An electronic device described in this embodiment includes a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other via the communication bus; Memory for storing computer programs; The processor is configured to implement the imaging satellite mission synthesis method based on maximum weight clique search described in the first embodiment when executing the program stored in the memory.

[0058] Implementation method 5. The computer-readable storage medium described in this implementation method stores a computer program, and when the computer program is executed by a processor, it implements the imaging satellite mission synthesis method based on maximum weight clique search described in implementation method 1.

[0059] The above describes in detail the imaging satellite mission synthesis method, system, product, device and storage medium based on maximum weight clique search proposed in the present invention. Specific examples are used herein to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method and core idea of ​​the present invention. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there may be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as limiting the present invention.

Claims

1. An imaging satellite mission synthesis method based on maximum weight clique search, characterized in that: The following steps are involved: Step 1: extract parameter information of the visible imaging window of the task to be synthesized; Step 2: construct a synthesis matrix based on the parameter information of the visible imaging window of the task to be synthesized; Step 3: Determine whether all matrices in the composite matrix are singular matrices. If so, output all the composite strips that have been established and end the process. If not, execute steps 4 and 5. Step 4: Calculate the maximum weight group based on the composite matrix and establish the composite strip corresponding to the maximum weight group; Step 5: Delete the tasks to be synthesized contained in the synthesis strip corresponding to the maximum weight group, as well as the tasks to be synthesized that conflict with the synthesis strip corresponding to the maximum weight group, update the synthesis matrix, and execute step 3.

2. The imaging satellite mission synthesis method based on maximum weight clique search according to claim 1, characterized in that: The parameter information of the visible imaging window of the task to be synthesized in step 1 includes the start time, end time, side swing, corresponding satellite code, shooting task code and task benefit of the task to be synthesized.

3. The imaging satellite mission synthesis method based on maximum weight clique search according to claim 1, characterized in that: The step 2 of constructing a synthesis matrix based on the parameter information of the visible imaging window of the task to be synthesized is specifically as follows: Based on the parameter information of the visible imaging window of the task to be synthesized, determine whether any two tasks to be synthesized can be synthesized. If so, set the value of the intersection of the rows and columns of the matrices corresponding to the two tasks to be synthesized to 1; if not, set the value of the intersection of the rows and columns of the matrices corresponding to the two tasks to be synthesized to 0 to obtain a synthesized matrix.

4. The imaging satellite mission synthesis method based on maximum weight clique search according to claim 1, characterized in that: The maximum weight group obtained by calculation in step 4 is specifically: Based on the synthetic matrix, multiple maximum weight groups in the synthetic matrix are obtained, the task value weights of the multiple maximum weight groups in the synthetic matrix are calculated respectively, and the maximum weight group with the largest task value weight is taken as the maximum weight group.

5. The imaging satellite mission synthesis method based on maximum weight clique search according to claim 1, characterized in that: The synthetic strip corresponding to the maximum weight group in step 4 is specifically established as follows: According to different synthesis targets, the side swing of the synthetic strip corresponding to the maximum weight group is calculated, the center point time of the synthetic strip corresponding to the maximum weight group and the shooting duration of the synthetic strip corresponding to the maximum weight group are calculated, and the synthetic strip corresponding to the maximum weight group is obtained.

6. The imaging satellite mission synthesis method based on maximum weight clique search according to claim 5, characterized in that: The different synthesis targets include a synthesis target of obtaining a synthesis strip with minimum side swing, and a synthesis target of obtaining a synthesis strip with the minimum total vertical track distance between the task to be synthesized and the center point of the synthesis strip.

7. An imaging satellite mission synthesis system based on maximum weight clique search, characterized in that: Includes the following modules: An extraction module extracts parameter information of the visible imaging window of the task to be synthesized; A construction module constructs a synthesis matrix based on parameter information of the visible imaging window of the task to be synthesized; A judgment module determines whether all matrices in the composite matrix are singular matrices. If so, all the composite strips that have been established are output and the process ends. If not, the calculation module and the update module are executed. The calculation module calculates the maximum weight group according to the synthesis matrix and establishes the synthesis strip corresponding to the maximum weight group; The updating module deletes the tasks to be synthesized contained in the synthesis strip corresponding to the maximum weight group and the tasks to be synthesized that conflict with the synthesis strip corresponding to the maximum weight group, updates the synthesis matrix, and executes the judgment module.

8. A computer program product comprising a computer program or instructions, characterized in that When the computer program or instruction is executed by a processor, the imaging satellite mission synthesis method based on maximum weight clique search described in any one of claims 1 to 6 is implemented.

9. An electronic device, characterized in that: It includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus; Memory for storing computer programs; The processor is configured to implement the imaging satellite mission synthesis method based on maximum weight clique search as described in any one of claims 1 to 6 when executing a program stored in the memory.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the imaging satellite mission synthesis method based on maximum weight clique search according to any one of claims 1 to 6 is implemented.

Images