Genetic algorithm-based occultation data transmission task intelligent planning auxiliary decision-making method

Abstract

The invention provides an occultation data transmission task intelligent planning auxiliary decision-making method based on a genetic algorithm. The method comprises the following steps: constructing a satellite-circle-ground station model of an occultation system; taking the timeliness of the whole occultation system as a fitness function; carrying out iterative calculation on the occultation data transmission task by using a genetic algorithm by taking the visibility of the satellite to the ground station, the transmission time of the ground station, the number of tasks executed by the satellite in a single circle, the data transmission quantity and the circle limitation as constraint conditions; finally, genetic algorithm parameters are adjusted and optimized through historical data transmission planning circle data, and a data transmission planning strategy with the highest overall timeliness is obtained. The method has the advantages that under the conditions that ground station resources are in shortage, the utilization rate of the ground station is increased as much as possible and occultation task planning conditions and data timeliness are met, the circle number information meeting the conditions can be quickly found through an algorithm for task planning occupation, and the labor cost is greatly reduced.

Description

Technical Field

[0001] The invention belongs to the field of occultation data transmission planning, and in particular relates to an intelligent planning auxiliary decision-making method for occultation data transmission tasks based on a genetic algorithm. Background Art

[0002] As a popular earth observation, occultation data is crucial for meteorological support work. To ensure that occultation data can accurately generate meteorological information, occultation mission planning needs to meet certain timeliness requirements. However, with more and more occultation satellites in orbit, the daily occultation mission planning becomes a problem under the condition of scarce ground station resources. The intelligent planning and decision-making assistance method for occultation data transmission tasks based on genetic algorithms solves this problem. To meet the timeliness of occultation, the occultation data transmission tasks are iteratively calculated by calling genetic algorithms to plan the number of cycles that meet the occultation data transmission requirements. The design of occultation missions needs to consider constraints such as whether the ground station is available and whether the visible time of the ground station meets the requirements of the data transmission mission. It takes a lot of time to plan a star, which is very inefficient. The intelligent planning and decision-making assistance method for occultation data transmission tasks based on genetic algorithms only needs to call the genetic algorithm for users, and the algorithm will automatically find the task cycles that meet the timeliness requirements for occupancy planning.

[0003] Disadvantages: If the genetic algorithm-based intelligent planning and decision-making auxiliary method for occupancy data transmission missions is not used, people are required to manually occupy the space based on the circle information, which is very inefficient and time-consuming. If there are many satellites in orbit and ground station resources are scarce, it will take more time and increase labor costs. Summary of the invention

[0004] In view of this, the present invention aims to propose an intelligent planning and decision-making auxiliary method for occultation data transmission mission based on genetic algorithm to solve at least one problem existing in the above-mentioned prior art.

[0005] To achieve the above object, the technical solution of the present invention is achieved as follows: An intelligent planning and decision-making auxiliary method for occultation data transmission mission based on genetic algorithm comprises the following steps: S1. Construct the satellite-circle-ground station model of the occultation system; S2, taking the timeliness of the overall occultation system as the fitness function; S3, using the satellite's visibility to the ground station, the ground station's transmission time, the number of missions performed by the satellite in a single orbit, the data transmission volume and the orbit limit as constraints, using a genetic algorithm to iteratively calculate the occultation data transmission mission; S4. Finally, the genetic algorithm parameters are tuned through the historical data transmission planning cycle data to obtain the data transmission planning strategy with the highest overall timeliness; In step S3, the genetic algorithm includes the following steps: S31. Analyze the timeliness of the occultation constellation data transmission planning, establish a ground station set, a satellite set and a satellite circle set, including ground station attributes, satellite visible arc time, and maximum elevation angle information; S32, taking the minimum completion time of each task as the objective function, ensuring the transmission of historical round data, and introducing weights to weigh the completion time and start time of the task, and selecting the transmission round; S33, using the satellite's visibility to the ground station, the ground station's transmission time, the number of missions performed by the satellite in a single turn, the data transmission volume, and the turn limit as constraints; S34, initialize the population, generate a set of initial solutions, each solution represents a satellite and ground station scheduling scheme, and introduce a greedy algorithm to initialize the population; S35. According to the time-effective fitness function, selection, crossover and mutation operations are performed to iteratively solve the occultation data transmission planning task.

