Satellite gateway station feed link partition shortest distance task planning method and system for giant constellation

Abstract

The invention provides a satellite gateway station feed link partition shortest distance task planning method and system for giant constellations, and the method comprises the steps: collecting the information needed by task planning based on task demands, and setting scene parameters; dividing the task area into a plurality of subareas, and clustering the gateway stations in each subarea; calculating the longitude, latitude and height of each satellite at each moment in the planning period through an orbit forecasting algorithm; for each area, determining a visible satellite set between satellites and a gateway station feed link establishment task through orbit forecast information; generating a constellation gateway station feed link allocation scheme according to the visible satellite set by using a satellite gateway station feed link shortest distance task planning algorithm based on partition; and performing simulation verification on the constellation gateway station feed link distribution scheme. The method provided by the invention has an efficient and simple solving process and a relatively strong practical application capability, and provides an effective solution for a networking planning function in constellation operation and maintenance management.

Description

Technical Field

[0001] The present invention belongs to the technical field of constellation gateway mission planning, and relates to a method for task planning of the shortest distance of the feeder link of a satellite gateway for a giant constellation. Background Art

[0002] In recent years, with the continuous expansion of the scale of low-earth orbit constellations at home and abroad, low-earth orbit constellations have become an important part of the future space-air-ground integrated network. In the emerging low-earth orbit constellation network architecture, satellites, as access nodes of the space network, play an important role as space-based mobile base stations, while gateways undertake the gateway function of connecting satellite networks and ground networks. Data accesses the ground network through the gateway, and in this process, the space-ground air interface communication protocol and network protocol are converted, enabling users to conveniently access rich resources using ground network facilities.

[0003] However, with the continuous increase in the number of satellite gateways, how to achieve the continuous connection between the ground network and the satellite network and how to switch the feeder link between different visible satellites by the gateway have become important challenges faced by the low-earth orbit constellation system. As an important link in realizing the space-ground integrated network, the problem of high-complexity task allocation in the low-earth orbit satellite link switching needs to be solved urgently.

[0004] To solve this problem, various task planning methods have been adopted currently, including exact algorithms, heuristic algorithms, contract net protocol algorithms, machine learning, etc. However, these methods all have certain defects when applied to the networking of giant constellation gateways. For example, although exact algorithms are accurate, they consume expensive time and storage space; it is difficult to extract rules from heuristic algorithms in complex scenarios, and the constraint effect is limited; contract net protocol algorithms are prone to falling into local optima; while machine learning, although having potential, has a time-consuming training process and the "black box" characteristic, and it is difficult to apply in scenarios with high security requirements.

[0005] Therefore, how to solve the task planning problem of the feeder link of satellite gateways in giant constellations, achieve efficient task allocation, shorten the switching times of satellite gateways, increase the satellite link establishment duration, and at the same time ensure global coverage and user communication quality is a problem worthy of in-depth thinking and exploration. Summary of the Invention

[0006] To solve the above problems, the present invention proposes a method and system for task planning of the shortest distance of the feeder link of a satellite gateway for a giant constellation.

[0007] The technical solution adopted by the present invention is as follows:

[0008] A method for task planning of the shortest distance of the feeder link of a satellite gateway for a giant constellation, comprising the following steps:

[0009] Collect the information required for mission planning based on mission requirements and set the scene parameters;

[0010] Divide the mission area into several partitions and cluster the gateway stations within each partition;

[0011] Calculate the longitude, latitude and altitude of each satellite at each moment within the planning period through the orbit prediction algorithm;

[0012] For each area, determine the visible satellite set between the satellite and the gateway station feeder link establishment mission through the orbit prediction information;

[0013] Generate the constellation gateway station feeder link allocation plan according to the visible satellite set by using the partition-based shortest distance mission planning algorithm for satellite gateway station feeder links;

[0014] Simulate and verify the constellation gateway station feeder link allocation plan.

[0015] Furthermore, the information required for mission planning includes global coverage requirements, gateway station longitude and latitude coordinates, gateway station antenna occupancy status, constellation occupancy status, longest link establishment duration, mission priority; the scene parameters include planning period, satellite orbit parameters.

