Method for intelligent planning and decision-making of occultation data transmission task based on genetic algorithm

Abstract

The application provides a method for intelligent planning and decision-making of occultation data transmission tasks based on a genetic algorithm, comprising the following steps: constructing a satellite-orbit-time-ground station model of an occultation system; taking the timeliness of the overall occultation system as a fitness function; taking the satellite-ground station visibility, ground station transmission time, satellite single-orbit-time task execution times, data transmission volume and orbit-time restrictions as constraint conditions, and iteratively calculating the occultation data transmission tasks by using the genetic algorithm; and finally, optimizing the genetic algorithm parameters through historical data transmission planning orbit-time data to obtain a data transmission planning strategy with the highest overall timeliness. The application has the beneficial effects that: in the case of a lack of ground station resources, the ground station utilization rate is improved as much as possible, the occultation task planning conditions and data timeliness are met, the algorithm can quickly find the orbit-time information meeting the conditions for task planning occupation, and the human cost is greatly reduced.

Description

Technical Field

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

[0002] Occultation is a popular Earth observation activity, and occultation data is crucial for meteorological support. To ensure the accurate generation of meteorological information from occultation data, occultation mission planning must meet certain timeliness requirements. However, with more and more occultations in orbit, daily mission planning has become problematic due to limited ground station resources. A genetic algorithm-based intelligent planning and decision-making method for occultation data transmission missions solves this problem. To meet the timeliness requirements, the genetic algorithm iteratively calculates the occultation data transmission mission, planning the number of transmission cycles that meet the occultation data requirements. Occultation mission design needs to consider constraints such as ground station availability and whether the ground station's visibility duration meets the data transmission mission requirements. Planning even a single occultation requires significant time and is inefficient. The genetic algorithm-based intelligent planning and decision-making method for occultation data transmission missions allows users to simply invoke the genetic algorithm, which automatically finds and plans the number of mission cycles that meet the timeliness requirements.

[0003] Drawbacks: If a genetic algorithm-based intelligent planning and decision-making method for occultation data transmission is not used, manual allocation based on orbital information is required, which is inefficient and time-consuming. If there are many satellites in orbit and ground station resources are scarce, the time required is even greater, increasing labor costs. Summary of the Invention

[0004] In view of this, the present invention aims to propose an intelligent planning-assisted decision-making method for occultation data transmission tasks based on genetic algorithms, so as to solve at least one of the problems existing in the prior art.

[0005] To achieve the above objectives, the technical solution of the present invention is implemented as follows:

[0006] A genetic algorithm-based intelligent planning and decision-making aid method for occultation data transmission tasks includes the following steps:

[0007] S1. Construct a satellite-orbit-ground station model of the occultation system;

[0008] S2. The timeliness of the overall occultation system is used as the fitness function;

[0009] S3. Using the satellite's visibility to the ground station, the ground station's transmission time, the number of missions performed by the satellite per orbit, the amount of data transmitted, and the orbit limit as constraints, a genetic algorithm is used to iteratively calculate the occultation data transmission task.

[0010] S4. Finally, the genetic algorithm parameters are optimized using historical data of data transmission planning cycles to obtain the data transmission planning strategy with the highest overall timeliness.

[0011] In step S3, the genetic algorithm includes the following steps:

[0012] S31. Analyze the timeliness issues of occultation constellation data transmission planning, and establish ground station set, satellite set, and satellite orbit set, including ground station attributes, satellite visible arc time, and maximum elevation angle information;

[0013] S32. Using the minimum completion time of each task as the objective function, ensure the data transmission of historical cycles, and introduce weights to balance the completion time and start time of tasks, and select the transmission cycles.

[0014] S33. Constraints include satellite visibility to ground stations, ground station transmission time, number of missions performed by the satellite per orbit, data transmission volume, and orbit limit.

[0015] S34. Initialize the population and generate a set of initial solutions, each solution representing a satellite and ground station scheduling scheme. Introduce a greedy algorithm to initialize the population.

