Multi-shell low-orbit constellation end-to-end communication shortest path planning method and device based on state optimization

By building the topology and state optimization method of virtual constellation network, selecting the best starting node, and iteratively searching for the shortest path, the topological complexity and resource utilization imbalance of low-orbit satellite constellation network are solved, and efficient and stable communication path planning is achieved.

CN120433825APending Publication Date: 2025-08-05Chinese People's Liberation Army Cyberspace Force Information Engineering University
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202510602048.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-05-09
Publication Date
2025-08-05

AI Technical Summary

Technical Problem

The complexity and dynamicity of the topological structure of low-orbit satellite constellation networks lead to difficulties in path planning, traditional algorithms are difficult to meet the needs of multi-objective optimization, and uneven network resource utilization affects communication quality and efficiency.

Method used

The end-to-end communication method of multi-shell low-orbit constellation based on state optimization is adopted. By integrating satellite and ground station information, virtual constellation network topology is constructed, and graph theory abstraction is used as a weighted graph, combining elevation angle, satellite orbit state and distance constraints, selecting the best starting node, and iteratively searching for the optimal path.

Benefits of technology

Optimize path planning efficiency, reduce computing complexity, respond to topological changes in real time, ensure communication performance and stability, and solve the complex path planning problem of low-orbit satellite constellation networks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120433825A_ABST
    Figure CN120433825A_ABST
Patent Text Reader

Abstract

The invention provides a multi-shell low-orbit constellation end-to-end communication shortest path planning method and device based on state optimization. The method comprises the following steps: integrating information of satellites and ground stations in a multi-shell low-orbit constellation, and updating a virtual constellation network topology in real time; according to a graph theory principle, taking a satellite and a ground station as nodes, and abstracting a virtual constellation network topology into a weighted graph; selecting an optimal starting satellite node in the weighted graph according to the position information of the starting user, the comprehensive elevation angle, the satellite orbit state and the distance constraint with the target user; and taking the optimal satellite node as a starting point of the first round of search process, and iteratively searching the optimal next-hop node according to the state of the current node in the weighted graph in each round of search process until the optimal satellite node associated with the target user is searched, so as to determine the final shortest path. According to the method, a virtual node method is adopted to cope with topology complexity, path planning efficiency is optimized in two stages, and efficient and stable operation of low-orbit satellite constellation communication is effectively promoted.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical fields of satellite communications and path planning, and in particular to a method and device for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization. Background Art

[0002] With the rapid growth of global communications demand, low-orbit satellite constellations, as a crucial component of the integrated space-ground information network, have become a research hotspot and development trend in the field of satellite communications, thanks to their significant advantages such as low latency, strong signal coverage, and low construction costs. In recent years, numerous companies and institutions around the world have actively deployed low-orbit satellite constellations. These deployments have significantly improved the coverage and performance of global communications networks, providing efficient and reliable communications services in remote areas, oceans, aviation, and other scenarios.

[0003] However, with the rapid increase in the number of low-orbit satellites, large-scale low-orbit satellite constellation networks composed of a large number of satellites face numerous technical challenges. First, the network topology of low-orbit satellite constellations is becoming increasingly complex. Due to the large number of satellites distributed across different orbital layers, coupled with the distributed nature of ground station construction, the number of nodes and links in the network has increased dramatically, significantly increasing the dynamics and complexity of the network topology. In this complex network environment, path planning becomes even more complex, and traditional routing algorithms struggle to meet multi-objective optimization requirements. Second, the high-speed motion of low-orbit satellites and the instability of their links cause some nodes or links in the network to be significantly more loaded than others, easily leading to uneven utilization of network resources. Localized congestion can lead to user data loss and degraded communication quality, thus impacting overall network performance. Furthermore, low-orbit satellite constellation networks must cope with complex scenarios such as multi-task concurrency and priority scheduling. Achieving load balancing and task priority scheduling while meeting communication latency requirements has become a key and challenging area of current research. Summary of the Invention