[0006] Furthermore, in step S31, the timeliness of the occultation constellation data transmission planning is analyzed, and a ground station set, a satellite set, and a satellite circle set are established, including ground station attributes, satellite visible arc time, and maximum elevation angle information, including: S311, the ground station set GS is as shown in formula (1), where Code represents the ground station number, Time buffer Indicates the minimum adjustment time interval between two data transmissions of the ground station; (1); S312, obtaining a satellite set by using formula (2) and formula (3); (2); (3); in, represents a set of satellite attributes, D represents the date for which mission planning is required; N represents a fixed satellite number, which is convenient for users to query and confirm mission results; cT is the timeliness calculation benchmark time, which is the end time of the last data transmission on the previous day; represents the set of visible ground stations; represents the set of visible ground stations of satellite N in circle I, and F is the fixed number of the ground station; and It indicates the start time and end time of the visible time window, and ME indicates the maximum elevation angle of the ground station F to the satellite N.

[0007] Furthermore, in step S32, the minimum completion time of each task is used as the objective function to ensure the transmission of historical lap data, and a weight is introduced to weigh the completion time and start time of the task, and the transmission lap is selected, including: The objective function is set as shown in formula (4): (4); Among them, x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used; t ijk represents the transmission time: the start time of satellite i transmitting data to ground station j in the kth round, T comp，i represents the mission completion time of satellite i, as shown in formula (5); (5).

[0008] Furthermore, in step S33, the satellite's visibility to the ground station, the ground station's transmission time, the number of missions performed by the satellite in a single lap, the data transmission volume, and the lap limit are used as constraints, including: S331, visibility constraint, ensures that the execution time of the data transmission task of satellite i in the kth circle is within the start time and end time of ground station j, as shown in formula (6); (6); in, represents satellite i, represents ground station j, represents the circle k, S represents the satellite set, G represents the ground station set, and K represents the circle set; S332, transmission time constraint, the time interval between two consecutive tasks of ground station j is greater than or equal to the minimum time interval, as shown in formula (7); (7); S333, mission execution constraint, a single satellite can only select one ground station for transmission in each orbit, as shown in formula (8): (8); S334, data transmission volume constraint, the historical orbit data of each satellite must be transmitted within the visible orbit, as shown in formula (9): (9); S335, data transmission condition constraint, ensuring that the end time of the data transfer of satellite i to ground station j in the kth lap is earlier than its start time, as shown in formula (10); (10); S336, cycle time constraint, each transmission time is usually less than 300 seconds, but the last data transmission of each day cannot be selected in a cycle less than 300 seconds; S337, maximum elevation angle constraint, the maximum elevation angle of the satellite ground station is greater than the minimum value; Among them, G j represents the geographical coordinates of ground station j; T min，j represents the minimum time interval between two consecutive missions of ground station j; V ijk is the satellite visibility indicator to the ground station. If satellite i is visible to ground station j in the kth lap, then V ijk =1, otherwise V ijk =0;P i represents the transmission power of satellite i; Ri represents the code rate of satellite i; T task，i : Number of mission circles of satellite i per day; T min，i : The minimum number of tasks required by satellite i to ensure data transmission, and the minimum time interval between two tasks; D i represents the mission data volume: the amount of historical circle data that satellite i needs to transmit every day; t ijk s is the transmission time: the start time of data transmission from satellite i to ground station j in the kth lap; t ijk e is the transfer end time: the transfer end time of the data transmitted by satellite i to ground station j in the kth lap; Transmission time: the start time of satellite i transmitting data to ground station j in the (k+1)th round It represents the mission data volume of satellite i transmitting data to ground station j in the kth orbit; x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used.

[0009] Furthermore, in step S34, the population is initialized to generate a set of initial solutions, each of which represents a satellite and ground station scheduling scheme, and a greedy algorithm is introduced to initialize the population, including: S341. Define a three-dimensional binary matrix x ijk , indicating whether satellite i uses the ground station for transmission in the kth round; S342. Randomly generate an initial population that satisfies the constraints, and introduce a greedy algorithm when initializing the population: for each satellite, sort them according to their data transmission requirements; for each ground station, sort them according to their acceptable satellite transmission power and code rate; starting from the satellite with the largest data demand, select the first ground station that meets the constraints.

[0010] Furthermore, in step S35, selection, crossover, and mutation operations are performed according to the time-effective fitness function to iteratively solve the occultation data transmission planning task, as shown in formula (11): (11); in, represents the fitness value of satellite i using ground station j in circle k, S represents the satellite set, G represents the ground station set, K represents the circle set, T comp，i represents the mission completion time of satellite i, x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used; t ijk Represents the transmission time: the start time of data transmission from satellite i to ground station j in the kth circle.

[0011] Furthermore, in step S4, the genetic algorithm parameters are tuned by using the historical data transmission planning cycle data to obtain the data transmission planning strategy with the highest overall timeliness. Specifically: The timeliness is divided into single star single circle timeliness teffic1, single star timeliness teffic sate , multi-star overall timeliness teffic all , the calculation formula is shown in formula (12) to formula (14). According to the timeliness calculation results, the genetic algorithm parameters are tuned through the historical data transmission planning cycle data to obtain the data transmission planning strategy with the highest overall timeliness; (12); Where T represents the time required to calculate the timeliness, t(t c ) represents the time taken by a single satellite in a single orbit to meet the timeliness requirement, t c Indicates the mission time for a single satellite per round, t c e Indicates the end time of a single satellite single-circle transmission mission, t c s Indicates the start time of the single-star single-circle transmission mission; (13) Among them, T represents the time required to calculate the timeliness, t k (tc ) represents the time taken by a single star to meet the timeliness requirement for the kth time, t c Indicates the mission time for a single satellite per round, t sate e Indicates the end time of the single-satellite data transmission mission, t sate s Indicates the start time of the single star erasure mission; (14); Among them, T represents the time required to calculate the timeliness, t ik (t c ) represents the time taken by satellite i to meet the timeliness in the kth orbit, t c Indicates the mission time for a single satellite per round, t sate，i e Indicates the end time of satellite i data transmission mission, t sate，i s Indicates the start time of the satellite i erasure task.

[0012] Compared with the prior art, the intelligent planning and decision-making auxiliary method for occultation data transmission mission based on genetic algorithm described in the present invention has the following advantages: The genetic algorithm-based intelligent planning and decision-making assistance method for occultation data transmission missions described in the present invention can improve the utilization rate of ground stations as much as possible when ground station resources are scarce, meet the occultation mission planning conditions and data timeliness, and can quickly find circle information that meets the conditions for mission planning and occupancy through the algorithm, thereby greatly reducing labor costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] The accompanying drawings constituting a part of the present invention are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the accompanying drawings: Figure 1 This is a principle block diagram of the method described in an embodiment of the present invention; Figure 2 This is a schematic diagram of the visible circles of satellites at a single station according to an embodiment of the present invention; Figure 3 This is a schematic diagram of the overall timeliness of multiple satellites according to an embodiment of the present invention; Figure 4 This is a schematic diagram of the hourly effectiveness of a single satellite according to an embodiment of the present invention. DETAILED DESCRIPTION

[0014] It should be noted that, in the absence of conflict, the embodiments of the present invention and the features in the embodiments may be combined with each other.

[0015] In the description of the present invention, it should be understood that the terms "center", "longitudinal", "lateral", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and the like are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, features defined as "first", "second", and the like may explicitly or implicitly include one or more of the features. In the description of the present invention, unless otherwise specified, "multiple" means two or more.

[0016] In the description of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood by specific circumstances.

[0017] The present invention will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0018] like Figure 1 to Figure 2 As shown, the intelligent planning auxiliary decision-making method for occultation data transmission mission based on genetic algorithm includes: The satellite-circle-ground station model of the occultation system is constructed; the timeliness of the overall occultation system is used as the fitness function; the occultation data transmission task is iteratively calculated using a genetic algorithm with satellite visibility to the ground station, ground station transmission time, number of satellite missions per single circle, data transmission volume and circle limit as constraints; finally, the genetic algorithm parameters are tuned through historical data transmission planning circle data to obtain the data transmission planning strategy with the highest overall timeliness. The genetic algorithm specifically includes: (1) Analyze the timeliness of the occultation constellation data transmission planning, and establish a ground station set, a satellite set, and a satellite orbit set, which contain information such as ground station attributes, satellite visible arc time, and maximum elevation angle.

[0019] (a) The ground station set GS is shown in the formula, where Code represents the ground station number, Time buffer Indicates the minimum adjustment time interval between two data transmissions of the ground station.

[0020] ; (b) Satellite collection ; ; Among them, D represents the date that needs mission planning; N represents the fixed satellite number, which is convenient for users to query and confirm mission results; cT is the time reference time for timeliness calculation, that is, the end time of the last data transmission of the previous day; represents the set of visible ground stations; represents the set of visible ground stations of satellite N in circle I, and F is the fixed number of the ground station; and It indicates the start time and end time of the visible time window, and ME indicates the maximum elevation angle of the ground station F to the satellite N.

[0021] (2) Taking the minimum completion time of each task as the objective function, we ensure that the historical round data is transmitted as early as possible to improve the timeliness of data transmission. We also introduce weights to weigh the completion time and start time of the task, so as to facilitate more flexible selection of transmission rounds. Specifically: Therefore, the objective function is set as follows: ; where x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used; t ijk represents the transmission time: the start time of satellite i transmitting data to ground station j in the kth round, T comp，i represents the mission completion time of satellite i, as shown in the formula.

[0022] ; In actual measurement, weights are introduced to weigh the completion time and start time of the task, so as to facilitate more flexible selection of transmission cycles.

[0023] (3) The constraints include the satellite's visibility to the ground station, the ground station's transmission time, the number of missions performed by the satellite in a single orbit, the amount of data transmitted, and the orbit limit.

[0024] The specific constraints are as follows: (a) Visibility constraints ensure that the execution time of the data transmission mission of satellite i in the kth cycle is within the start time and end time of ground station j; ; (b) Transmission time constraint: the time interval between two consecutive tasks of ground station j is greater than or equal to the minimum time interval; ; (c) Mission execution constraints: a single satellite can only select one ground station for transmission in each orbit: ; (d) Data transmission capacity constraint: the historical orbit data of each satellite must be transmitted within the visible orbit: ; (e) Data transmission condition constraints ensure that the end time of data transfer from satellite i to ground station j in the kth lap is earlier than its start time; ; (f) Cycle time constraint: each transmission time is usually less than 300 seconds, but the last data transmission of the day cannot be a cycle less than 300 seconds; (g) Maximum elevation angle constraint: the maximum elevation angle of the satellite ground station is greater than the minimum value. G j represents the geographical coordinates (latitude and longitude) of ground station j; T min，j represents the minimum time interval between two consecutive missions of ground station j; V ijk is the satellite visibility indicator to the ground station. If satellite i is visible to ground station j in the kth lap, then V ijk =1, otherwise V ijk =0;P i represents the transmission power of satellite (i); Ri represents the code rate of satellite (i); T task，i : Number of mission circles of satellite (i) per day.

[0025] T min，i : The minimum number of missions required by satellite (i) to ensure data transmission, and the minimum time interval between two missions.

[0026] D i Represents the mission data volume: the amount of historical circle data that satellite i needs to transmit every day.

[0027] t ijk s is the transmission time: the start time of data transmission from satellite i to ground station j in the kth circle.

[0028] t ijk e is the transfer end time: the transfer end time of the data transmitted by satellite i to ground station j in the kth lap; It represents the mission data volume of satellite i transmitting data to ground station j in the kth orbit; xijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used.