[0016] S35. Based on the timeliness fitness function, perform selection, crossover, and mutation operations to iteratively solve the occultation data transmission planning task.

[0017] Furthermore, in step S31, the timeliness of the occultation constellation data transmission planning is analyzed, and a set of ground stations, satellites, and satellite orbits is established, including ground station attributes, satellite visible arc time, and maximum elevation angle information, including:

[0018] S311, the ground station set GS is shown in formula (1), where Code represents the ground station number, Time buffer This indicates the minimum adjustment time interval between two data transmissions from the ground station;

[0019] (1);

[0020] S312. Obtain the satellite set using formulas (2) and (3);

[0021] (2);

[0022] (3);

[0023] in, This represents the set of satellite attributes; D represents the date for which mission planning is required; N represents the fixed satellite number, which is convenient for users to query and confirm mission results; cT is the base time for timeliness calculation, which is the end time of the last data transmission of the previous day. Indicates the set of visible ground stations; Let F represent the set of visible ground stations for satellite N in orbit I, where F is a fixed number for each ground station. and The visible time window starts and ends, and ME represents the maximum elevation angle of ground station F relative to satellite N.

[0024] Furthermore, in step S32, the minimum completion time of each task is used as the objective function to ensure the transmission of historical data across all cycles. Weights are introduced to balance the completion and start times of tasks, and the transmission cycles are selected, including:

[0025] The objective function is set as shown in formula (4):

[0026] (4);

[0027] Where, x ijk It is a three-dimensional binary matrix representing whether satellite i uses ground station j for data transmission in orbit k, x ijk =1 indicates that x is used. ijk =0 indicates that it is not used; t ijk Transmission time: The start time of satellite i transmitting data to ground station j on orbit k, T comp，i The mission completion time of satellite i is shown in formula (5);

[0028] (5).

[0029] Furthermore, in step S33, the constraints include satellite visibility to the ground station, ground station transmission time, number of missions performed by the satellite per orbit, data transmission volume, and orbit limitations, including:

[0030] S331, Visibility constraint, to ensure that the data transmission task execution time of satellite i in the kth orbit is within the start and end time of ground station j, as shown in formula (6);

[0031] (6);

[0032] in, Indicates satellite i, Represents ground station j, Let k represent orbit number, S represent satellite set, G represent ground station set, and K represent orbit number set.

[0033] S332, Transmission time constraint: The time interval between two consecutive missions of ground station j is greater than or equal to the minimum time interval, as shown in formula (7);

[0034] (7);

[0035] S333, Task execution constraints: A single satellite can only select one ground station for transmission in each orbit, as shown in formula (8):

[0036] (8);

[0037] S334. Data transmission constraints: The historical orbital data of each satellite must be transmitted within the visible orbital period, as shown in formula (9):

[0038] (9);

[0039] S335. Data transmission condition constraints ensure that the data transfer end time of satellite i to ground station j in the kth orbit is earlier than its start time, as shown in formula (10).

[0040] (10);

[0041] S336. Cycle time constraint: Each transmission time is usually less than 300 seconds, but the last transmission of data each day cannot be a cycle of less than 300 seconds.

[0042] S337, Maximum elevation angle constraint: The maximum elevation angle of the satellite ground station is greater than the minimum value;

[0043] Among them, G j Represents the geographic coordinates of ground station j;

[0044] T min，j This represents the minimum time interval between two consecutive missions by ground station j;

[0045] V ijk V is used as a marker for satellite visibility to ground stations. If satellite i is visible to ground station j on the k-th orbit, then V... ijk =1, otherwise V ijk =0; P i This indicates the transmission power of satellite i;

[0046] Ri represents the code rate of satellite i;

[0047] T task，i The number of orbits of satellite i per day;

[0048] T min，i Satellite i represents the minimum number of tasks required to ensure data transmission, and the minimum time interval between two tasks;

[0049] D i Indicates the amount of mission data: the amount of historical orbit data that satellite i needs to transmit daily;

[0050] t ijks Transmission time: the start time of satellite i transmitting data to ground station j on orbit k;

[0051] t ijk e The data transfer end time is the time when the data transmitted by satellite i to ground station j on the kth orbit ends.

[0052] Transmission time: The start time of satellite i transmitting data to ground station j on orbit (k+1).

[0053] This represents the amount of data transmitted by satellite i to ground station j during the k-th orbit.

[0054] x ijk It is a three-dimensional binary matrix representing whether satellite i uses ground station j for data transmission in orbit k, x ijk =1 indicates that x is used. ijk =0 indicates that it is not used.

[0055] Furthermore, in step S34, the population is initialized, generating a set of initial solutions, each solution representing a satellite and ground station scheduling scheme. A greedy algorithm is introduced to initialize the population, including:

[0056] S341. Define a three-dimensional binary matrix x ijk , indicating whether satellite i uses a ground station for transmission in the kth orbit;

[0057] S342. Randomly generate an initial population that satisfies the constraints. When initializing the population, introduce a greedy algorithm: for each satellite, sort according to its data transmission requirements; for each ground station, sort according to its acceptable satellite transmission power and code rate; starting from the satellite with the largest data requirement, select the first ground station that satisfies the constraints.

[0058] Furthermore, in step S35, selection, crossover, and mutation operations are performed according to the timeliness fitness function to iteratively solve the occultation data transmission planning task, as shown in formula (11):

[0059] (11);

[0060] in, This represents the fitness value of satellite i using ground station j in orbit k, where S represents the satellite set, G represents the ground station set, K represents the orbit set, and T represents the orbit set. comp，i x represents the mission completion time of satellite i. ijk It is a three-dimensional binary matrix representing whether satellite i uses ground station j for data transmission in orbit k, x ijk =1 indicates that x is used.ijk =0 indicates that it is not used; t ijk Transmission time: The start time of satellite i transmitting data to ground station j on orbit k.

[0061] Furthermore, in step S4, the genetic algorithm parameters are optimized using historical data on data transmission planning cycles to obtain the data transmission planning strategy with the highest overall timeliness. Specifically:

[0062] Timeliness is divided into single-star single-orbit timeliness (teffic1) and single-star timeliness (teffic). sate Multi-star overall timeliness teffic all The calculation formulas are shown in formulas (12) to (14). Based on the timeliness calculation results, the genetic algorithm parameters are optimized by using historical data of data transmission planning cycles to obtain the data transmission planning strategy with the highest overall timeliness.

[0063] (12);

[0064] Where T represents the duration for which timeliness needs to be calculated, t(t c ) represents the time taken for a single star to satisfy this timeliness requirement in a single orbit, t c Indicates the number of times a single star orbits and the time taken to transmit the mission, t c e Indicates the number of times a single star orbits and the end time of the mission, t c s Indicates the start time of the mission for a single star's single orbit count;

[0065] (13)

[0066] Where T represents the duration for which timeliness needs to be calculated, t k (t c ) represents the time taken for a single star to satisfy this timeliness requirement in its k-th orbit, t c Indicates the number of times a single star orbits and the time taken to transmit the mission, t sate e Indicates the end time of a single-satellite data transmission mission, t sate s Indicates the start time of the single-satellite erasure mission;

[0067] (14);

[0068] Where T represents the duration for which timeliness needs to be calculated, t ik (t c ) represents the time taken for satellite i to satisfy the timeliness requirement on its k-th orbit, t c Indicates the number of times a single star orbits and the time taken to transmit the mission, t sate，i e t represents the end time of satellite i's data transmission mission.sate，i s This indicates the start time of the satellite i erasure mission.

[0069] Compared with existing technologies, the intelligent planning and decision-making auxiliary method for occultation data transmission tasks based on genetic algorithms described in this invention has the following advantages:

[0070] The intelligent planning and decision-making auxiliary method for occultation data transmission mission based on genetic algorithm described in this invention can quickly find orbit information that meets the conditions for mission planning and allocation when ground station resources are scarce, ground station utilization is maximized, and occultation mission planning conditions and data timeliness are met. It also greatly reduces manpower costs. Attached Figure Description

[0071] The accompanying drawings, which form part of this invention, are used to provide a further understanding of the invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an undue limitation of the invention. In the drawings:

[0072] Figure 1 This is a block diagram illustrating the principle of the method described in an embodiment of the present invention;

[0073] Figure 2 This is a schematic diagram of the number of visible orbits of a single-station satellite as described in an embodiment of the present invention;

[0074] Figure 3 This is a schematic diagram illustrating the overall timeliness of multiple satellites as described in an embodiment of the present invention;

[0075] Figure 4 This is a schematic diagram illustrating the hourly timeliness of a single satellite as described in an embodiment of the present invention. Detailed Implementation

[0076] It should be noted that, unless otherwise specified, the embodiments and features described in the present invention can be combined with each other.

[0077] In the description of this invention, it should be understood that the terms "center," "longitudinal," "lateral," "upper," "lower," "front," "rear," "left," "right," "vertical," "horizontal," "top," "bottom," "inner," and "outer," etc., indicating orientations or positional relationships based on the orientations or positional relationships shown in the accompanying drawings, are only for the convenience of describing the invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of the invention. Furthermore, the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Thus, a feature defined with "first," "second," etc., may explicitly or implicitly include one or more of that feature. In the description of this invention, unless otherwise stated, "a plurality of" means two or more.

[0078] In the description of this invention, it should be noted that, unless otherwise explicitly specified and limited, the terms "installation," "connection," and "linking" should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral connection; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; and they can refer to the internal connection of two components. Those skilled in the art will understand the specific meaning of the above terms in this invention based on the specific circumstances.

[0079] The present invention will now be described in detail with reference to the accompanying drawings and embodiments.

[0080] like Figures 1 to 2 As shown, the intelligent planning and decision-making auxiliary method for occultation data transmission tasks based on genetic algorithms includes:

[0081] A satellite-orbit-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 constraints including satellite visibility to the ground station, ground station transmission time, number of missions performed by the satellite per orbit, data transmission volume, and orbit limitations; finally, the parameters of the genetic algorithm are optimized using historical data transmission planning orbit data to obtain the data transmission planning strategy with the highest overall timeliness. The genetic algorithm specifically includes:

[0082] (1) Analyze the timeliness of occultation constellation data transmission planning, and establish a ground station set, satellite set and satellite orbit set, including information such as ground station attributes, satellite visible arc time, and maximum elevation angle.

[0083] (a) The ground station set GS is shown in the formula, where Code represents the ground station number, and Time... buffer This indicates the minimum adjustment time interval between two data transmissions from the ground station.

[0084] ;

[0085] (b) Satellite collection

[0086] ;

[0087] ;

[0088] Where D represents the date that requires mission planning; N represents the satellite's fixed number, which is convenient for users to query and confirm mission results; cT is the time reference time for timeliness calculation, which is the end time of the last data transmission of the previous day; Indicates the set of visible ground stations; Let F represent the set of visible ground stations for satellite N in orbit I, where F is a fixed number for each ground station. and The visible time window starts and ends, and ME represents the maximum elevation angle of ground station F relative to satellite N.

[0089] (2) Using the minimum completion time of each task as the objective function, we ensure that historical lap data is transmitted as early as possible, improving the timeliness of data transmission. We also introduce weights to balance the completion time and start time of tasks, facilitating more flexible selection of transmission laps. Specifically:

[0090] Therefore, the objective function is set as follows:

[0091] ;