[0004] In complex network environments such as large low-orbit satellite constellations, to ensure communication quality while meeting communication latency requirements, the present invention proposes a method and device for planning the shortest path for end-to-end communications within a multi-shell low-orbit constellation based on state optimization. By introducing a state optimization mechanism, key factors such as network status, dynamic changes in satellite position, and real-time link status can be evaluated and analyzed in real time, effectively addressing complex network environments. Compared to the traditional Dijkstra algorithm, the present method optimizes the algorithm structure and adopts an efficient state update strategy, reducing computational overhead. It can quickly complete path planning, ensuring continuous and stable communications, and providing support for the efficient and stable operation of low-orbit satellite constellation communications.

[0005] In a first aspect, the present invention provides a method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization, comprising:

[0006] Integrate information from satellites and ground stations in a multi-shell low-orbit constellation to build and update a virtual constellation network topology in real time;

[0007] According to the principles of graph theory, both satellites and ground stations are regarded as nodes, so as to abstract the virtual constellation network topology into a weighted graph; wherein the edge weight is the satellite-ground distance or the inter-satellite distance;

[0008] According to the starting user's location information, the elevation angle, satellite orbit status and distance constraints to the destination user are considered, and the best starting satellite node is selected in the weighted graph;

[0009] The optimal starting satellite node is used as the starting point of the first round of search process. In each round of search process, the optimal next hop node is iteratively searched according to the state of the current node in the weighted graph until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path.

[0010] Furthermore, the multi-shell LEO constellation and ground station information is integrated to build and update the virtual constellation network topology in real time, including:

[0011] Collect the orbital parameters and position information of each satellite and the position information of the ground station;

[0012] For any two satellites in the same orbit, if the distance between them is less than a preset distance threshold, then an inter-satellite link is considered to exist between them; for any two satellites in different orbits, if the distance between them is less than a preset distance threshold and the difference in their latitude depression angles is less than a preset depression angle difference threshold, then an inter-satellite link is considered to exist between them;

[0013] For any satellite and any ground station, if the elevation angle of the satellite relative to the ground station is greater than the preset elevation angle threshold, it is considered that there is a satellite-to-ground link between the two;

[0014] During the communication mission, the position information of each satellite is regularly predicted based on the satellite's orbital dynamics model to update the inter-satellite link and / or satellite-to-ground link in real time.

[0015] Furthermore, based on the location information of the starting user, the elevation angle, the satellite orbit status, and the distance constraint to the destination user are considered, and the optimal starting satellite node is selected in the weighted graph, specifically including:

[0016] Calculating the elevation angle of each satellite node relative to the starting user, and screening out all satellite nodes whose elevation angles are greater than a preset elevation angle threshold to form a preliminary candidate satellite set;

[0017] determining a satellite orbit state selection flag according to the latitude of the starting user, and selecting satellites that meet the satellite orbit state selection flag from the preliminary candidate satellite set to form a final candidate satellite set;

[0018] For each satellite node in the final candidate satellite set, the distance between the satellite node and the destination user is calculated, so as to select the satellite node with the smallest distance to the destination user as the best starting satellite node.

[0019] Furthermore, in each round of search, the optimal next-hop node is iteratively searched based on the state of the current node in the weighted graph until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path. Specifically, the following steps are performed:

[0020] Step A1: For all satellite nodes in the weighted graph, select the satellite nodes that meet the valid link conditions with the destination user to form the destination satellite candidate set;

[0021] Step A2: For each satellite node in the destination satellite candidate set, the distance from the current node to each satellite node is calculated according to the edge weight, so as to select the satellite node with the smallest distance to the current node as the temporary destination satellite node;

[0022] Step A3: For all neighbor nodes of the current node, the distance from the neighbor node to the temporary destination satellite node through the satellite network is calculated based on the edge weight, so as to select the neighbor node with the shortest distance to the temporary destination satellite node as the optimal next hop node, and add the optimal next hop node to the preset path list;

[0023] Step A4: Set the optimal next-hop node as the new current node and return to step A2 until the current node is the same as the temporary destination node. The search process ends and the path formed by the nodes in the path list is the shortest path from the starting user to the destination user.

[0024] Furthermore, the orbital parameters include orbital altitude, inclination and eccentricity.

[0025] Furthermore, after collecting the orbital parameters and position information of each satellite, it also includes: allocating a two-dimensional logical address (l, k) to each satellite according to the orbital parameters and position information of each satellite, and judging whether the satellites are co-orbit satellites or different-orbit satellites according to the two-dimensional logical addresses of the satellites.

[0026] Furthermore, the satellite orbit state includes ascending orbit and descending orbit.

[0027] In a second aspect, the present invention provides a device for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization, comprising:

[0028] The network topology construction module is used to integrate the information of satellites and ground stations in the multi-shell low-orbit constellation to build and update the virtual constellation network topology in real time;

[0029] A weighted graph generation module, based on graph theory principles, treats both satellites and ground stations as nodes to abstract the virtual constellation network topology into a weighted graph, wherein the edge weight is the satellite-ground distance or the inter-satellite distance;

[0030] The starting node determination module is used to select the best starting satellite node in the weighted graph based on the starting user's location information, the elevation angle, the satellite orbit status and the distance constraint to the destination user;

[0031] The path search module is used to use the optimal starting satellite node as the starting point of the first round of search process. In each round of search process, according to the state of the current node in the weighted graph, iteratively search for the optimal next hop node until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path.

[0032] In a third aspect, the present invention provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method described in the first aspect when executing the program.

[0033] In a fourth aspect, the present invention provides a non-transitory computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method described in the first aspect.

[0034] The beneficial effects of the present invention are:

[0035] (1) Coping with topological complexity: The present invention adopts the virtual node method to control the topological complexity and dynamics of the multi-shell low-orbit constellation, builds a virtual network to adapt to complex environments, overcomes the defects of traditional algorithms, and assists in path planning.

[0036] (2) Optimizing path planning efficiency: The path planning process is subdivided into two stages: optimal starting satellite selection and topological optimal path generation. The optimal satellite starting node is screened based on multiple factors, and the path is generated based on weighted graph iterative search. This optimizes the path planning efficiency, reduces the computational complexity, and improves the path generation speed.

[0037] (3) Ensure communication performance: Update links and topology in real time during the mission, respond to changes in satellite positions, prevent congestion, and make rational use of resources to meet the requirements of real-time and stable communication in complex scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 A schematic flow chart of a method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization provided by an embodiment of the present invention;

[0039] Figure 2 A schematic diagram of a shortest path planning scenario for end-to-end communication of a multi-shell low-orbit constellation provided by an embodiment of the present invention;

[0040] Figure 3 A comparison diagram of the time delay between the method of the present invention and the Dijkstra algorithm provided in an embodiment of the present invention;

[0041] Figure 4 A comparison chart of the number of hops between the method of the present invention and the Dijkstra algorithm provided in an embodiment of the present invention;

[0042] Figure 5 A schematic diagram of the structure of a multi-shell low-orbit constellation end-to-end communication shortest path planning device based on state optimization provided by an embodiment of the present invention;

[0043] Figure 6 This is a structural block diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0044] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly described below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present invention.

[0045] Among existing path planning methods, the Dijkstra algorithm, a classic single-source shortest path algorithm, is widely used in graph theory. However, directly applying the Dijkstra algorithm to path planning for multi-shell virtual constellations presents challenges such as high computational complexity and insufficient adaptability to dynamic environments.

[0046] In response to the above problems, Figure 1 As shown, an embodiment of the present invention provides a method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization, comprising the following steps:

[0047] S101: Integrate information from satellites and ground stations in a multi-shell LEO constellation to build and update the virtual constellation network topology in real time;

[0048] S102: Based on graph theory principles, the satellites and ground stations are both considered as nodes, so as to abstract the virtual constellation network topology into a weighted graph, wherein the edge weight is the satellite-to-ground distance or the inter-satellite distance;

[0049] S103: Selecting the best starting satellite node in the weighted graph based on the starting user's location information, elevation angle, satellite orbit status, and distance constraint to the destination user;

[0050] S104: The optimal starting satellite node is used as the starting point of the first round of search process. In each round of search process, the optimal next hop node is iteratively searched according to the state of the current node in the weighted graph until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path.

[0051] The embodiments of the present invention focus on the shortest path planning for end-to-end communications in multi-shell low-orbit satellite constellations. In view of the problems brought about by the development of low-orbit satellite constellations, such as complex network topology and uneven resource utilization, as well as the shortcomings of traditional algorithms, the embodiments of the present invention first adopt the virtual node method to control the topological complexity and dynamics, and then subdivide the path planning process into two stages: optimal starting satellite selection and topological optimal path generation. This optimizes path planning efficiency, updates in real time to ensure communication performance, effectively promotes the efficient and stable operation of low-orbit satellite constellation communications, and provides key technical support for solving the path planning problems of multi-shell low-orbit constellations.

[0052] In one embodiment, with respect to step S101 above, a threshold determination method is used to determine the visibility of satellite-to-ground and inter-satellite links, and inter-satellite and satellite-to-ground links are established between satellites and between satellites and ground stations that meet the visibility conditions. The details are as follows:

[0053] Collect the orbital parameters (including orbital altitude, inclination, eccentricity, etc.) and location information of each satellite in the multi-shell low-orbit constellation, as well as the geographical location information (longitude, latitude, and altitude) of the ground station. For the convenience of description, let the satellite set be S = {s1, s2, ..., s n}, the ground station set is G={g1,g2,…,g m For satellite s i , whose position in three-dimensional space is represented as For ground station g j , whose position is represented by

[0054] It is understandable that the visibility conditions that need to be met by satellites in the same orbit and satellites in different orbits are different. Therefore, for any two satellites, it is necessary to first determine whether they are satellites in the same orbit or satellites in different orbits based on the collected orbital parameters of the satellites. After the determination, the embodiment of the present invention encodes each satellite by assigning a two-dimensional logical address (l, k) to the virtual satellite node to facilitate the subsequent judgment of link visibility; where l represents the shell number, l∈{1,2,…,L}, k is the satellite number of each shell, k∈{1,2,…,K l Each virtual node has stable ground coverage, and the logical address is not affected by the rotation of the earth.

[0055] For satellites in the same orbit i and s j (Assume they are in the same shell l), let the distance between them be d ij , the average distance between adjacent satellites in the same orbit is d avg If d ij ≤1.5d avg , then it is considered that there is an intersatellite link between them; for satellites in different orbits s p and s q , let their latitude depression angles be θ p and θ q , the latitude depression angle difference between adjacent satellites on the same track is △θ avg If d pq ≤1.5d avg and It is considered that there is an intersatellite link between them.

[0056] For satellites i and ground station g j , let the elevation angle of the satellite relative to the ground station be α ij If α ij If the angle is ≥40°, it is considered that there is a satellite-to-ground link between them.

[0057] Due to the high-speed movement of satellites, after the mission is launched, during the communication mission, the satellite's position is predicted regularly (assuming the time interval is △t) according to the satellite's orbital dynamics model (such as the SGP4 model calculated based on the satellite's TLE), and the link is re-evaluated and the topology is updated to ensure communication. For example, suppose satellite s i The position at time t is After △t, its position is updated to It can be calculated based on the TLE of the satellite using the SGP4 model.

[0058] In one embodiment, with respect to step S102 above, edges are added between nodes based on satellite-to-ground or inter-satellite visibility, with edge weights corresponding to satellite-to-ground or inter-satellite distances, thereby abstracting the virtual constellation network topology into a weighted graph. Specifically,

[0059] Based on the virtual constellation network constructed in step S101 above, the node set V is determined. Wherein the satellite node set S={s (l,k)}, l represents the shell number, l∈{1,2,…,L}, K is the satellite number in each shell, k∈{1,2,…,K l}, ground station node set G = {g j}, j∈{1,2,…,m}, then V=S∪G.

[0060] For each satellite node s(l,k) , which has the corresponding two-dimensional logical address and related attribute information, ground station node g j It also has its own specific geographical location and other attributes. Initialize the edge set Edges will be added later based on the satellite-to-ground-to-satellite visibility rules.

[0061] For each ground station node g j and satellite nodes (l,k) , calculate the elevation angle α between them (l,k)j For example, in three-dimensional space, let the ground station g j The coordinates are Satellites (l,k) The coordinates are The elevation angle calculation formula is:

[0062]

[0063] If α (l,k)j ≥40°, then add edge e to edge set E (l,k)j Connecting Satellite Nodes (l,k) and ground station node g j .

[0064] For satellite nodes in the same orbit and Let the distance between them be The average distance between adjacent satellites in the same orbit is d avg .like Then add an edge To edge set E. Distance It can be calculated according to the three-dimensional space distance formula:

[0065]

[0066] For satellite nodes in different orbits and Let the distance between them be The average distance between adjacent satellites in the same orbit is d avg , and their latitude depression angles are and The difference in latitude depression angle between adjacent satellites on the same track is △θ avg .like and Then add an edge To edge set E.

[0067] For the satellite-to-ground link edge (l,k)j , whose weight w (l,k)j Set as Satellite (l,k) With ground station g j The distance d (l,k)j , that is, w(l,k)j =d (l,k)j The distance calculation method is the same as the three-dimensional space distance formula in the above inter-satellite link distance calculation.

[0068] For the intersatellite link (same track or different track), its weight Set as Satellite and The distance between Right now

[0069] In one embodiment, with respect to the above-mentioned step S103, the process of selecting the best starting satellite node in the weighted graph according to the embodiment of the present invention is specifically as follows:

[0070] Extract the information of all satellite nodes and ground station nodes from the weighted graph G = (V, E), including the satellite's position coordinates, orbital parameters and the geographical location information of the ground station. (l,k)}, l represents the shell number, l∈{1,2,…,L}; k represents the satellite number in each shell, k∈{1,2,…,K l}; Ground station node set G = {g j},j∈{1,2,…,m}.

[0071] For each satellite node s (l,k) and the starting user position u src , calculate the elevation angle θ of the satellite relative to the starting user (l,k),src Assuming that satellite s (l,k) The position coordinates are The starting user position coordinates are The elevation angle calculation formula is:

[0072]

[0073] Set the elevation angle threshold θ th (e.g. 40°), filter out the elevation angle θ (l,k),src ≥θ th The satellite nodes are combined into a preliminary candidate satellite set C1.

[0074] According to the latitude lat in the starting user location information src Determine the satellite orbit status and select the flag flog. src ≥0, then flog=1 means selecting the ascending satellite; if lat src <0, then flog = 0 indicates that the down-orbit satellite is selected. The satellites whose orbital states meet the flog are further screened from the preliminary candidate satellite set C1 to form the final candidate satellite set C2.

[0075] For each satellite node s in the final candidate satellite set C2 (l,k) , calculate the distance d between it and the destination user (l,k),dst Assuming that satellite s (l,k) The position coordinates are Destination user location coordinates u src for The distance calculation formula is:

[0076]

[0077] Compare the distances of all candidate satellites and select the satellite node with the smallest distance as the best starting satellite node s best ,Right now

[0078] Through the above specific implementation methods, the best starting satellite node can be accurately selected in the weighted graph according to the elevation angle, satellite orbit status and distance constraints to the destination user, laying the foundation for subsequent path search.

[0079] In one embodiment, with respect to the above step S104, the shortest path search process is specifically as follows:

[0080] S201: Initialize path list

[0081] Specifically, the path list will be used to record the nodes passed from the starting satellite node to the destination satellite node in the subsequent search process.

[0082] S202: Set the current node V cur =s best , i.e. the best starting satellite node determined in step S103, is used as the starting point of the search.

[0083] S203: For all satellite nodes s in the weighted graph G = (V, E) (l,k) , select the satellite nodes that meet the conditions of having a valid link with the destination user (such as meeting a certain elevation angle, etc., refer to the elevation angle calculation and judgment method in step S103) from these satellite nodes to form the destination satellite candidate set C dst .

[0084] S204: For the target satellite candidate set C dst All satellite nodes (l,k) , calculate from the current node V cur The distance d(V cur ,s (l,k) ), in C dst Select the distance V from the current node cur The nearest satellite node is used as the temporary destination satellite node V tmp,Right now

[0085]

[0086] Specifically, the distance calculation is based on the weight accumulation of the edges in the graph. For example, if there is a cur to s (l,k) The path p=[e1,e2,…,e n ], where e i is an edge with edge weight w(e i ), the distance calculation formula is:

[0087]

[0088] S205: For the current satellite node V cur All neighbor nodes n (l,k) , calculate from neighbor node n (l,k) Through the satellite network to the temporary destination satellite node V tmp The distance d(n (l,k) ,V tmp ). The distance is also calculated based on the accumulation of edge weights, assuming that from the neighbor node n (l,k) to V tmp The path is p′=[e1′,e2′,…,e n '],but

[0089]

[0090] Select the neighbor node with the smallest distance as the next hop node V next ,Right now

[0091]

[0092] Set the next hop node V next Add to the path list p;

[0093] S206: Update current node V cur =V next ;

[0094] Repeat the above steps S204 to S206 until the current node V cur With the temporary destination node V tmp Similarly, at this time, it is considered that the destination satellite node has been searched, the search process is completed, and the final path p is the shortest path from the starting user to the destination user.

[0095] In order to verify the effectiveness of the solution of the present invention, the following is a further explanation combined with experiments:

[0096] In this experiment, the fourth shell of the Statlink constellation (including 1287 satellites) and 114 ground stations were selected as research objects. The Python language was used to implement network parameter design and related algorithms, and a multi-shell low-orbit constellation end-to-end communication shortest path planning scenario was built. The schematic diagram is shown below. Figure 2 In this scenario, there are three forwarding modes for the shortest path from the originating user to the destination user: direct inter-satellite forwarding, forwarding solely through ground stations, and inter-satellite-ground fusion forwarding.

[0097] In order to deeply evaluate the performance of the routing algorithm, Beijing (latitude: 39.915599, longitude: 116.416629) is used as the starting user, Australia (latitude: -37.685832, longitude: 144.992231) is used as the destination user, and the experimental time is set from "2024-11-20 04:00:00" to "2024-11-20 04:30:00". The method of the present invention is simulated and compared with the classic Dijkstra algorithm in terms of key indicators such as average end-to-end delay and average number of hops. The experiment is strictly in accordance with Figure 1 Steps S101 to S104 in the above step are gradually advanced, and the final delay comparison result is as follows: Figure 3 As shown in the figure, the hop count comparison results are as follows: Figure 4 It can be clearly seen from the results that the method of the present invention performs better in all indicators and shows good application potential and advantages.

[0098] Based on the same inventive concept, Figure 5 As shown, an embodiment of the present invention provides a multi-shell low-orbit constellation end-to-end communication shortest path planning device based on state optimization, including a network topology construction module, a weighted graph generation module, a starting node determination module and a path search module.

[0099] The network topology construction module integrates information about satellites and ground stations in a multi-shell low-orbit Earth orbit constellation to construct and update a virtual constellation network topology in real time. The weighted graph generation module, based on graph theory principles, treats both satellites and ground stations as nodes to abstract the virtual constellation network topology into a weighted graph, where edge weights represent satellite-to-ground or inter-satellite distances. The starting node determination module selects the optimal starting satellite node in the weighted graph based on the starting user's location information, elevation angle, satellite orbit status, and distance constraints from the destination user. The path search module uses this optimal starting satellite node as the starting point for the first round of search. In each round of search, the module iteratively searches for the optimal next-hop node based on the current node status in the weighted graph until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path.

[0100] It should be noted that the state-optimization-based multi-shell low-orbit constellation end-to-end communication shortest path planning device provided in the embodiments of the present invention is intended to implement the above-mentioned method. Its specific functions can be referred to the above-mentioned method embodiments and will not be repeated here.

[0101] Figure 6 An example of a physical structure diagram of an electronic device is shown below. Figure 6 As shown, the electronic device may include: a processor (processor) 601, a communication interface (Communications Interface) 602, a memory (memory) 603 and a communication bus 604, wherein the processor 601, the communication interface 602, and the memory 603 communicate with each other through the communication bus 604. The processor 601 can call the logic instructions in the memory 603 to execute a state-optimization-based multi-shell low-orbit constellation end-to-end communication shortest path planning method, which includes: integrating information of each satellite and ground station in the multi-shell low-orbit constellation to construct and update the virtual constellation network topology in real time; based on the principles of graph theory, both the satellites and the ground stations are used as nodes to abstract the virtual constellation network topology into a weighted graph; wherein the edge weight is the satellite-to-ground distance or the inter-satellite distance; based on the location information of the starting user, the elevation angle, the satellite orbit state and the distance constraint to the destination user are comprehensively considered, and the optimal starting satellite node is selected in the weighted graph; the optimal starting satellite node is used as the starting point of the first round of search process, and in each round of search process, the optimal next-hop node is iteratively searched according to the state of the current node in the weighted graph until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path.

[0102] In addition, when the logic instructions in the above-mentioned memory 603 are implemented in the form of a software functional unit and sold or used as an independent product, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0103] An embodiment of the present invention also provides a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute the multi-shell low-orbit constellation end-to-end communication shortest path planning method based on state optimization provided by the above-mentioned method embodiments.

[0104] An embodiment of the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization provided in the above-mentioned method embodiments is implemented.

[0105] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, or of course, by hardware. Based on this understanding, the essence of the above technical solution or the part that contributes to the existing technology can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or certain parts of the embodiments.

[0106] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A method for planning the shortest path for end-to-end communication of multi-shell low-orbit constellations based on state optimization, characterized by: include: Integrate information from satellites and ground stations in a multi-shell low-orbit constellation to build and update a virtual constellation network topology in real time; According to the principles of graph theory, both satellites and ground stations are regarded as nodes, so as to abstract the virtual constellation network topology into a weighted graph; wherein the edge weight is the satellite-ground distance or the inter-satellite distance; According to the starting user's location information, the best starting satellite node is selected in the weighted graph based on the elevation angle, satellite orbit status and distance constraints to the destination user; The optimal starting satellite node is used as the starting point of the first round of search process. In each round of search process, the optimal next hop node is iteratively searched according to the state of the current node in the weighted graph until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path.

2. The method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization according to claim 1 is characterized in that: Integrate multi-shell LEO constellations and ground station information to build and update virtual constellation network topology in real time, including: Collect the orbital parameters and position information of each satellite and the position information of the ground station; For any two satellites in the same orbit, if the distance between them is less than a preset distance threshold, then an inter-satellite link is considered to exist between them; for any two satellites in different orbits, if the distance between them is less than a preset distance threshold and the difference in their latitude depression angles is less than a preset depression angle difference threshold, then an inter-satellite link is considered to exist between them; For any satellite and any ground station, if the elevation angle of the satellite relative to the ground station is greater than the preset elevation angle threshold, it is considered that there is a satellite-to-ground link between the two; During the communication mission, the position information of each satellite is regularly predicted based on the satellite's orbital dynamics model to update the inter-satellite link and / or satellite-to-ground link in real time.

3. The method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization according to claim 1, characterized in that: Based on the starting user's location information, combined with the elevation angle, satellite orbit status, and distance constraints from the destination user, the optimal starting satellite node is selected in the weighted graph. Specifically, the following steps are performed: Calculating the elevation angle of each satellite node relative to the starting user, screening out all satellite nodes whose elevation angles are greater than a preset elevation angle threshold to form a preliminary candidate satellite set; determining a satellite orbit state selection flag according to the latitude of the starting user, and selecting satellites that meet the satellite orbit state selection flag from the preliminary candidate satellite set to form a final candidate satellite set; For each satellite node in the final candidate satellite set, the distance between the satellite node and the destination user is calculated, so as to select the satellite node with the smallest distance to the destination user as the best starting satellite node.

4. The method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization according to claim 1, characterized in that: In each round of search, the optimal next-hop node is iteratively searched based on the state of the current node in the weighted graph until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path. Specifically, the search includes: Step A1: For all satellite nodes in the weighted graph, select the satellite nodes that meet the valid link conditions with the destination user to form the destination satellite candidate set; Step A2: For each satellite node in the destination satellite candidate set, the distance from the current node to each satellite node is calculated according to the edge weight, so as to select the satellite node with the smallest distance to the current node as the temporary destination satellite node; Step A3: For all neighbor nodes of the current node, the distance from the neighbor node to the temporary destination satellite node through the satellite network is calculated based on the edge weight, so as to select the neighbor node with the shortest distance to the temporary destination satellite node as the optimal next hop node, and add the optimal next hop node to the preset path list; Step A4: Set the optimal next-hop node as the new current node and return to step A2 until the current node is the same as the temporary destination node. The search process ends and the path formed by the nodes in the path list is the shortest path from the starting user to the destination user.

5. The method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization according to claim 2, characterized in that: The orbit parameters include orbit altitude, inclination and eccentricity.

6. The method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization according to claim 2, characterized in that: After collecting the orbital parameters and position information of each satellite, the method further includes: allocating a two-dimensional logical address (l, k) to each satellite according to the orbital parameters and position information of each satellite, and judging whether the satellites are co-orbit satellites or different-orbit satellites according to the two-dimensional logical addresses of the satellites.

7. The method for planning the shortest path for end-to-end communication of a multi-shell low-orbit constellation based on state optimization according to any one of claims 1 to 6, characterized in that: The satellite orbit state includes orbit ascending and orbit descending.

8. A multi-shell low-orbit constellation end-to-end communication shortest path planning device based on state optimization, characterized in that: include: The network topology construction module is used to integrate the information of satellites and ground stations in the multi-shell low-orbit constellation to build and update the virtual constellation network topology in real time; A weighted graph generation module, based on graph theory principles, treats both satellites and ground stations as nodes to abstract the virtual constellation network topology into a weighted graph, wherein the edge weight is the satellite-ground distance or the inter-satellite distance; The starting node determination module is used to select the best starting satellite node in the weighted graph based on the starting user's location information, the elevation angle, the satellite orbit status and the distance constraint to the destination user; The path search module is used to use the optimal starting satellite node as the starting point of the first round of search process. In each round of search process, according to the state of the current node in the weighted graph, iteratively search for the optimal next hop node until the optimal satellite node associated with the destination user is found, thereby determining the final shortest path.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the method according to any one of claims 1 to 7 is implemented.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Citation Information

Cited By

  • Task scheduling method for space-based computing network

    CN121441381A