[0029] (4) Initialize the population and generate a set of initial solutions, each of which represents a satellite and ground station scheduling scheme. At the same time, in order to generate high-quality initial individuals and speed up the convergence of the algorithm, a greedy algorithm is introduced to initialize the population.

[0030] (a) Define a three-dimensional binary matrix x ijk , indicating whether satellite i uses the ground station for transmission in the kth round; (b) Randomly generate an initial population that satisfies the constraints. In order to generate initial individuals of relatively high quality and accelerate the convergence of the algorithm, a greedy algorithm is introduced to solve the problem when initializing the population: for each satellite, sort them according to their data transmission requirements; for each ground station, sort them according to their acceptable satellite transmission power and code rate; starting from the satellite with the largest data demand, select the first ground station that meets the constraints.

[0031] (5) According to the fitness function, selection, crossover, and mutation operations are performed to iteratively solve the occultation data transmission planning task.

[0032] ; in, represents the fitness value of satellite i using ground station j in circle k, S represents the satellite set, G represents the ground station set, K represents the circle set, T comp，i represents the mission completion time of satellite i, x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used; t ijk Represents the transmission time: the start time of data transmission from satellite i to ground station j in the kth circle.

[0033] (6) The genetic algorithm parameters are tuned through historical data transmission planning cycle data to obtain the data transmission planning strategy with the highest overall timeliness. Specifically: The timeliness is divided into single star single circle timeliness teffic1 and single star timeliness teffic sate , multi-star overall timeliness teffic all ,The calculation formula is as follows. According to the timeliness calculation results, the genetic algorithm parameters are tuned through the historical data transmission planning cycle data to obtain the data transmission planning strategy with the highest overall timeliness.

[0034] ; Where T represents the time required to calculate the timeliness, t(t c ) represents the time taken by a single satellite in a single orbit to meet the timeliness requirement, t c Indicates the mission time for a single satellite per round, t c e Indicates the end time of a single satellite single-circle transmission mission, t c s Indicates the start time of the single-star single-circle transmission mission; ; Among them, T represents the time required to calculate the timeliness, t k (t c ) represents the time taken by a single star to meet the timeliness requirement for the kth time, t c Indicates the mission time for a single satellite per round, t sate e Indicates the end time of the single-satellite data transmission mission, t sate s Indicates the start time of the single star erasure mission; ; Among them, T represents the time required to calculate the timeliness, t ik (t c ) represents the time taken by satellite i to meet the timeliness in the kth orbit, t c Indicates the mission time for a single satellite per round, t sate，i e Indicates the end time of satellite i data transmission mission, t sate，i s Indicates the start time of the satellite i erasure task.

[0035] Advantages of the present invention: When ground station resources are scarce, in order to maximize ground station utilization and meet the occultation mission planning conditions (condition: a single satellite plans 6 missions per day) and data timeliness, the algorithm can quickly find the circle information that meets the conditions for mission planning and occupancy.

[0036] Example 1 like Figure 3 to Figure 4 As shown in Figure 1, the information of 40 satellites, 50 satellites, 90 satellites and three ground stations are respectively substituted into the algorithm to iteratively solve the occultation data transmission planning task. The overall hourly timeliness obtained is as follows: Figure 3 The timeliness of each satellite of the 40 satellites is shown in Figure 4As shown in the figure, it can be seen that the six-hour timeliness of a single satellite is basically maintained above 0.6, and the 12-hour timeliness of a single satellite is basically maintained above 0.95. In addition, the program patrol time is within 2000 milliseconds. Compared with the manual planning time, the efficiency is greatly improved, and it can quickly find the circle information that meets the conditions for mission planning and occupation.