[0092] Where x ijk It is a three-dimensional binary matrix representing whether satellite i uses ground station j for data transmission in orbit k, x ijk =1 indicates that x is used. ijk =0 indicates that it is not used; t ijk Transmission time: The start time of satellite i transmitting data to ground station j on orbit k, T comp，i The time for satellite i to complete its mission is shown in the formula.

[0093] ;

[0094] In actual calculations, weights are introduced to balance the completion time and start time of the task, making it easier to choose the number of transmission cycles more flexibly.

[0095] (3) Constraints include satellite visibility to ground stations, ground station transmission time, number of missions performed by the satellite per orbit, data transmission volume, and orbit limit.

[0096] Specific constraints are as shown in the formula.

[0097] (a) Visibility constraint, ensuring that the data transmission task execution time of satellite i in the kth orbit is within the start and end time of ground station j;

[0098] ;

[0099] (b) Transmission time constraint: the time interval between two consecutive missions of ground station j is greater than or equal to the minimum time interval;

[0100] ;

[0101] (c) Mission execution constraints: A single satellite can only select one ground station for transmission in each orbit:

[0102] ;

[0103] (d) Data transmission constraints: Historical orbital data for each satellite must be transmitted within the visible orbits.

[0104] ;

[0105] (e) Data transmission constraints ensure that the data transfer end time of satellite i to ground station j in the kth orbit is earlier than its start time;

[0106] ;

[0107] (f) Cycle time constraint: Each transmission time is usually less than 300 seconds, but the last transmission of data each day cannot be a cycle of less than 300 seconds.

[0108] (g) Maximum elevation angle constraint: The maximum elevation angle of the satellite ground station is greater than the minimum value. Among these constraints,

[0109] G j Represents the geographic coordinates (latitude and longitude) of ground station j;

[0110] T min，j This represents the minimum time interval between two consecutive missions by ground station j;

[0111] V ijk V is used as a marker for satellite visibility to ground stations. If satellite i is visible to ground station j on the k-th orbit, then V... ijk =1, otherwise V ijk =0; P i Indicates the transmission power of satellite (i);

[0112] Ri represents the code rate of satellite (i);

[0113] T task，i : The number of orbits of satellite (i) per day.

[0114] T min，i : Satellite (i) is the minimum number of missions required to ensure data transmission, and the minimum time interval between two missions.

[0115] D i Indicates the amount of mission data: the amount of historical orbit data that satellite i needs to transmit daily.

[0116] t ijk s Transmission time: the start time of satellite i transmitting data to ground station j on orbit k.

[0117] t ijk e The data transfer end time is the time when the data transmitted by satellite i to ground station j on the kth orbit ends.

[0118] This represents the amount of data transmitted by satellite i to ground station j during the k-th orbit.

[0119] x ijk It is a three-dimensional binary matrix representing whether satellite i uses ground station j for data transmission in orbit k, x ijk =1 indicates that x is used. ijk =0 indicates that it is not used.

[0120] (4) Initialize the population and generate a set of initial solutions, each solution representing a satellite and ground station scheduling scheme. In order to generate high-quality initial individuals and accelerate the algorithm convergence process, a greedy algorithm is introduced to initialize the population.

[0121] (a) Define a three-dimensional binary matrix x ijk , indicating whether satellite i uses a ground station for transmission in the kth orbit;

[0122] (b) Randomly generate an initial population that satisfies the constraints. In order to generate high-quality initial individuals and speed up the convergence process of the algorithm, a greedy algorithm is introduced when initializing the population: for each satellite, sort according to its data transmission requirements; for each ground station, sort according to its acceptable satellite transmission power and code rate; starting from the satellite with the largest data requirement, select the first ground station that satisfies the constraints.

[0123] (5) Based on the fitness function, perform selection, crossover, and mutation operations to iteratively solve the occultation data transmission planning task.

[0124] ;