[0016] Furthermore, the orbit prediction algorithm adopts the Simplified General Perturbations 4 (SGP4) model based on the Two-Line Orbital Element (TLE) of the satellite.

[0017] Furthermore, determining the visible satellite set between the satellite and the gateway station feeder link establishment mission through the orbit prediction information specifically includes: calculating the visible satellites in the current area at each moment within the planning period through the satellite gateway station visibility algorithm based on the ray discrimination method, and determining the visible satellite set.

[0018] Furthermore, the satellite gateway station visibility algorithm based on the ray discrimination method is specifically: judging whether the sub-satellite point is inside the polygon through the satellite position and the current area polygon by using the ray discrimination method.

[0019] Furthermore, generating the constellation gateway station feeder link allocation plan according to the visible satellite set by using the partition-based shortest distance mission planning algorithm for satellite gateway station feeder links specifically includes:

[0020] Obtain the antenna status of each gateway station at the current moment, and determine the occupied satellite set in the visible satellite set of the current area according to the antenna status;

[0021] Traverse the satellites that are in the visible satellite set but not in the occupied satellite set. For each satellite, calculate its distance to each gateway station in the current area;

[0022] If the gateway station with the shortest distance has an idle antenna, allocate the idle antenna of the gateway station with the shortest distance to the current satellite; if the gateway station with the shortest distance has no idle antenna, switch to the antenna with the second shortest distance for satellite allocation, and so on;

[0023] Update the antenna connection status and connection duration of the gateway station according to the current satellite allocation situation;

[0024] Record the link status of the gateway station antennas and satellites at each moment during the planning period to obtain the constellation gateway station feeder link allocation scheme.

[0025] Furthermore, if all gateway stations in the current area have no available antennas at the current moment, the current satellite will not be allocated at the current moment.

[0026] Furthermore, the simulation verification includes coverage analysis and the formulation and verification of high-latitude shutdown plans.

[0027] A satellite gateway station feeder link partition shortest distance mission planning system for a giant constellation, comprising:

[0028] Requirement analysis and task preprocessing module: used to collect the information required for task planning based on task requirements, set scene parameters; divide the task area into several partitions, cluster the gateway stations in each partition; calculate the longitude, latitude and altitude of each satellite at each moment during the planning period through the orbit prediction algorithm; for each area, determine the visible satellite set between the satellite and the gateway station feeder link establishment task through the orbit prediction information;

[0029] Algorithm solving module: used to generate the constellation gateway station feeder link allocation scheme according to the visible satellite set by using the partition-based satellite gateway station feeder link shortest distance mission planning algorithm;

[0030] Simulation verification module: used to perform simulation verification on the constellation gateway station feeder link allocation scheme.

[0031] A computer device, the computer device includes:

[0032] One or more processors;

[0033] A memory for storing one or more programs;

[0034] When the one or more programs are executed by the one or more processors, the one or more processors implement the above-mentioned satellite gateway station feeder link partition shortest distance mission planning method for a giant constellation.

[0035] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0036] The present invention proposes a method for task planning of the shortest distance for the feeder link of a satellite gateway station for a giant constellation, which solves the problem of task planning for the feeder link of a satellite gateway station in a giant constellation. This method can artificially set constraint conditions based on task requirements, enabling users to flexibly adjust the constraints according to specific application scenarios, thereby ensuring the pertinence and effectiveness of the planning scheme. In addition, this method also has a relatively efficient and simple solution process, significantly improving the efficiency and operability of task planning, and at the same time demonstrating strong practical application capabilities.

[0037] The present invention also solves the problem of feeder link networking planning for thousands of satellites and thousands of gateway station antennas with a high solution rate, providing an effective solution for the constellation operation and maintenance management of the space-air integrated network. Especially in terms of the networking planning function, the present invention brings significant convenience and benefits to the actual space-air integrated network. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 It is a schematic diagram of the process design of the method in the embodiment of the present invention.

[0039] Figure 2 It is a flowchart of the demand analysis and task preprocessing part in the embodiment of the present invention.

[0040] Figure 3 It is a flowchart of the shortest distance task planning algorithm for the feeder link of a satellite gateway station based on partitioning in the embodiment of the present invention.