[0037] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. An intelligent planning and decision-making auxiliary method for occultation data transmission mission based on genetic algorithm, characterized by: The following steps are involved: S1. Construct the satellite-circle-ground station model of the occultation system; S2, taking the timeliness of the overall occultation system as the fitness function; S3, using the satellite's visibility to the ground station, the ground station's transmission time, the number of missions performed by the satellite in a single orbit, the data transmission volume and the orbit limit as constraints, using a genetic algorithm to iteratively calculate the occultation data transmission mission; S4. Finally, the genetic algorithm parameters are tuned through the historical data transmission planning cycle data to obtain the data transmission planning strategy with the highest overall timeliness; In step S3, the genetic algorithm includes the following steps: S31. Analyze the timeliness of the occultation constellation data transmission planning, establish a ground station set, a satellite set and a satellite circle set, including ground station attributes, satellite visible arc time, and maximum elevation angle information; S32, taking the minimum completion time of each task as the objective function, ensuring the transmission of historical round data, and introducing weights to weigh the completion time and start time of the task, and selecting the transmission round; S33, using the satellite's visibility to the ground station, the ground station's transmission time, the number of missions performed by the satellite in a single turn, the data transmission volume, and the turn limit as constraints; S34, initialize the population, generate a set of initial solutions, each solution represents a satellite and ground station scheduling scheme, and introduce a greedy algorithm to initialize the population; S35. According to the time-effective fitness function, selection, crossover and mutation operations are performed to iteratively solve the occultation data transmission planning task.

2. The method for assisting decision-making in intelligent planning of occultation data transmission mission based on genetic algorithm according to claim 1, characterized in that: In step S31, the timeliness of the occultation constellation data transmission planning is analyzed, and a ground station set, a satellite set, and a satellite circle set are established, including ground station attributes, satellite visible arc time, and maximum elevation angle information, including: S311, the ground station set GS is as shown in formula (1), where Code represents the ground station number, Time buffer Indicates the minimum adjustment time interval between two data transmissions of the ground station; （1）； S312, obtaining a satellite set by using formula (2) and formula (3); （2）； （3）； in, represents a set of satellite attributes, D represents the date for which mission planning is required; N represents a fixed satellite number, which is convenient for users to query and confirm mission results; cT is the timeliness calculation benchmark time, which is the end time of the last data transmission on the previous day; represents the set of visible ground stations; represents the set of visible ground stations of satellite N in circle I, and F is the fixed number of the ground station; and It indicates the start time and end time of the visible time window, and ME indicates the maximum elevation angle of the ground station F to the satellite N.

3. The method for intelligent planning and decision-making assistance of occultation data transmission mission based on genetic algorithm according to claim 1, characterized in that: In step S32, the minimum completion time of each task is used as the objective function to ensure the transmission of historical lap data, and weights are introduced to weigh the completion time and start time of the task to select the transmission lap, including: The objective function is set as shown in formula (4): （4）； Among them, x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used; t ijk represents the transmission time: the start time of satellite i transmitting data to ground station j in the kth round, T comp，i represents the mission completion time of satellite i, as shown in formula (5); （5）。 4. The method for intelligent planning and decision-making assistance of occultation data transmission mission based on genetic algorithm according to claim 1, characterized in that: In step S33, the satellite's visibility to the ground station, the ground station's transmission time, the number of satellite missions per turn, the data transmission volume, and the turn limit are used as constraints, including: S331, visibility constraint, ensures that the execution time of the data transmission task of satellite i in the kth circle is within the start time and end time of ground station j, as shown in formula (6); （6）； in, represents satellite i, represents ground station j, represents the circle k, S represents the satellite set, G represents the ground station set, and K represents the circle set; S332, transmission time constraint, the time interval between two consecutive tasks of ground station j is greater than or equal to the minimum time interval, as shown in formula (7); （7）； S333, mission execution constraint, a single satellite can only select one ground station for transmission in each orbit, as shown in formula (8): （8）； S334, data transmission volume constraint, the historical orbit data of each satellite must be transmitted within the visible orbit, as shown in formula (9): （9）； S335, data transmission condition constraint, ensuring that the end time of the data transfer of satellite i to ground station j in the kth lap is earlier than its start time, as shown in formula (10); （10）； S336, cycle time constraint, each transmission time is usually less than 300 seconds, but the last data transmission of the day cannot be selected in a cycle less than 300 seconds; S337, maximum elevation angle constraint, the maximum elevation angle of the satellite ground station is greater than the minimum value; Among them, G j represents the geographical coordinates of ground station j; T min，j represents the minimum time interval between two consecutive missions of ground station j; V ijk is the satellite visibility indicator to the ground station. If satellite i is visible to ground station j in the kth lap, then V ijk =1, otherwise V ijk =0;P i represents the transmission power of satellite i; Ri represents the code rate of satellite i; T task，i : Number of mission circles of satellite i per day; T min，i : The minimum number of tasks required by satellite i to ensure data transmission, and the minimum time interval between two tasks; D i represents the mission data volume: the amount of historical circle data that satellite i needs to transmit every day; t ijk s is the transmission time: the start time of data transmission from satellite i to ground station j in the kth lap; t ijk e is the transfer end time: the transfer end time of the data transmitted by satellite i to ground station j in the kth lap; Transmission time: the start time of data transmission from satellite i to ground station j in the (k+1)th round; It represents the mission data volume of satellite i transmitting data to ground station j in the kth orbit; x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used.