[0125] in, This represents the fitness value of satellite i using ground station j in orbit k, where S represents the satellite set, G represents the ground station set, K represents the orbit set, and T represents the orbit set. comp，i x represents the mission completion time of satellite i. ijk It is a three-dimensional binary matrix representing whether satellite i uses ground station j for data transmission in orbit k, x ijk =1 indicates that x is used. ijk =0 indicates that it is not used; t ijk Transmission time: The start time of satellite i transmitting data to ground station j on orbit k.

[0126] (6) By optimizing the genetic algorithm parameters using historical data on data transmission planning cycles, a data transmission planning strategy with the highest overall timeliness is obtained. Specifically:

[0127] Timeliness is divided into single-star single-orbit timeliness (teffic1) and single-star timeliness (teffic). sate Multi-star overall timeliness teffic all The calculation formula is as follows. Based on the timeliness calculation results, the genetic algorithm parameters are optimized through historical data transmission planning cycles to obtain the data transmission planning strategy with the highest overall timeliness.

[0128] ;

[0129] Where T represents the duration for which timeliness needs to be calculated, t(t c ) represents the time taken for a single star to satisfy this timeliness requirement in a single orbit, t c Indicates the number of times a single star orbits and the time taken to transmit the mission, t c e Indicates the number of times a single star orbits and the end time of the mission, t c s Indicates the start time of the mission for a single star's single orbit count;

[0130] ;

[0131] Where T represents the duration for which timeliness needs to be calculated, t k (t c ) represents the time taken for a single star to satisfy this timeliness requirement in its k-th orbit, t c Indicates the number of times a single star orbits and the time taken to transmit the mission, t sate e Indicates the end time of a single-satellite data transmission mission, t sate s Indicates the start time of the single-satellite erasure mission;

[0132] ;

[0133] Where T represents the duration for which timeliness needs to be calculated, tik (t c ) represents the time taken for satellite i to satisfy the timeliness requirement on its k-th orbit, t c Indicates the number of times a single star orbits and the time taken to transmit the mission, t sate，i e t represents the end time of satellite i's data transmission mission. sate，i s This indicates the start time of the satellite i erasure mission.

[0134] Advantages of this invention:

[0135] Given the scarcity of ground station resources, and in order to maximize the utilization of ground stations while meeting the planning conditions for occultation missions (condition: 6 orbits per satellite per day) and ensuring data timeliness, algorithms can quickly identify orbit information that meets the conditions for mission planning and allocation.

[0136] Example 1

[0137] like Figures 3 to 4 As shown, information from 40, 50, and 90 satellites and three ground stations is substituted into the algorithm to iteratively solve the occultation data transmission planning task. The overall hourly timeliness obtained is as follows: Figure 3 As shown. The timeliness of individual satellites for 40 of them is as follows: Figure 4 As shown, the timeliness of a single satellite remains above 0.6 for six hours and above 0.95 for 12 hours. Furthermore, the program's patrol time is within 2000 milliseconds, significantly improving efficiency compared to manual planning. This allows for the rapid identification of suitable orbital information for mission planning and allocation.