[0041] Figure 4 It is a schematic diagram of the overlapping area covered by two adjacent orbital planes in the embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0042] The technical solutions of the invention will be further clearly and detailedly described below with reference to the accompanying drawings.

[0043] A method for task planning of the shortest distance for the feeder link of a satellite gateway station for a giant constellation provided in this embodiment includes the following steps:

[0044] S1. Collect the information required for task planning based on task requirements and set the scenario parameters; the information required for task planning includes global coverage requirements, the longitude and latitude coordinates of the gateway station, the occupied state of the gateway station antenna, the occupied state of the constellation, the longest link establishment duration, and the task priority; the scenario parameters include the planning period and satellite orbit parameters.

[0045] S2. Calculate the longitude, latitude and altitude of each satellite at each moment within the planning period through the orbit prediction algorithm; the orbit prediction algorithm adopts a simplified conventional perturbation model based on the two-line orbital data of the satellite.

[0046] S3. Divide the mission area into several partitions according to certain rules, cluster the gateway stations within each partition, and calculate the planning results for each area based on the partitions;

[0047] S4. For each area, determine the visible satellite set between the satellite and the gateway station feeder link establishment task according to the longitude, latitude and altitude of each satellite and the geographical location of the current processing area; specifically: through the satellite position and the current area polygon, use the ray discrimination method to judge whether the sub-satellite point is inside the polygon, so as to calculate the visible satellites in the current area at each moment within the planning period and determine the visible satellite set.

[0048] S5. According to the visible satellite set, planning period, longest link establishment duration, gateway station antenna occupancy status information, etc., use the shortest distance task planning algorithm for satellite gateway station feeder links based on partitions to generate a constellation gateway station feeder link allocation plan; specifically including:

[0049] Obtain the antenna status of each gateway station at the current moment, including the number of available antennas of the gateway station, whether the antenna was assigned a satellite connection task at the previous moment, the comparison between the current moment and the longest connection duration and the continuous duration, whether the satellite belongs to the set of connectable satellites in this area at this moment, etc., and determine the occupied satellite set in the visible satellite set of the current area;

[0050] Traverse the satellites that are in the visible satellite set but not in the occupied satellite set. For each satellite, calculate its distance from each gateway station in the current area;

[0051] If the gateway station with the shortest distance has an idle antenna, assign the idle antenna of the gateway station with the shortest distance to the current satellite; if the gateway station with the shortest distance has no idle antenna, switch to the antenna with the second shortest distance for satellite allocation, and so on; if all gateway stations in the current area have no available antennas at the current moment, the current satellite is not allocated at the current moment;

[0052] Update the gateway station antenna connection status and connection duration according to the current satellite allocation situation; and enter the next moment loop until the mission period ends;

[0053] Based on the satellite link status of each antenna at each moment of the recorded current mission cycle, the connection start time and duration between the gateway station and the satellite can be calculated, so as to obtain the satellite-gateway station connection scheme for the current mission cycle. After calculating the connection relationship between the satellite and the gateway station in each region, the connection relationship between the satellite and the gateway station in all mission regions can be obtained, so as to obtain the constellation gateway station feeder link allocation scheme.

[0054] S6. Simulate and verify the constellation gateway station feeder link allocation scheme, including coverage analysis and the formulation and verification of high-latitude shutdown plans.

[0055] In an embodiment provided by the present invention, the method for task planning of the shortest distance of the satellite gateway station feeder link partitioning for a giant constellation can be divided into three stages: requirement analysis and task preprocessing, algorithm solving, and simulation verification, as Figure 1 shown.

[0056] Requirement analysis starts from collecting task requirement information, including global coverage rate, gateway station longitude and latitude coordinates, gateway station antenna occupancy status information, constellation occupancy status information, longest link establishment duration, priority, and other requirements. Immediately afterwards, scene parameters are set, including but not limited to the planning period, satellite orbit parameters, etc.

[0057] Then, preprocess the task. At this time, orbit calculation and prediction are required to determine the visible time window between the satellite and the task of establishing the gateway station feeder link. Then, divide the task area and cluster the gateway stations according to certain rules.

[0058] After requirement analysis and task preprocessing are completed, it enters the algorithm solving stage. In this stage, a feasible constellation gateway station feeder link allocation scheme is generated using the task planning algorithm for the shortest distance of the satellite gateway station feeder link based on partitioning. To ensure the reliability of the planning scheme, analyze the global coverage rate of the generated scheme. The scheme needs to meet the indicators to determine whether the current scheme needs to be corrected or optimized. If necessary, re-perform task planning until a satisfactory planning scheme is generated. Finally, perform the high-latitude shutdown process and issue the task, and the satellite executes the scheme to obtain the actual link establishment result.

[0059] The following introduces the specific steps of this embodiment:

[0060] The specific process of the requirement analysis and task preprocessing part is as Figure 2 shown.

[0061] First, according to the requirements, the task is initiated starting from StartTime based on thousands of satellites AvailSat = {AvailSat1, AvailSat2,..., AvailSat b}, as well as thousands of gateway station antennas StationInfo = {StationInfo1, StationInfo2,..., StationInfo n}, with a networking plan having a period of TimeOffset.

[0062] Among them, AvailSat represents the set of all on-orbit satellites. The attributes of a single satellite are the following 2-tuple AvailSat1 = {SatelliteId, SatTLE}, where SatelliteId represents the satellite number and SatTLE represents the two-line elements of the satellite. StationInfo represents the set of all available gateway stations. The attributes of a single gateway station are the following 3-tuple Among them represents the status of all antennas of the current gateway station at the current moment, and StationPostion u represents the geographical location of the current gateway station. represents the number of idle antennas of the gateway station at the current moment. u ∈ U, k ∈ K, s ∈ S respectively represent a gateway station, an antenna, and a satellite.

[0063] Next, the longitude, latitude, and altitude of each satellite at each moment within the planning period are calculated through the orbit prediction algorithm. Since it involves thousands of satellites and thousands of gateway station antennas, in order to simplify the complexity of the entire mission planning algorithm, we divide the globe into m regions A = {a1, a2,..., a m}}, where A represents the set of all regions. Region a ∈ A, which are the China region, the Africa region, the Europe region, the Arctic region, the Antarctic region, etc. The ground is partitioned, and the networking plan is carried out region by region.

[0064] Each region contains n ground gateway stations

[0065] StationInfo = {StationInfo1, StationInfo2,..., StationInfo n}, and each gateway station has a antennas AnteState = {AnteState1, AnteState2,..., AnteState n×a} that can establish a feeding link with the satellite.

[0066] Next, the visible satellites in the current region at each moment of the entire planning period are calculated through the visibility algorithm. So far, it is the requirement analysis and task preprocessing part. Next, the algorithms for orbit prediction and visibility calculation therein are mainly described.

[0067] The orbit prediction algorithm is the SGP4 model orbit prediction algorithm based on satellite TLE. By inputting the two-line orbit data of each satellite and using the SGP4 model, satellite orbit prediction is carried out to obtain the longitude, latitude and altitude of each satellite at each moment:

[0068]

[0069] where respectively represent the longitude, latitude and altitude of the current satellite at time t.

[0070] The orbit prediction algorithm of the Simplified General Perturbations 4 (SGP4) model based on the two-line orbital element (TLE) of the satellite can accurately predict the orbit of low-earth orbit satellites. This model is developed by NORAD and is especially suitable for near-earth objects with an orbital period less than 225 minutes. SGP4 takes into account the influence of disturbing forces such as the non-spherical gravity of the earth, the gravitational forces of the sun and the moon, solar radiation pressure and atmospheric drag. By inputting the TLE data of the satellite, the SGP4 model can efficiently calculate the longitude, latitude and altitude of the satellite at each moment, greatly improving the accuracy of orbit prediction.

[0071] The visibility algorithm is the satellite gateway visibility algorithm based on the ray discrimination method. Specifically: by using the known satellite position and the current regional polygon, the ray discrimination method is used to judge whether the sub-satellite point is inside the polygon, calculate the satellite numbers that can be connected at each moment within the current planning period in the current area, and store them in the current area visible satellite set AccessSatSet a as follows:

[0072]

[0073] where represents the current area visible satellite set at time t.

[0074] The ray discrimination method is an algorithm for judging the position relationship between a point and a polygon. Briefly speaking, a horizontal ray is emitted from the point to be judged, and then the number of intersections of this ray with the polygon boundary is counted. If the number of intersections is odd, then this point is inside the polygon; if it is even, then the point is outside the polygon. This method is also effective for complex polygons with holes.

[0075] Next, the shortest distance mission planning algorithm for the satellite gateway feeder link based on partitioning is introduced. The process is as Figure 3 shown, and the specific steps are as follows:

[0076] 1) First, judge the status of each antenna of each gateway station according to the connection situation after the end of the previous moment. Diversify the visible satellites according to the antenna status to obtain the satellite set that needs to add new satellite connections at this moment: The status of antenna k of each gateway station u before the update at the current moment t is represented by and consists of the following 5-tuple:

[0077]

[0078] Among them, Work represents the working status of the gateway station, 0 means idle, 1 means working or in adjustment, SatelliteId represents the satellite number connected by the current antenna, represents the duration of the antenna task before the update at the current moment t, AssignTime uk represents the start time of the satellite connection assigned to the antenna, AdjustTime uk represents the adjustment time required to switch between two connected satellites by the current antenna.

[0079] First, obtain the number of idle antennas of the gateway station according to whether the antenna is idle If the antenna is not idle, then check the duration of this antenna's task Whether it is less than -10. If it is less, it means that the antenna was in the adjustment time at the previous moment, and add 1 to the duration If the duration of the task is equal to -10, it means that the adjustment time has ended and the antenna can start working. Let Work = 0, and at the same time add 1.

[0080] If the connected satellite number is greater than zero, it means that the antenna was assigned a satellite connection task at the previous moment. If the current moment t is less than the task start time AssignTime uk , it means that this satellite has been occupied. Add the current satellite to the set of occupied satellites of the current gateway station at the current moment . If the connected satellite at the previous moment is in the set of visible satellites in the current area at the current moment and AssignTime uk is less than the current moment, and the duration is less than the maximum connection duration MaxLinkTime, then add the current satellite to the set of occupied satellites. When the satellite is not included in the set of visible satellites at time t, it means that the satellite gateway station has disconnected the link, and modify to -10 - AdjustTime uk .

[0081] 2) Then, loop through the set of visible satellites in the current area at the current moment that are not in the occupied satellites For all satellites in

[0082] where represents the distance between the current satellite and each gateway station, represents the distance between the current satellite and the \(u\)-th gateway station.

[0083] Sort the distances between each satellite and all gateway stations in the current area at the current moment from smallest to largest. If the gateway station with the smallest distance has an idle antenna, then allocate this antenna to this satellite. Otherwise, go to the idle antenna of the gateway station with the second shortest distance in the gateway station list at the current moment for allocation, and so on. If there are no available antennas at all gateway stations in the current area, then this satellite does not perform gateway station antenna allocation at the current moment.

[0084] 4) Update the antenna-satellite connection status of the gateway station at the current moment according to the above antenna-satellite allocation. For the newly added connection at the current moment, the connection duration increases by one second. If it is greater than MaxLinkTime, the antenna enters the adjustment mode and modifies to -10 - AdjustTime uk .

[0085] 5) Finally, record the satellite connection status of each antenna at each moment of the current task cycle:

[0086] AnteState = {AnteState1, AnteState2,..., AnteState n×a}

[0087] where

[0088]

[0089] Based on the satellite connection status of each antenna at each moment of the current task cycle, the connection start time and duration between the gateway station and the satellite can be calculated, so as to obtain the satellite-gateway station connection scheme in the current area of the current task cycle. After calculating the connection relationship between the satellite and the gateway station in each area, the global satellite-gateway station connection relationship can be obtained.

[0090] Next, perform simulation verification on the constellation gateway station power supply link allocation scheme, including coverage analysis and the formulation and verification of the high-latitude shutdown plan.

[0091] The specific steps for global coverage analysis are as follows:

[0092] Calculate the coverage area of the connected satellites based on the connection status between the current satellite and the gateway station. Obtain the coverage area of a single satellite from the ground coverage radius of the satellite beam:

[0093]

[0094] Among them, CoverageArea sat is the coverage area of a single satellite, R E is the radius of the Earth, and R is the ground coverage radius of a single satellite.