5. The method for intelligent planning and decision-making assistance of occultation data transmission mission based on genetic algorithm according to claim 1, characterized in that: In step S34, the population is initialized to generate a set of initial solutions, each of which represents a satellite and ground station scheduling scheme. A greedy algorithm is introduced to initialize the population, including: S341. Define a three-dimensional binary matrix x ijk , indicating whether satellite i uses the ground station for transmission in the kth round; S342. Randomly generate an initial population that satisfies the constraints, and introduce a greedy algorithm when initializing the population: for each satellite, sort them according to their data transmission requirements; for each ground station, sort them according to their acceptable satellite transmission power and code rate; starting from the satellite with the largest data demand, select the first ground station that meets the constraints.

6. The method for intelligent planning and decision-making assistance of occultation data transmission mission based on genetic algorithm according to claim 1, characterized in that: In step S35, selection, crossover, and mutation operations are performed according to the time-effective fitness function to iteratively solve the occultation data transmission planning task, as shown in formula (11): （11）； in, represents the fitness value of satellite i using ground station j in circle k, S represents the satellite set, G represents the ground station set, K represents the circle set, T comp，i represents the mission completion time of satellite i, x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission in circle k, x ijk =1 means use, x ijk =0 means not used; t ijk Represents the transmission time: the start time of data transmission from satellite i to ground station j in the kth circle.

7. The method for intelligent planning and decision-making assistance of occultation data transmission mission based on genetic algorithm according to any one of claims 2 to 6, characterized in that: In step S4, the genetic algorithm parameters are tuned by using the historical data transmission planning cycle data to obtain the data transmission planning strategy with the highest overall timeliness. Specifically: The timeliness is divided into single star single circle timeliness teffic1 and single star timeliness teffic sate , multi-star overall timeliness teffic all , the calculation formula is shown in formula (12) to formula (14). According to the timeliness calculation results, the genetic algorithm parameters are tuned through the historical data transmission planning cycle data to obtain the data transmission planning strategy with the highest overall timeliness; （12）； Where T represents the time required to calculate the timeliness, t(t c ) represents the time taken by a single satellite in a single orbit to meet the timeliness requirement, t c Indicates the mission time for a single satellite per round, t c e Indicates the end time of a single satellite single-circle transmission mission, t c s Indicates the start time of the single-star single-circle transmission mission; （13） Among them, T represents the time required to calculate the timeliness, t k (t c ) represents the time taken by a single star to meet the timeliness requirement for the kth time, t c Indicates the mission time for a single satellite per round, t sate e Indicates the end time of the single-satellite data transmission mission, t sate s Indicates the start time of the single star erasure mission; （14）； Among them, T represents the time required to calculate the timeliness, t ik (t c ) represents the time taken by satellite i to meet the timeliness in the kth orbit, t c Indicates the mission time for a single satellite per round, t sate，i e represents the end time of satellite i data transmission mission, t sate，i s Indicates the start time of the satellite i erasure task.

Images