[0138] 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 principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for intelligent planning and decision-making of occultation data transmission tasks based on a genetic algorithm, characterized in that: The method comprises the following steps: S1, constructing a satellite-orbit-ground station model of the occultation system; S2, taking the timeliness of the overall occultation system as a fitness function; S3, iteratively calculating the occultation data transmission task by using a genetic algorithm, with the satellite-ground station visibility, ground station transmission time, satellite single-orbit task execution times, data transmission volume, and orbit limitation as constraint conditions; S4, finally, optimizing the genetic algorithm parameters by using historical data transmission planning orbit data to obtain the data transmission planning strategy with the highest overall timeliness; In step S1, the satellite-orbit-ground station model of the occultation system under construction is a three-dimensional binary matrix x ijk , which indicates whether satellite i uses ground station j for transmission in the kth orbit; In step S3, the genetic algorithm comprises the following steps: S31, analyzing the occultation constellation data transmission planning timeliness problem, establishing a ground station set, a satellite set, and a satellite orbit set; S32, taking the minimum completion time of each task as an objective function to ensure historical orbit data transmission; S33, taking the satellite-ground station visibility, ground station transmission time, satellite single-orbit task execution times, data transmission volume, and orbit limitation as constraint conditions; S34, initializing a population to generate a group of initial solutions, each solution representing a satellite and ground station scheduling scheme, and introducing a greedy algorithm to initialize the population; S35, according to the timeliness fitness function, performing selection, crossover, and mutation operations to iteratively solve the occultation data transmission planning task; In step S31, analyzing the occultation constellation data transmission planning timeliness problem, establishing a ground station set, a satellite set, and a satellite orbit set, comprising: S311, the ground station set GS is shown in formula (1), wherein Code represents the ground station number, Time buffer represents the minimum adjustment time interval between two times of transmission of the ground station; GS = {Code, Time buffer} (1); S312, obtaining the satellite set through formulas (2) and (3); SAT element = {D, N, Src, cT} (2) SAT element represents the satellite attribute set, D represents the date that needs to be planned, N represents the satellite fixed number, which is convenient for user query and task result confirmation, cT is the time limit calculation reference time, that is, the last circle time of the last time of the previous day, and Src represents the visible ground station set; represents the visible ground station set of the satellite N in the Ith circle, and F is the ground station fixed number; and represents the start time and end time of the visible time window, and ME represents the maximum elevation angle of the ground station F to the satellite N. In step S32, taking the minimum completion time of each task as an objective function to ensure historical orbit data transmission, and introducing a weight to balance the completion time and start time of the task, and selecting a transmission orbit, comprising: setting the objective function as shown in formula (4): where x ijk is a three-dimensional binary matrix, indicating whether satellite i uses ground station j for data transmission in turn k, x ijk = 1 indicates use, x ijk = 0 indicates not to use; t ijk represents the transmission time: the start time of satellite i transmitting data to ground station j in the kth turn, T comp，i represents the task completion time of satellite i, as shown in formula (5); T comp,i = max j,k {t ijk ·x ijk} (5); In step S4, optimizing the genetic algorithm parameters by using historical data transmission planning orbit data to obtain the data transmission planning strategy with the highest overall timeliness, specifically: The time effectiveness is divided into single-star single-circle secondary time effectiveness teffic1, single-star time effectiveness teffic sate , and multi-star overall time effectiveness teffic all .

2. The genetic algorithm-based auxiliary decision-making method for intelligent planning of ionospheric scintillation data transmission tasks according to claim 1, characterized in that: In step S33, taking the satellite-ground station visibility, ground station transmission time, satellite single-orbit task execution times, data transmission volume, and orbit limitation as constraint conditions, comprising: S331, visibility constraint, ensuring that the data transmission task execution time of satellite i in the kth orbit is within the start time and end time of ground station j, as shown in formula (6); wherein, denotes satellite i, denotes ground station j, denotes orbit number k, S denotes a set of satellites, G denotes a set of ground stations, and K denotes a set of orbit numbers; S332, transmission time constraint, the time interval of two consecutive tasks of ground station j is greater than or equal to the minimum time interval, as shown in formula (7); S333, task execution constraint, a single satellite can only select one ground station for transmission in each orbit, as shown in formula (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): S335, data transmission condition constraint, ensuring that the end time of satellite i in the kth orbit for transmitting data to ground station j is earlier than the start time, as shown in formula (10); S336, orbit time constraint, the transmission time is usually less than 300s, but the last transmission data per day cannot select an orbit less than 300s; S337, maximum elevation angle constraint, the maximum elevation angle of the satellite-ground station is greater than the minimum value; where G j denotes the geographical coordinates of the ground station j; T min，j denotes the minimum time interval between two consecutive missions of ground station j; V ijk For satellite-to-ground station visibility identification, if satellite i is visible to ground station j at the kth revolution, then V ijk = 1, otherwise V ijk = 0; P i denotes the transmit power of satellite i; Ri represents the code rate of satellite i; T task，i : number of orbits per day for satellite i; T min，i : satellite i is the minimum number of tasks required to guarantee data transmission, and the minimum time interval of two tasks; D i represents the amount of task data: the amount of historical orbit data that satellite i needs to transmit daily; t ijk s is the transmission time: the start time of the transmission of data from satellite i to ground station j in the kth revolution; t ijk e is the end of the transfer time: the end of the transfer time of satellite i to ground station j in the kth revolution; t ij(k+1) Transmission time of satellite i to ground station j: the start time of the transmission of data from satellite i to ground station j in the (k+1)th orbit D ijk denotes the amount of mission data transmitted by satellite i to ground station j at the kth revolution; x ijk is a three-dimensional binary matrix indicating whether satellite i uses ground station j for data transmission at turn k, x ijk = 1 indicates use, x ijk = 0 indicates no use.

3. The genetic algorithm-based auxiliary decision-making method for intelligent planning of ionospheric scintillation data transmission tasks according to claim 1, characterized in that: In step S34, the population is initialized, a set of initial solutions is generated, each solution 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 , which indicates whether satellite i uses the ground station for transmission in the kth orbit; S342, randomly generate an initial population that satisfies the constraints, and introduce a greedy algorithm when initializing the population: for each satellite, sort it according to its data transmission demand; for each ground station, sort it according to its acceptable satellite transmission power and code rate; start from the satellite with the largest data demand, and select the first ground station that satisfies the constraint condition.

4. The genetic algorithm-based auxiliary decision-making method for intelligent planning of ionospheric scintillation data transmission tasks according to claim 1, characterized in that: In step S35, according to the timeliness fitness function, selection, crossover and mutation operations are performed to iteratively solve the occultation data transmission planning task, as shown in formula (11): where fitness(x ijk ) denotes the fitness value of satellite i using ground station j at turn k, S denotes the satellite set, G denotes the ground station set, K denotes the turn set, T comp，i denotes the mission completion time of satellite i, x ijk is a three-dimensional binary matrix, which denotes whether satellite i uses ground station j for data transmission at turn k, x ijk = 1 denotes using, x ijk = 0 denotes not using; t ijk denotes the transmission time: the start time of satellite i transmitting data to ground station j at the kth turn.

5. The genetic algorithm-based auxiliary decision-making method for intelligent planning of ionospheric sounding data transmission tasks according to any one of claims 2-4, characterized in that: In step S4, the single-star single-orbit timeliness teffic1, the single-star timeliness teffic sate , and the multi-star overall timeliness teffic all The calculation formulas are shown in formulas (12) to (14). According to the timeliness calculation results, the historical data transmission planning orbit data are used to optimize the genetic algorithm parameters, and the data transmission planning strategy with the highest overall timeliness is obtained. Wherein, T represents the time length that needs to calculate the timeliness, t(t c ) represents the time occupied by the single star single circle time that satisfies the timeliness, t c ) represents the single star single circle time that transmits the task time, t c e ) represents the single star single circle time that transmits the task end time, t c s ) represents the single star single circle time that transmits the task start time; Wherein, T represents the time length that needs to be calculated timeliness, t k (t c ) represents the time occupied by the kth single star circle that meets the timeliness, t c t represents the single star single circle time of the task, t sate e t represents the single star data transmission task end time, t sate s t represents the single star erasing task start time; Wherein, T represents the time length that needs to be calculated timeliness, t ik (t c ) represents the time occupied by satellite i the kth circle to meet the timeliness, t c Represent single satellite single circle time transfer task time, t sate，i e Represent satellite i time transfer task end time, t sate，i s Represent satellite i erasing task start time.

Images