[0095] If overlap is not considered, the coverage area of all connected satellites is:

[0096] CoverageArea total = CoverageArea s ·N

[0097] where N is the number of connected satellites.

[0098] Let the proportion of the overlapping area be α, then the estimated total coverage area is:

[0099] CoverageArea = CoverageArea total (1 - α)

[0100] After obtaining the connected coverage area, calculate it with the surface area of the Earth to get the global coverage ratio CoverageRatio.

[0101]

[0102] The specific steps for high-latitude shutdown are as follows:

[0103] Based on the known satellite orbits, for the available satellites at the current moment, solve the position of the current satellite at the current moment Solve the sub-satellite point spacing between adjacent orbital planes and the satellite coverage area radius to obtain the ground coverage area. As Figure 4 shown in the figure of the overlapping situation of the coverage areas of two adjacent orbital planes, it can be seen that the proportion of the overlapping area is related to the coverage area radius and the sub-satellite point spacing between adjacent orbital planes of the current satellite. As the latitude continues to increase, the overlap of the coverage areas between sub-satellite point orbits becomes more and more, and high-latitude shutdown is required to obtain the high-latitude shutdown plan of the satellite, that is, the on / off state of each satellite at each moment.

[0104] For each satellite, calculate the coverage area radius:

[0105]

[0106] Where θ represents the included angle of the satellite antenna beam width, Radius represents the radius of the coverage area, and earthRadius represents the radius of the earth.

[0107] Through the current satellite orbital plane and the current satellite position, the sub-satellite point track of the current orbit is obtained, and thus the sub-satellite point spacing d of adjacent orbits at the same latitude is obtained:

[0108] Then calculate the coverage ratio:

[0109] CoverRatio = Radius / d

[0110] When the radius of the coverage area is less than or equal to the sub-satellite point spacing of the orbital plane, there is no need to shut down. When the coverage radius is greater than or equal to the sub-satellite point spacing of the orbital plane, one satellite is shut down every other orbital plane. When CoverRatio = Radius / d = 3 / 2, one satellite is shut down every two orbital planes. When CoverRatio = Radius / d = 2, one satellite is shut down every three orbital planes. And so on, when CoverRatio = Radius / d = n, one satellite is shut down every n * 2 - 1 orbital planes until there is only one orbital plane with an operating satellite left in the end.

[0111] Those skilled in the art should understand that the embodiments of the present invention can be provided as a method, a system, or a computer program product. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present invention can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0112] The present invention is described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to embodiments of the present invention. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, as well as the combination of flows and / or blocks in the flowcharts and / or block diagrams, can be realized by computer program instructions. These computer program instructions can be provided to the processors of general-purpose computers, special-purpose computers, embedded processors, or other programmable data processing devices to generate a machine, so that the instructions executed by the processors of the computer or other programmable data processing devices generate means for realizing the functions specified in Figure 1 one process or multiple processes and / blocks Figure 1 one block or multiple blocks.

[0113] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce a manufacture including an instruction device that implements the functions specified in one or more of the procedures Figure 1 one or more procedures and / or blocks Figure 1 specified in the block or blocks.

[0114] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, so that the instructions executed on the computer or other programmable apparatus provide steps for implementing the functions specified in one or more of the procedures Figure 1 one or more procedures and / or blocks Figure 1 specified in the block or blocks.

[0115] The foregoing is only a preferred embodiment of the present invention. Although the present invention has been disclosed above in a preferred embodiment, it is not intended to limit the present invention. Any person skilled in the art can make many possible changes and modifications to the technical solution of the present invention by using the methods and technical contents disclosed above, or modify it into an equivalent embodiment with equivalent changes. Therefore, any simple modification, equivalent change and modification made to the above embodiments according to the technical essence of the present invention without departing from the technical solution of the present invention still fall within the scope of the protection of the technical solution of the present invention.

Claims

