CN117521260B - Discrete distribution-oriented satellite constellation design method for multi-target area coverage - Google Patents

Discrete distribution-oriented satellite constellation design method for multi-target area coverage Download PDF

Info

Publication number
CN117521260B
CN117521260B CN202311536225.4A CN202311536225A CN117521260B CN 117521260 B CN117521260 B CN 117521260B CN 202311536225 A CN202311536225 A CN 202311536225A CN 117521260 B CN117521260 B CN 117521260B
Authority
CN
China
Prior art keywords
satellite
coverage
target
constellation
algorithm
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202311536225.4A
Other languages
Chinese (zh)
Other versions
CN117521260A (en
Inventor
乔鹏昊
钱霙婧
李涧青
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Technology
Hangzhou Dianzi University
Original Assignee
Beijing University of Technology
Hangzhou Dianzi University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Technology, Hangzhou Dianzi University filed Critical Beijing University of Technology
Priority to CN202311536225.4A priority Critical patent/CN117521260B/en
Publication of CN117521260A publication Critical patent/CN117521260A/en
Application granted granted Critical
Publication of CN117521260B publication Critical patent/CN117521260B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/10Geometric CAD
    • G06F30/15Vehicle, aircraft or watercraft design
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/23Clustering techniques
    • G06F18/232Non-hierarchical techniques
    • G06F18/2321Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
    • G06F18/23213Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00Details relating to CAD techniques
    • G06F2111/06Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2119/00Details relating to the type or aim of the analysis or the optimisation
    • G06F2119/12Timing analysis or timing optimisation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2119/00Details relating to the type or aim of the analysis or the optimisation
    • G06F2119/14Force analysis or force optimisation, e.g. static or dynamic forces
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Geometry (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Evolutionary Computation (AREA)
  • Computer Hardware Design (AREA)
  • Automation & Control Theory (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Probability & Statistics with Applications (AREA)
  • Mathematical Optimization (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Biology (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention discloses a satellite constellation design method for multi-target area coverage oriented to discrete distribution, which relates to the field of orbit dynamics and comprises the following steps of S1: analyzing a periodical movement rule of the right ascent and descent of a return period of a low-altitude return orbit under a two-body model, and determining a satellite sensor coverage mode; s2: constructing an inner layer optimization algorithm, and referring to a satellite lower point track optimization algorithm, giving coverage loss definition and analyzing; s3: analyzing distribution characteristics of the target sites and orbit regression characteristics of the reference satellites, and giving a grouping scheme of the target sites and a reference satellite distribution scheme; s4: and constructing an outer layer optimization algorithm by taking the undersea point track provided by the reference satellite as a constellation design basis. The satellite constellation design method for the multi-target area coverage oriented to the discrete distribution is adopted, the coverage targets can be selected randomly, the single-star utilization rate is high, the method applicability is high, and the communication and remote sensing requirements of important areas in the global scope can be met.

Description

Discrete distribution-oriented satellite constellation design method for multi-target area coverage
Technical Field
The invention relates to the field of orbit dynamics, in particular to a satellite constellation design method for multi-target area coverage oriented to discrete distribution.
Background
Low Earth Orbit (LEO) satellites have the advantages of low latency, low path loss, high resolution, etc. in the fields of communications and remote sensing. LEO satellites may be limited in terms of service time, satellite communications, global coverage, etc., due to limited coverage capabilities. Thus, ensuring stable communication or achieving space-time continuous coverage requires priority in LEO constellation design. Heuristic algorithms have become effective tools for solving such problems in the optimization design of constellation configurations. In this context, the choice of decision variables in the algorithm is consistent, and the key is the design of the performance index and objective function. These factors have an important guiding role in the optimization process of the constellation design. In the design of space symmetric distribution constellation configuration, factors such as the number of visible satellites, revisiting time intervals, constellation construction cost and the like are indispensable optimization indexes. As can be seen, constellation configuration design is a complex task, often taking into account multiple metrics. However, using a single objective optimization algorithm requires integrating multiple performance metrics into a single objective function, which tends to produce a very complex objective function that further affects the quality of the optimization results. To break this limitation, multi-objective optimization algorithms gradually replace single-objective optimization algorithms. Specifically, aiming at the quick revisit problem, schemes such as a multi-island genetic algorithm, a multi-target particle swarm optimization algorithm and the like can be used for generating an optimal constellation configuration under the specific problem. These algorithms allow multiple targets to be optimized simultaneously, giving a more efficient, stable constellation design approach. The structure of the symmetrically distributed constellation is relatively simple, and the single-satellite utilization rate of satellites in the constellation is not obviously improved, so that the constellation cannot give an efficient solution when facing a specific coverage task.
Therefore, it is necessary to provide a satellite constellation design method for multi-target area coverage of discrete distribution to solve the above-mentioned problems.
Disclosure of Invention
The invention aims to provide a satellite constellation design method for multi-target area coverage oriented to discrete distribution, which solves the communication and remote sensing requirements of important areas in the global scope.
In order to achieve the above object, the present invention provides a satellite constellation design method for multi-target area coverage oriented to discrete distribution, the constellation design method comprising the following steps:
s1: analyzing a periodical movement rule of the right ascent and descent of a return period of a low-altitude return orbit under a two-body model, and determining a satellite sensor coverage mode;
s2: constructing an inner layer optimization algorithm, and referring to a satellite lower point track optimization algorithm, giving coverage loss definition and analyzing;
S3: analyzing distribution characteristics of the target sites and orbit regression characteristics of the reference satellites, and giving a grouping scheme of the target sites and a reference satellite distribution scheme;
S4: and constructing an outer layer optimization algorithm by taking the undersea point track provided by the reference satellite as a constellation design basis.
Preferably, in step S1, the regression orbit refers to that the orbit regression period T S of the satellite is an integer multiple of the sun day T G, the satellite point tracks of the reference satellites are periodically overlapped, and initial orbit parameters of a plurality of satellites are designed to construct a common ground track RGT constellation;
Wherein T S is an orbital regression period, T G is a sidereal day, and N E and N S are an earth sidereal day number and a reference satellite orbital period number, respectively;
Obtaining T G as a constant from the formula (1), determining the ratio of T G to T S, and determining the orbit period and the orbit semi-major axis a sat of the satellite from the formula (2);
wherein mu e is the gravitational constant;
The elevation angle alpha r is calculated according to equation (3),
In the geocentric equatorial inertial coordinate system, the position vector of the target region is denoted as r tar, the normal vector of the target point level is denoted as n tar, and the satellite position vector is denoted as r sat.
Preferably, in step S2, the inner layer optimization algorithm is a reference satellite lower point trajectory optimization algorithm, wherein n places are considered in total, and the coverage of each area is independently optimized by using NSGA-II, so as to ensure that the coverage of each area is regarded as an independent target in trade-off analysis;
solving a sat by using a ratio of T S/TG =12/1 and using a formula (2), taking i sat and omega sat as decision variables, coding chromosomes into real numbers, normalizing the decision variables, and optimizing in a section [0,1 ];
Wherein y q is any value of the optimization variable in the interval, ρ 1 and ρ 2 are upper and lower edge values of the optimization variable, G is a coding value, q=1, 2 represents the coding of i sat and Ω sat respectively, and the value range of the decision variable is as follows:
Taking the coverage rate F ci of the reference satellite for each position in the n target areas as a performance index, the objective function F i is expressed as:
in the formula, the objective function is a forward optimization index, the algorithm generates a group of Pareto non-dominant solutions with 1 level, the comprehensive score of all individuals is calculated by adopting an entropy weight method, the optimal individuals are selected from the Pareto solution set, and the chromosome is decoded by the inverse formula (5) to obtain y q which is the optimal solution of the reference satellite.
Preferably, in step S3, the grouping optimization scheme is regarded as an optimization scheme corresponding to Case III, the K-means algorithm is adopted to group the regions, the right ascension of the initial satellite point trajectory is changed into ΔΩ r after each orbit period, and the right ascension and right ascension of the target region are processed as follows:
in the method, in the process of the invention, And psi l is the declination and the right ascension of the target site,/>And [ ψ l ] is a parameter used for grouping the target sites by the K-means clustering algorithm, ω E is the earth rotation angular velocity.
Preferably, in step S4, the outer layer optimization algorithm is a constellation configuration overall optimization design algorithm, and in Case of Case III, a plurality of target areas have a plurality of sub-constellations, and in order to construct a secondary integer programming algorithm, the following formula is introduced:
Wherein V 0,j (z) (J E J, Z E Z) is a coverage time matrix, x (Z) is a constellation configuration vector, each satellite in the RGT constellation has the same coverage to the target position, the coverage time is different, and x (Z) is set as a 01 vector;
wherein a satellite needs to be covered at the specific time, and the time step is marked as 1; otherwise, the symbol is 0, bj is the expected coverage time axis, J is the base number of the target point set J, and Z is the base number of the sub-constellation Z;
Grouping the target areas, wherein each group only has one configuration of a reference satellite control sub-constellation, and the formula (11) is rewritten as follows:
Wherein P is a coverage time matrix of the target sites in the same group;
Wherein S r(Sr =1, 2, …, K) is a reference satellite index, T r is the number of target sites of each group, according to the following formula (14);
And defining a desired coverage time axis B, and solving the optimal x by using a quadratic integer programming algorithm.
Therefore, the satellite constellation design method facing to the discrete distribution multi-target area coverage has the following beneficial effects:
(1) The coverage target can be selected at will, an asymmetric constellation is used as a constellation construction basis, the degree of freedom of constellation space distribution is high, and the configuration design is highly targeted.
(2) The invention has high single star utilization rate, adopts a K-means clustering algorithm in the target packet, deeply analyzes the relation between the track characteristic and the target site distribution, and nests an NSGA-II optimization algorithm with a secondary integer programming algorithm on the constellation design, thereby effectively reducing the coverage loss.
(3) The method has strong applicability, wherein the constellation design method is simultaneously suitable for target site coverage of concentrated distribution and discrete distribution, and the algorithm processing process is flexible.
The technical scheme of the invention is further described in detail through the drawings and the embodiments.
Drawings
FIG. 1 is a flow chart of a method of designing a satellite constellation for discrete distribution-oriented multi-target area coverage in accordance with the present invention;
FIG. 2is a schematic view of satellite coverage according to the present invention;
FIG. 3 is a graph of sensor elevation versus coverage in accordance with the present invention;
FIG. 4 is a coverage loss schematic of the present invention;
FIG. 5 is a schematic diagram of a reference satellite configuration of the present invention;
FIG. 6 is an illustration of coverage loss for the present invention;
FIG. 7 is a diagram showing the right ascent point of the present invention;
FIG. 8 is a schematic diagram of the destination point grouping results of the present invention;
FIG. 9 is a coverage loss comparison plot of the present invention;
FIG. 10 is a schematic view of the spatial distribution of satellite constellation according to the present invention;
FIG. 11 is a schematic view of a three-dimensional configuration of a satellite constellation according to the present invention;
FIG. 12 is a histogram of the coverage results of the target site of the present invention;
Detailed Description
The technical scheme of the invention is further described below through the attached drawings and the embodiments.
Unless defined otherwise, technical or scientific terms used herein should be given the ordinary meaning as understood by one of ordinary skill in the art to which this invention belongs.
As used herein, the word "comprising" or "comprises" and the like means that elements preceding the word encompass the elements recited after the word, and not exclude the possibility of also encompassing other elements. The terms "inner," "outer," "upper," "lower," and the like are used for convenience in describing and simplifying the description based on the orientation or positional relationship shown in the drawings, and do not denote or imply that the devices or elements referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus should not be construed as limiting the invention, but the relative positional relationship may be changed when the absolute position of the object to be described is changed accordingly. In the present invention, unless explicitly specified and limited otherwise, the term "attached" and the like should be construed broadly, and may be, for example, fixedly attached, detachably attached, or integrally formed; can be directly connected or indirectly connected through an intermediate medium, and can be communicated with the inside of two elements or the interaction relationship of the two elements. The specific meaning of the above terms in the present invention can be understood by those of ordinary skill in the art according to the specific circumstances.
Examples
As shown in fig. 1, the invention provides a satellite constellation design method for multi-target area coverage oriented to discrete distribution, which comprises the following steps:
s1: analyzing a periodical movement rule of the right ascent and descent of a return period of a low-altitude return orbit under a two-body model, and determining a satellite sensor coverage mode;
s2: constructing an inner layer optimization algorithm, and referring to a satellite lower point track optimization algorithm, giving coverage loss definition and analyzing;
S3: analyzing distribution characteristics of the target sites and orbit regression characteristics of the reference satellites, and giving a grouping scheme of the target sites and a reference satellite distribution scheme;
S4: and constructing an outer layer optimization algorithm by taking the undersea point track provided by the reference satellite as a constellation design basis.
In step S1, the regression orbit refers to that the orbit regression period T S of the satellite is an integer multiple of the sun day T G, the satellite point tracks under the reference satellite will overlap periodically, and the initial orbit parameters of a plurality of satellites are designed to construct a common ground track RGT constellation;
Wherein T S is an orbital regression period, T G is a sidereal day, and N E and N S are an earth sidereal day number and a reference satellite orbital period number, respectively;
Obtaining T G as a constant from the formula (1), determining the ratio of T G to T S, and determining the orbit period and the orbit semi-major axis a sat of the satellite from the formula (2);
wherein mu e is the gravitational constant;
The elevation angle α r is calculated according to equation (3), the geometrical relationship of which is shown in fig. 2, the simulation duration is set to the track recursion period T, the number of time steps k=720, and the time step is calculated as T step =t/k.
In the geocentric equatorial inertial coordinate system, the position vector of the target region is denoted as r tar, the normal vector of the target point level is denoted as n tar, and the satellite position vector is denoted as r sat.
Assuming n target areas, the coverage is recorded in a binary matrix p 0, i.e. the coverage of the ith target area by the reference satellite at the jth time step is recorded in p 0 (i, j);
Where α s is the minimum elevation threshold, the required α s value is different for different regions. In a broader area, the signal transmission process has less blockage, and the smaller alpha s can meet the requirements. Also, in areas where signal transmission is hindered, a larger α s is required, typically α s e 5 °,50 ° ]. Fig. 3 shows the variation of the target area coverage C r with α s. The target area position is [116.4 DEG E,39.6 DEG N ], and the satellite orbit parameters are [9100.5km,0.001,66.4 DEG, 227.4 DEG, 0 DEG ].
In step S2, the inner layer optimization algorithm is a reference satellite point-under-satellite trajectory optimization algorithm, wherein n places are considered in total, the coverage of each area is optimized independently by using NSGA-II, and the coverage of each area is ensured to be regarded as an independent target in trade-off analysis;
solving a sat by using a ratio of T S/TG =12/1 and using a formula (2), taking i sat and omega sat as decision variables, coding chromosomes into real numbers, normalizing the decision variables, and optimizing in a section [0,1 ];
Wherein y q is any value of the optimization variable in the interval, ρ 1 and ρ 2 are upper and lower edge values of the optimization variable, G is a coding value, q=1, 2 represents the coding of i sat and Ω sat respectively, and the value range of the decision variable is as follows:
Taking the coverage rate F ci of the reference satellite for each position in the n target areas as a performance index, the objective function F i is expressed as:
in the formula, the objective function is a forward optimization index, the algorithm generates a group of Pareto non-dominant solutions with 1 level, the comprehensive score of all individuals is calculated by adopting an entropy weight method, the optimal individuals are selected from the Pareto solution set, and the chromosome is decoded by the inverse formula (5) to obtain y q which is the optimal solution of the reference satellite.
In summary, the solution obtained by the reference satellite orbit element optimization algorithm represents the result of "average advantage and disadvantage" among the multiple targets. The algorithm will seek trade-offs between objective functions during the optimization process, and as new objective regions are added, the coverage of the original objective regions will decrease. This problem can be illustrated by fig. 4. Likewise, the coverage of the reference satellite in the target area 2 in the present case is reduced, also due to the addition of the target area 1.
Assuming that the understar trajectory of each sub-constellation is controlled by an independent reference satellite, the number of reference satellites is equal to the number of sub-constellations. In this case, a simple mathematical formula is used to quantify the extent of coverage loss:
Wherein C l 0 and C b 0 are the satellite's coverage loss and optimal coverage of the respective target area, respectively. Is the coverage loss rate. On this basis, the coverage loss is further analyzed, the following processing is performed and the results are compared:
case I: n regions-n reference satellites;
Case II: n regions-1 reference satellite;
case III: n regions-K reference satellites (K is the number of target site groupings).
Case I to III are shown in fig. 5. Taking the coverage of 12 target areas by a reference satellite as an example, the positions of the target areas are represented by the right ascension ψ l and the right ascension φ l, as shown in Table 1. In this analysis, first consider the coverage loss of Case I and Case II in a star day. Case III corresponds to a packet optimization scheme (GOS) to be discussed later.
Fig. 6 (a) shows the coverage loss after global optimization, and it can be seen from the figure that the reference satellite has different degrees of coverage loss for each target area with respect to its optimal coverage capability. Fig. 6 (b) shows the coverage loss of the target area.
In step S3, the grouping optimization scheme is regarded as an optimization scheme corresponding to Case III, the K-means algorithm is adopted to group the regions, the right ascension of the initial satellite point track of the reference satellite is changed to ΔΩ r after each orbit period, and as shown in fig. 7, the right ascension and right ascension of the target region are processed as follows:
in the method, in the process of the invention, And psi l is the declination and the right ascension of the target site,/>And [ ψ l ] is a parameter used for grouping the target sites by the K-means clustering algorithm, ω E is the earth rotation angular velocity.
The K-means clustering algorithm is a simple method of dividing a dataset into K distinct clusters. In order to perform K-means clustering, the required number of clusters K must be specified first; the K-means algorithm then assigns each observation to an exact cluster. After the coordinates of the target sites are processed in a formula, the target sites with more dispersed distribution can be concentrated in the interval of [0, delta omega r ] by utilizing two parameters [ phi l ] and [ phi l ], and the original coverage characteristic of the target sites is not lost. Grouping results as shown in fig. 8, the positions of the arbitrarily chosen 12 target sites are listed in table one and have been divided into three groups, under which condition NSGA-II can generate reference satellites for all groups.
The orbit parameters of the three reference satellites are respectively τ1=[8061.7km,0.01,72.4°,10.14°,0,0],τ2=[8061.7km,0.01,42.79°,274.16°,0,0],τ3=[8061.7km,0.01,72.36°,302.29°,0,0].
List of target site locations
In connection with the above analysis, the coverage loss of GOS is smaller compared to the Overall Optimization Scheme (OOS), as shown in fig. 9. Therefore, a preliminary conclusion is made that the satellite utilization can be improved by packet optimization, and the total number of satellites in the constellation can be reduced. In this example, the GOS algorithm is effective.
In step S4, the outer layer optimization algorithm is a constellation configuration overall optimization design algorithm, and in Case of Case III, a plurality of target areas have a plurality of sub-constellations, in order to construct a secondary integer programming algorithm, the following formula is introduced:
Wherein V 0,j (z) (J E J, Z E Z) is a coverage time matrix, x (Z) is a constellation configuration vector, each satellite in the RGT constellation has the same coverage to the target position, the coverage time is different, and x (Z) is set as a 01 vector;
wherein a satellite needs to be covered at the specific time, and the time step is marked as 1; otherwise, the symbol is 0, bj is the expected coverage time axis, J is the base number of the target point set J, and Z is the base number of the sub-constellation Z;
Grouping the target areas, wherein each group only has one configuration of a reference satellite control sub-constellation, and the formula (11) is rewritten as follows:
Wherein P is a coverage time matrix of the target sites in the same group;
Wherein S r(Sr =1, 2, …, K) is a reference satellite index, T r is the number of target sites of each group, according to the following formula (14);
And defining a desired coverage time axis B, and solving the optimal x by using a quadratic integer programming algorithm.
The algorithm is designed as follows:
Example two
The validity of the algorithm is verified by a set of examples, the position of the target site is shown in table two, and the constellation design results are shown in fig. 10-12. Fig. 10 shows the spatial distribution of the satellite constellation, fig. 11 is a three-dimensional schematic diagram of the satellite constellation, and fig. 12 is the coverage rate of the selected target sites.
Watch two target site positions
Therefore, the satellite constellation design method for the multi-target area coverage oriented to the discrete distribution solves the communication and remote sensing requirements on key targets in the global scope.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention and not for limiting it, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that: the technical scheme of the invention can be modified or replaced by the same, and the modified technical scheme cannot deviate from the spirit and scope of the technical scheme of the invention.

Claims (1)

1. A satellite constellation design method for multi-target area coverage oriented to discrete distribution is characterized by comprising the following steps: the constellation design method comprises the following steps:
s1: analyzing a periodical movement rule of the right ascent and descent of a return period of a low-altitude return orbit under a two-body model, and determining a satellite sensor coverage mode; in step S1, the regression orbit refers to that the orbit regression period T S of the satellite is an integer multiple of the sun day T G, the satellite point tracks under the reference satellite will overlap periodically, and the initial orbit parameters of a plurality of satellites are designed to construct a common ground track RGT constellation;
Wherein T S is an orbital regression period, T G is a sidereal day, and N E and N S are an earth sidereal day number and a reference satellite orbital period number, respectively;
Obtaining T G as a constant from the formula (1), determining the ratio of T G to T S, and determining the orbit period and the orbit semi-major axis a sat of the satellite from the formula (2);
wherein mu e is the gravitational constant;
The elevation angle alpha r is calculated according to the formula (3) (3),
In the geocentric equatorial inertial coordinate system, the position vector of the target area is denoted as r tar, the normal vector of the target point horizontal plane is denoted as n tar, and the satellite position vector is denoted as r sat;
S2: constructing an inner layer optimization algorithm, and referring to a satellite lower point track optimization algorithm, giving coverage loss definition and analyzing; in step S2, the inner layer optimization algorithm is a reference satellite point-under-satellite trajectory optimization algorithm, wherein n places are considered in total, the coverage of each area is optimized independently by using NSGA-II, and the coverage of each area is ensured to be regarded as an independent target in trade-off analysis;
solving a sat by using a ratio of T S/TG =12/1 and using a formula (2), taking i sat and omega sat as decision variables, coding chromosomes into real numbers, normalizing the decision variables, and optimizing in a section [0,1 ];
Wherein y q is any value of the optimization variable in the interval, ρ 1 and ρ 2 are upper and lower edge values of the optimization variable, G is a coding value, q=1, 2 represents the coding of i sat and Ω sat respectively, and the value range of the decision variable is as follows:
Taking the coverage rate F ci of the reference satellite for each position in the n target areas as a performance index, the objective function F i is expressed as:
In the formula (7), the objective function is a forward optimization index, the algorithm generates a group of Pareto non-dominant solutions with the level 1, the comprehensive scores of all individuals are calculated by adopting an entropy weight method, the optimal individuals are selected from the Pareto solution set, and the chromosome is decoded by the reverse formula (5) to obtain y q which is the optimal solution of the reference satellite;
s3: analyzing distribution characteristics of the target sites and orbit regression characteristics of the reference satellites, and giving a grouping scheme of the target sites and a reference satellite distribution scheme; in step S3, the packet optimization scheme is regarded as CaseIII: the method comprises the steps that an optimization scheme corresponding to n areas and K reference satellites is adopted, the areas are grouped by adopting a K-means algorithm, the right ascension of initial satellite lower point tracks of the reference satellites is changed into delta omega r after each track period, and the right ascension of a target area are processed as follows:
Wherein phi l and phi l are declination and barefoot of the target site, phi l and phi l are parameters for grouping the target site by a K-means clustering algorithm, and omega E is the rotation angular velocity of the earth;
S4: constructing an outer layer optimization algorithm by taking a satellite-based point track provided by a reference satellite as a constellation design basis;
In step S4, the outer layer optimization algorithm is a constellation configuration overall optimization design algorithm, and in CaseIII cases, a plurality of target areas have a plurality of sub-constellations, and in order to construct a secondary integer programming algorithm, the following formula is introduced:
Wherein V 0,j (z) (J e J, Z e Z) is the overlay time matrix element, As constellation configuration vectors, each satellite in the RGT constellation has the same coverage to the target position and different coverage participating time;
A binary vector consisting of 01, wherein a satellite needs to be covered at a specific time, and the time step is marked as 1; otherwise, the value is recorded as 0;
b j is the desired coverage time axis, |j| is the cardinality of the target point set J, |z| is the cardinality of the sub-constellation Z;
Grouping the target areas, wherein each group only has one configuration of a reference satellite control sub-constellation, and the formula (11) is rewritten as follows:
Wherein P (k) is a coverage time matrix of the target sites in the same group;
Wherein S r(Sr =1, 2, …, K) is a reference satellite index, T r is the number of target sites of each group, according to the following formula (14);
And defining a desired coverage time axis B, and solving the optimal x by using a quadratic integer programming algorithm.
CN202311536225.4A 2023-11-17 2023-11-17 Discrete distribution-oriented satellite constellation design method for multi-target area coverage Active CN117521260B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311536225.4A CN117521260B (en) 2023-11-17 2023-11-17 Discrete distribution-oriented satellite constellation design method for multi-target area coverage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311536225.4A CN117521260B (en) 2023-11-17 2023-11-17 Discrete distribution-oriented satellite constellation design method for multi-target area coverage

Publications (2)

Publication Number Publication Date
CN117521260A CN117521260A (en) 2024-02-06
CN117521260B true CN117521260B (en) 2024-05-03

Family

ID=89741572

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311536225.4A Active CN117521260B (en) 2023-11-17 2023-11-17 Discrete distribution-oriented satellite constellation design method for multi-target area coverage

Country Status (1)

Country Link
CN (1) CN117521260B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8457810B1 (en) * 2011-04-14 2013-06-04 The Boeing Company Compound steering law for efficient low thrust transfer orbit trajectory
CN107798187A (en) * 2017-10-24 2018-03-13 北京理工大学 A kind of efficiently satellite constellation Multipurpose Optimal Method
CN109146157A (en) * 2018-08-02 2019-01-04 中国人民解放军战略支援部队航天工程大学 A kind of common rail mark emergency scouting Constellation Design method based on Sun synchronization repeating orbit
CN113395486A (en) * 2021-03-19 2021-09-14 天地信息网络有限公司 Ground area continuous monitoring system based on space brain
CN113673148A (en) * 2021-07-26 2021-11-19 南京航空航天大学 Area coverage satellite constellation optimization method based on genetic ant colony dynamic fusion
CN114386282A (en) * 2022-01-14 2022-04-22 中国空间技术研究院 Low-orbit giant constellation orbit dynamics analysis method and device of semi-analysis method
CN116976075A (en) * 2023-06-06 2023-10-31 北京市遥感信息研究所 Collaborative intelligent planning method and system for space heterogeneous remote sensing satellite

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9132925B2 (en) * 2009-02-19 2015-09-15 C. Laurence Korb Methods for optimizing the performance, cost and constellation design of satellites for full and partial earth coverage

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8457810B1 (en) * 2011-04-14 2013-06-04 The Boeing Company Compound steering law for efficient low thrust transfer orbit trajectory
CN107798187A (en) * 2017-10-24 2018-03-13 北京理工大学 A kind of efficiently satellite constellation Multipurpose Optimal Method
CN109146157A (en) * 2018-08-02 2019-01-04 中国人民解放军战略支援部队航天工程大学 A kind of common rail mark emergency scouting Constellation Design method based on Sun synchronization repeating orbit
CN113395486A (en) * 2021-03-19 2021-09-14 天地信息网络有限公司 Ground area continuous monitoring system based on space brain
CN113673148A (en) * 2021-07-26 2021-11-19 南京航空航天大学 Area coverage satellite constellation optimization method based on genetic ant colony dynamic fusion
CN114386282A (en) * 2022-01-14 2022-04-22 中国空间技术研究院 Low-orbit giant constellation orbit dynamics analysis method and device of semi-analysis method
CN116976075A (en) * 2023-06-06 2023-10-31 北京市遥感信息研究所 Collaborative intelligent planning method and system for space heterogeneous remote sensing satellite

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于粒子群的非规则区域连续覆盖星座设计;刘明;杨明;高兴;杨丁;葛亚杰;;航天控制;20200415(第02期);第31-37页 *

Also Published As

Publication number Publication date
CN117521260A (en) 2024-02-06

Similar Documents

Publication Publication Date Title
CN109635332B (en) Variable-step constellation orbit optimization method and device based on genetic algorithm
Lin et al. An adaptive UAV deployment scheme for emergency networking
CN109116349B (en) Multi-sensor cooperative tracking joint optimization decision method
Sedighi et al. Autonomous local path planning for a mobile robot using a genetic algorithm
CN113487221B (en) Space-sky heterogeneous earth observation resource cooperative scheduling method for dynamic target observation
CN110096069B (en) Optimization method based on NSGA II ultra-width imaging satellite formation configuration
CN103632053A (en) Combined scheduling method of satellite-ground measurement and control resources of low-mid-orbit satellite constellation based on orbit determination constraint satisfaction
CN105279581A (en) GEO-UAV Bi-SAR route planning method based on differential evolution
CN116307535A (en) Multi-star collaborative imaging task planning method based on improved differential evolution algorithm
CN110986960A (en) Unmanned aerial vehicle track planning method based on improved clustering algorithm
CN104680238A (en) To-be-observed task determination method for multi-satellite synergistic earth observation
CN116633424B (en) Walker constellation configuration design method for avoiding large-scale constellation downlink interference
CN117521260B (en) Discrete distribution-oriented satellite constellation design method for multi-target area coverage
CN115081343A (en) Space-based passive detection orbit determination method based on neural network combined with genetic algorithm
CN110929410B (en) Deep space detector measurement and control antenna installation direction optimization method
Chen et al. A semi-analytical method for periodic earth coverage satellites optimization
CN115453581A (en) Optimization method of low-orbit navigation enhanced satellite constellation
Liu et al. Design of satellite constellation with inter-satellite links for global communication using genetic algorithm
CN115801097A (en) Space networking low-orbit multi-load global coverage mixed constellation design method
Wang et al. Optimization of regional coverage reconnaissance satellite constellation by nsga-ii algorithm
Huang et al. Time optimal robot motion control in simultaneous localization and map building (SLAM) problem
CN110146903B (en) Particle swarm Beidou satellite selection method based on feedback adjustment of inertial weight
Kaplan et al. Motion planning for persistent traveling solar-powered unmanned ground vehicles
Zhang et al. Multi-Objective Mission Planning for Multi-Payload Satellite Constellation via Non-Dominated Sorting Carnivorous Plant Algorithm
CN114440889B (en) Multi-domain cluster collaborative navigation method aiming at real-time interest region dynamic evolution

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant