Constellation networking planning method based on ant colony algorithm

Optimizing the resource allocation of satellite-ground networking through ant colony algorithm, solving the problem of resource constraint conflict in the networking of low-orbit communication satellite constellations, achieving an efficient and stable networking solution, and providing an optimized networking for large-scale low-orbit constellations Solution.

CN119070884APending Publication Date: 2024-12-03THE 54TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY GROUP CORPORATION
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411144151.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-20
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

The low-orbit communication satellite constellation networking algorithm is difficult to effectively solve the problems of resource constraint conflicts and low data transmission efficiency in large-scale constellation networking, resulting in unstable satellite-ground networking solutions and low resource utilization.

Method used

The constellation network planning method based on the ant colony algorithm is adopted, and the matrix and conflict matrix are constructed through pheromone transfer probability and ant search optimization, and the satellite-ground network resource allocation is optimized, and the optimal networking scheme is selected.

Benefits of technology

A long-term link, high resource utilization and robust satellite-ground networking solution has been implemented, which solves the problem of NP difficulties in large-scale low-orbit constellation networking, and provides a stable and optimized networking solution.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119070884A_ABST
    Figure CN119070884A_ABST
Patent Text Reader

Abstract

The invention relates to the field of aerospace satellite management and control, and discloses a constellation networking planning method based on an ant colony algorithm, and the method comprises the steps: combining the networking conditions of a satellite and a ground station, carrying out the constraint inspection of link building resources, solving a task conflict, achieving the optimal distribution of link building resources through employing the ant colony algorithm in an intelligent optimization algorithm, and achieving the optimization of the link building resources. And required resources are determined for constructing a continuous and stable satellite-ground network. For the NP difficult problem of large-scale constellation networking, the optimization of large-scale low-orbit constellation networking link establishment resources is completed by using the heuristic ant colony algorithm, and a stable and robust optimal scheme can be provided for large-scale low-orbit constellation networking within reasonable time.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of aerospace satellite management and control, and more specifically to a constellation networking planning method based on ant colony algorithm. Background Art

[0002] Communication satellites build bridges for communication between different objects by forwarding radio signals. They have many advantages such as wide bandwidth, large transmission capacity, strong flexibility, and good scalability. Compared with high-orbit communication satellites, low-orbit communication satellites are closer to the ground, have low latency, and are cheaper. However, due to the limited coverage of the ground by a single satellite, global coverage can only be achieved through large-scale satellite constellations. The increase in the number of satellites has also led to a rapid increase in the amount of data. To transmit data from many satellites back to the ground, it is necessary to connect many satellites through inter-satellite links and other means to form an inter-satellite network, and then connect the ground station to its visible satellites to form a satellite-to-ground network. Satellite data is transmitted back to the ground through inter-satellite links and satellite-to-ground links. Therefore, for large-scale low-orbit constellations, satellite-to-ground networking algorithms are very critical. Summary of the invention

[0003] The present invention aims to provide a constellation networking planning method based on ant colony algorithm. Aiming at satellite networking constraints, combined with satellite and ground station networking conditions, according to resource equipment conflict judgment rules, the latest networking tasks are arranged, and the optimal networking solution is planned, which can effectively solve the networking planning problem, thereby providing the constellation with a satellite-to-ground networking solution with a long link establishment time, high resource utilization, and robust links.

[0004] In order to achieve the above object, the technical solution adopted by the present invention is:

[0005] A constellation networking planning method based on ant colony algorithm comprises the following steps:

[0006] Step 1: Receive the arranged networking plan, satellite-ground networking element tasks to be planned, and constraint verification rules sent by the mission planning software;

[0007] Step 2: Eliminate satellite-ground networking element tasks that conflict with the arranged networking solutions according to the constraint verification rules;

[0008] Step 3: Use the ant colony algorithm to plan the constellation network for the satellite-ground networking element task after conflicts are eliminated. The ant colony algorithm is as follows: first, initialize the reachability matrix, conflict matrix and parameters, select the starting point of the ants, calculate the transfer probability based on pheromones, select the next node based on the transfer probability until all reachable nodes are selected, calculate the evaluation value of the solution, update the pheromone table, and then start a new ant search until the algorithm termination condition is reached.

[0009] Furthermore, the specific process of step 3 is as follows:

[0010] Step 301, construct a matrix reachedMatrix, all elements of which have an initial value of 0, and construct a matrix conflictMatrix, assigning initial values ​​to each element according to the conflict situation of the satellite-ground networking element task; wherein reachedMatrix represents the nodes reached by the ants, that is, the satellite-ground networking tasks that have been selected, and conflictMatrix represents the nodes that the ants cannot reach, that is, the conflict taboo table;

[0011] Step 302, initializing parameters, including: initializing the ant population m, pheromone volatility ρ and the maximum number of iterations maxiterations, and setting the residual pheromone on the path (i, j) at time t to 0 and the current number of iterations = 0;

[0012] Step 303: randomly set the starting point of any ant a at and On node i, and update the reachedMatrix matrix and conflictMatrix matrix;

[0013] in, Indicates whether ant a has reached node i, that is, whether ant a has selected satellite-ground networking task i. The specific values ​​are as follows:

[0014]

[0015] Indicates whether ant a can go to node i. The specific values ​​are as follows:

[0016]

[0017] Step 304: During the movement, the ant determines the direction of movement based on the pheromones remaining on each path, and continuously selects the next node based on the transfer probability. and On node j, until there is no node to be selected; and update the reachedMatrix matrix and the conflictMatrix matrix, and update the number of iterations: iterations = iterations + 1;

[0018] Among them, the transition probability The calculation formula is as follows:

[0019]

[0020] Where alloweda is and Nodes, represents the pheromone remaining on the path (i, j) of ant a at time t;

[0021] Step 305, after each iteration, the evaluation values ​​of all ants are calculated, and the pheromones remaining on each path are updated;

[0022] Among them, the pheromone on the path (i, j) is updated according to the following formula:

[0023]

[0024] in,

[0025] Valuea is the evaluation value of ant a;

[0026] Step 306, determine whether iterations=maxiterations. If so, the maximum number of iterations has been reached and the iteration is stopped; otherwise, return to step 303;

[0027] Step 307: Select the solution with the highest evaluation value as the final optimal solution.

[0028] Furthermore, the calculation of the evaluation value in step 305 is specifically as follows:

[0029] a) Calculation of total networking duration: Take the earliest start time earlytime and the latest end time latetime of all successfully scheduled networking tasks, and calculate the networking duration as GontinueNetTime = latetime - earlytime;

[0030] b) Calculation of the total link establishment time of n satellites: For each satellite, calculate the earliest time and the latest time of networking, and sum the networking time, as follows: Where latetimei represents the latest end time of satellite i’s link establishment, and earlytimei represents the earliest start time of satellite i’s link establishment;

[0031] c) Calculation of the number of satellites linking with the ground station at the same time: Select some moments, calculate the number of satellites linking at this time, and sum them up to get SatelliteNum;

[0032] d) Calculation of the number of ground stations linking with the satellite at the same time: Select some time points, calculate the number of ground stations linking with the satellite at this time, and sum them up to get StationNum;

[0033] e) The overall resource usage ResourceStatus is represented by the sum of the link establishment time of all scheduled satellite-to-ground networking tasks, calculated as follows: Where latetimej represents the latest end time of link building task j, and earlytimej represents the earliest start time of link building task j;

[0034] The calculation method of the network evaluation value Value is: Value = a×ContinueNetTime+b×SumNetTime+c×StatelliteNum+d×StationNum+e×ResourceStatus, where a, b, c, d and e are the weight values ​​of the total network duration, the total satellite link establishment duration, the number of satellites established at the same time, the number of ground stations established at the same time and the overall resource usage, respectively.

[0035] The present invention has the following beneficial effects:

[0036] The present invention combines the networking conditions of satellites and ground stations, performs a check on link-building resource constraints to resolve task conflicts, and uses an ant colony algorithm in an intelligent optimization algorithm to achieve optimal allocation of link-building resources, thereby determining the resources required to build a continuous and stable satellite-to-ground network.

[0037] Faced with the NP-hard problem of large-scale constellation networking, the present invention uses a heuristic ant colony algorithm to optimize the chain establishment resources for large-scale low-orbit constellation networking, and can provide a stable and robust solution for large-scale low-orbit constellation networking within a reasonable time. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 It is a flow chart of the principle of the invention. DETAILED DESCRIPTION

[0039] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with specific embodiments.

[0040] A constellation networking planning method based on ant colony algorithm comprises the following steps:

[0041] Step 1, receiving the input data of the planning algorithm, including: the arranged networking plan, the satellite-ground networking element tasks to be planned, and the constraint verification rules; reading the constraint information in the input data, including: the time required for the ground station antenna to switch satellites, the maximum number of satellites connected to ground stations, the time required for the satellite antenna to switch ground stations, the shortest link establishment time between the satellite and the ground station, etc.

[0042] Step 2: According to the constraint check rules and the arranged networking situation, the satellite-ground networking element tasks are processed. The specific constraint check rules include the maximum number of satellite link establishment, single link establishment time, antenna rotation time, number of ground station antennas and other constraints, and the satellite-ground networking element tasks that conflict with the arranged networking solutions are eliminated.

[0043] Step 3: Use the ant colony algorithm to plan the constellation network for the satellite-ground networking element tasks after conflicts are eliminated. The specific process is as follows:

[0044] Step 301, construct a matrix reachedMatrix, all elements of which have an initial value of 0, and construct a matrix conflictMatrix, assigning initial values ​​to each element according to the conflict situation of the satellite-ground networking element task; wherein reachedMatrix represents the nodes reached by the ants, that is, the satellite-ground networking tasks that have been selected, and conflictMatrix represents the nodes that the ants cannot reach, that is, the conflict taboo table;

[0045] Step 302, initializing parameters, including: initializing the ant population m, pheromone volatility ρ and the maximum number of iterations maxiterations, and setting the residual pheromone on the path (i, j) at time t to 0 and the current number of iterations = 0;

[0046] Step 303: randomly set the starting point of any ant a at and On node i, and update the reachedMatrix matrix and conflictMatrix matrix;

[0047] Among them, reachedMatrix represents the nodes that the ants have reached, that is, the satellite-ground networking tasks that have been selected. The specific values ​​are as follows:

[0048]

[0049] Indicates whether ant a has reached node i, that is, whether ant a has selected satellite-ground networking task i. The specific values ​​are as follows:

[0050]

[0051] Among them, conflictMatrix is ​​a conflict taboo table, and its specific values ​​are as follows:

[0052]

[0053] Indicates whether ant a can go to node i. The specific values ​​are as follows:

[0054]

[0055] Step 304: During the movement, the ant determines the direction of movement based on the pheromones remaining on each path, and continuously selects the next node based on the transfer probability. and On node j, until there is no node to be selected; and update the reachedMatrix matrix and the conflictMatrix matrix, and update the number of iterations: iterations = iterations + 1;

[0056] Among them, the transition probability The calculation formula is as follows:

[0057]

[0058] Where alloweda is and Nodes, represents the pheromone remaining on the path (i, j) of ant a at time t;

[0059] Step 305, after each iteration, the evaluation values ​​of all ants are calculated, and the pheromones remaining on each path are updated;

[0060] Among them, the pheromone on the path (i, j) is updated according to the following formula:

[0061]

[0062] in,

[0063] Valuea is the evaluation value of ant a;

[0064] Step 306, determine whether iterations=maxiterations. If so, the maximum number of iterations has been reached and the iteration is stopped; otherwise, return to step 303;

[0065] Step 307, selecting the solution with the highest evaluation value as the final optimal solution;

[0066] Step 308, integrating the overall networking information and outputting the networking solution.

[0067] In step 305, the evaluation value is calculated as follows:

[0068] a) Calculation of total networking duration: Take the earliest start time earlytime and the latest end time latetime of all successfully scheduled networking tasks, and calculate the networking duration as ContinueNetTime = latetime - earlytime;

[0069] b) Calculation of the total link establishment time of n satellites: For each satellite, calculate the earliest time and the latest time of networking, and sum the networking time, as follows: Where latetimei represents the latest end time of satellite i’s link establishment, and earlytimei represents the earliest start time of satellite i’s link establishment;

[0070] c) Calculation of the number of satellites linking with the ground station at the same time: Select some moments, calculate the number of satellites linking at this time, and sum them up to get SatelliteNum;

[0071] d) Calculation of the number of ground stations linking with the satellite at the same time: Select some time points, calculate the number of ground stations linking with the satellite at this time, and sum them up to get StationNum;

[0072] e) The overall resource usage ResourceStatus is represented by the sum of the link establishment time of all scheduled satellite-to-ground networking tasks, calculated as follows: Where latetimej represents the latest end time of link building task j, and earlytimej represents the earliest start time of link building task j;

[0073] The calculation method of the network evaluation value Value is: Value = a×ContinueNetTime+b×SumNetTime+c×SatelliteNum+d×StationNum+e×ResourceStatus, where a, b, c, d and e are the weight values ​​of the total network duration, the total satellite link establishment duration, the number of satellites established at the same time, the number of ground stations established at the same time and the overall resource usage, respectively.