1. A method for task planning of the shortest distance in the feeder link of a satellite gateway station for a giant constellation, characterized in that It includes the following steps: Collect the information required for mission planning based on mission requirements and set the scene parameters; Calculate the longitude, latitude and altitude of each satellite at each moment within the planning period through the orbit prediction algorithm; Divide the mission area into several sub-areas and cluster the gateway stations within each sub-area; For each area, determine the visible satellite set between the satellite and the gateway station feeder link establishment mission through the orbit prediction information; Generate a constellation gateway station feeder link allocation plan according to the visible satellite set using the shortest distance mission planning algorithm for satellite gateway station feeder links based on sub-areas; Simulate and verify the constellation gateway station feeder link allocation plan.

2. The method for task planning of the shortest distance of the feeder link of the satellite gateway station for the giant constellation according to claim 1, wherein The information required for mission planning includes global coverage requirements, gateway station longitude and latitude coordinates, gateway station antenna occupancy status, constellation occupancy status, longest link establishment duration, mission priority; the scene parameters include the planning period and satellite orbit parameters.

3. The method for task planning of the shortest distance of the feeder link of the satellite gateway station for a giant constellation according to claim 1, wherein The orbit prediction algorithm uses a simplified conventional perturbation model based on the two-line orbital data of the satellite.

4. The method for task planning of the shortest distance of the feeder link partitioning for the satellite gateway station facing the giant constellation according to claim 1, wherein Determining the visible satellite set between the satellite and the gateway station feeder link establishment mission through the orbit prediction information specifically includes: calculating the visible satellites in the current area at each moment within the planning period through the satellite gateway station visibility algorithm based on the ray discrimination method to determine the visible satellite set.

5. The method for task planning of the shortest distance of the feeder link partitioning of the satellite gateway for the giant constellation according to claim 4, characterized in that, The satellite gateway station visibility algorithm based on the ray discrimination method is specifically: judging whether the sub-satellite point is inside the polygon through the satellite position and the current area polygon using the ray discrimination method.

6. The task planning method for the shortest distance of the feeder link partition of the satellite gateway station for the giant constellation according to claim 1, wherein Generate a constellation gateway station feeder link allocation plan according to the visible satellite set using the shortest distance mission planning algorithm for satellite gateway station feeder links based on sub-areas, specifically including: Obtain the antenna status of each gateway station at the current moment, and determine the occupied satellite set in the visible satellite set in the current area according to the antenna status; Traverse the satellites that are in the visible satellite set but not in the occupied satellite set. For each satellite, calculate its distance from each gateway station in the current area; If the gateway station with the shortest distance has an idle antenna, allocate the idle antenna of the gateway station with the shortest distance to the current satellite; if the gateway station with the shortest distance has no idle antenna, switch to the antenna with the second shortest distance for satellite allocation, and so on; Update the gateway station antenna connection status and connection duration according to the current satellite allocation situation; Record the connection status of the gateway station antenna satellite at each moment within the planning period to obtain the constellation gateway station feeder link allocation plan.

7. The method for mission planning of the shortest distance of the feeder link of the satellite gateway station for a giant constellation according to claim 6, characterized in that, If all gateway stations in the current area have no available antennas at the current moment, the current satellite is not allocated at the current moment.

8. The method for task planning of the shortest distance of the feeder link partitioning of the satellite gateway for the giant constellation according to claim 1, characterized in that The simulation verification includes coverage analysis and the formulation and verification of the high-latitude shutdown plan.

9. A satellite gateway feeder link partitioned shortest distance mission planning system for a giant constellation, characterized in that It includes: Requirement analysis and mission preprocessing module: used to collect the information required for mission planning based on mission requirements and set the scene parameters; Divide the mission area into several sub-areas and cluster the gateway stations within each sub-area; calculate the longitude, latitude and altitude of each satellite at each moment within the planning period through the orbit prediction algorithm; For each area, determine the visible satellite set between the satellite and the gateway station feeder link establishment mission through the orbit prediction information; Algorithm Solving Module: It is used to generate a constellation gateway feeder link allocation scheme according to the visible satellite set by using the satellite gateway feeder link shortest distance mission planning algorithm based on partitioning; Simulation Verification Module: It is used to perform simulation verification on the constellation gateway feeder link allocation scheme.

10. A computer device, characterized in that, The computer device includes: One or more processors; A memory for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the satellite gateway feeder link partitioning shortest distance mission planning method for giant constellations as described in any one of claims 1-8.

Images