Claims

1. A constellation network planning method based on ant colony algorithm, characterized in that: The following steps are involved: Step 1: Receive the arranged networking plan, satellite-ground networking element tasks to be planned, and constraint verification rules sent by the mission planning software; Step 2: Eliminate satellite-ground networking element tasks that conflict with the arranged networking solutions according to the constraint verification rules; Step 3: Use the ant colony algorithm to plan the constellation network for the satellite-ground networking element task after conflicts are eliminated. The ant colony algorithm is as follows: first, initialize the reachability matrix, conflict matrix and parameters, select the starting point of the ants, calculate the transfer probability based on pheromones, select the next node based on the transfer probability until all reachable nodes are selected, calculate the evaluation value of the solution, update the pheromone table, and then start a new ant search until the algorithm termination condition is reached.

2. The constellation network planning method based on ant colony algorithm according to claim 1, characterized in that: The specific process of step 3 is: Step 301, construct a matrix reachedMatrix, all elements of which have an initial value of 0, and construct a matrix conflictMatrix, assigning initial values ​​to each element according to the conflict situation of the satellite-ground networking element task; wherein reachedMatrix represents the nodes reached by the ants, that is, the satellite-ground networking tasks that have been selected, and conflictMatrix represents the nodes that the ants cannot reach, that is, the conflict taboo table; Step 302, initializing parameters, including: initializing the ant population m, pheromone volatility ρ and the maximum number of iterations maxiterations, and setting the residual pheromone on the path (i, j) at time t to 0 and the current number of iterations = 0; Step 303: randomly set the starting point of any ant a at Head On node i, and update the reachedMatrix matrix and conflictMatrix matrix; in, Indicates whether ant a has reached node i, that is, whether ant a has selected satellite-ground networking task i. The specific values ​​are as follows: Indicates whether ant a can go to node i. The specific values ​​are as follows: Step 304: During the movement, the ant determines the direction of movement based on the pheromones remaining on each path, and continuously selects the next node based on the transfer probability. and On node j, until there is no node to be selected; and update the reachedMatrix matrix and the conflictMatrix matrix, and update the number of iterations: iterations = iterations + 1; Among them, the transition probability The calculation formula is as follows: In the formula, allowed a for Head Nodes, represents the pheromone remaining on the path (i, j) of ant a at time t; Step 305, after each iteration, the evaluation values ​​of all ants are calculated, and the pheromones remaining on each path are updated; Among them, the pheromone on the path (i, j) is updated according to the following formula: in, Value a is the evaluation value of ant a; Step 306, determine whether iterations=maxiterations. If so, the maximum number of iterations has been reached and the iteration is stopped; otherwise, return to step 303; Step 307: Select the solution with the highest evaluation value as the final optimal solution.

3. The constellation network planning method based on ant colony algorithm according to claim 2, characterized in that: The calculation of the evaluation value in step 305 is specifically as follows: a) Calculation of total networking duration: Take the earliest start time earlytime and the latest end time latetime of all successfully scheduled networking tasks, and calculate the networking duration as ContinueNetTime = latetime - earlytime; b) Calculation of the total link establishment time of n satellites: For each satellite, calculate the earliest time and the latest time of networking, and sum the networking time, as follows: where latetime i Indicates the latest end time of satellite i link establishment, earlytime i Indicates the earliest start time of link establishment of satellite i; c) Calculation of the number of satellites linking with the ground station at the same time: Select some moments, calculate the number of satellites linking at this time, and sum them up to get SatelliteNum; d) Calculation of the number of ground stations linking with the satellite at the same time: Select some time points, calculate the number of ground stations linking with the satellite at this time, and sum them up to get StationNum; e) The overall resource usage ResourceStatus is represented by the sum of the link establishment time of all scheduled satellite-to-ground networking tasks, calculated as follows: where latetime j Indicates the latest completion time of link building task j, earlytime j Indicates the earliest start time of link building task j; The calculation method of the network evaluation value Value is: Value = a×ContinueNetTime+b×SumNetTime+c×SatelliteNum+d×StationNum+e×ResourceStatus, where a, b, c, d and e are the weight values ​​of the total network duration, the total satellite link establishment duration, the number of satellites established at the same time, the number of ground stations established at the same time and the overall resource usage, respectively.