Constellation design method and device, electronic equipment, storage medium and program product

Abstract

The invention provides a constellation design method and device, electronic equipment, a storage medium and a program product. The method comprises the following steps: acquiring a value range of a to-be-optimized parameter of a satellite constellation for a target area; determining the continuous coverage duration of the satellite constellation to the target area and the visible duration of the target area to the satellite constellation; performing optimization by taking maximization of the continuous coverage duration and the visible duration as an optimization target, and determining a target value of the to-be-optimized parameter based on a value range of the to-be-optimized parameter; and obtaining a constellation design scheme for the target area based on the target value of the to-be-optimized parameter. Therefore, collaborative optimization of coverage and communication performance can be realized, and constellation performance is improved.

Description

Technical Field

[0001] This disclosure relates to the field of satellite communication technology, and in particular to a constellation design method, apparatus, electronic device, storage medium, and program product. Background Technology

[0002] Currently, constellation communication consisting of multiple satellite constellations can provide high-speed, low-latency, and high-reliability communication services. However, the constellation needs to provide continuous coverage and visibility of the target area, which makes the constellation design very important. In related technologies, coverage is mainly achieved based on fixed orbital parameters, but existing methods are usually optimized based on a single indicator, resulting in poor performance. Summary of the Invention

[0003] This disclosure provides a constellation design method, apparatus, electronic device, storage medium, and program product.

[0004] Firstly, this disclosure provides a constellation design method, which includes:

[0005] Obtain the value range of the parameters to be optimized for the satellite constellation in the target area;

[0006] Determine the duration of continuous coverage of the target area by the satellite constellation, and the duration of visibility of the target area to the satellite constellation;

[0007] The optimization objective is to maximize the continuous coverage duration and the visibility duration. Based on the value range of the parameter to be optimized, the target value of the parameter to be optimized is determined.

[0008] Based on the target values ​​of the parameters to be optimized, a constellation design scheme for the target region is obtained.

[0009] Secondly, this disclosure provides a constellation design device, which includes:

[0010] The acquisition module is used to obtain the value range of the parameters to be optimized for the satellite constellation of the target area;

[0011] The first determining module is used to determine the duration of continuous coverage of the target area by the satellite constellation, and the duration of visibility of the target area to the satellite constellation;

[0012] The second determining module is used to optimize with the maximization of the continuous coverage duration and the visibility duration as the optimization objective, and to determine the target value of the parameter to be optimized based on the value range of the parameter to be optimized.

[0013] The acquisition module is used to obtain a constellation design scheme for the target region based on the target value of the parameter to be optimized.

[0014] Thirdly, this disclosure provides an electronic device comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores one or more computer programs executable by the at least one processor, the one or more computer programs being executed by the at least one processor to enable the at least one processor to perform the constellation design method described above.

[0015] Fourthly, this disclosure provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the constellation design method described above.

[0016] Fifthly, this disclosure provides a computer program product comprising computer-readable code, or a non-volatile computer-readable storage medium carrying the computer-readable code, wherein when the computer-readable code is run in a processor of an electronic device, the processor in the electronic device executes the constellation design method described above.

[0017] The constellation design method provided in this disclosure obtains the value range of the satellite constellation parameters to be optimized for a target area, determines the continuous coverage duration of the satellite constellation for the target area, and the visibility duration of the target area for the satellite constellation. Then, it optimizes the constellation by maximizing the continuous coverage duration and the visibility duration. Based on the value range of the parameters to be optimized, it determines the target value of the parameters to be optimized. In this way, based on multi-objective collaborative optimization, the parameters of the satellite constellation can be automatically and dynamically optimized, and multiple performance indicators such as continuous coverage duration and visibility duration can be balanced at the same time, thereby improving constellation performance.

[0018] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of this disclosure, nor is it intended to limit the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0019] The accompanying drawings are provided to further illustrate the present disclosure and form part of the specification. They are used together with the embodiments of the present disclosure to explain the disclosure and do not constitute a limitation thereof. The above and other features and advantages will become more apparent to those skilled in the art from the detailed description of exemplary embodiments with reference to the accompanying drawings, in which:

[0020] Figure 1 Application scenario diagrams of the constellation design method and apparatus provided in the embodiments of this disclosure;

[0021] Figure 2 A flowchart illustrating a constellation design method provided in this disclosure embodiment;

[0022] Figure 3 A block diagram of a constellation design device provided in an embodiment of this disclosure;

[0023] Figure 4 This is a block diagram of an electronic device provided in an embodiment of the present disclosure. Detailed Implementation

[0024] To enable those skilled in the art to better understand the technical solutions of this disclosure, exemplary embodiments of this disclosure are described below with reference to the accompanying drawings, including various details of the embodiments of this disclosure to aid understanding. These should be considered merely exemplary. Therefore, those skilled in the art should recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of this disclosure. Similarly, for clarity and conciseness, descriptions of well-known functions and structures are omitted in the following description.

[0025] Where there is no conflict, the various embodiments of this disclosure and the features thereof in the embodiments may be combined with each other.

[0026] As used herein, the term “and / or” includes any and all combinations of one or more related enumerated entries.

[0027] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit this disclosure. As used herein, the singular forms “a” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that when the terms “comprising” and / or “made of” are used in this specification, the presence of the stated feature, integral, step, operation, element, and / or component is specified, but the presence or addition of one or more other features, integrals, steps, operations, elements, components, and / or groups thereof is not excluded. Words such as “connected” or “linked” are not limited to physical or mechanical connections but can include electrical connections, whether direct or indirect.

[0028] Unless otherwise specified, all terms used herein (including technical and scientific terms) have the same meaning as commonly understood by one of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and this disclosure, and will not be interpreted as having an idealized or overly formal meaning, unless expressly so defined herein.

[0029] The collection, storage, use, processing, transmission, provision, and disclosure of user personal information in this technical solution comply with relevant laws and regulations and do not violate public order and good morals. The use of user data in this technical solution follows relevant national laws and regulations (e.g., the "Information Security Technology - Personal Information Security Specification"). For example, appropriate measures are taken for personal information access control; restrictions are imposed on the display of personal information; the purpose of using personal information does not exceed the scope of direct or reasonable association; and explicit identity targeting is eliminated when using personal information to avoid precisely identifying specific individuals.

[0030] In related technologies, constellation design in constellation communication is mainly based on fixed orbital parameters to achieve coverage. However, it is usually optimized based on a single indicator, which is inefficient, has poor performance, and is difficult to meet actual needs.

[0031] This disclosure provides a constellation design method that determines the continuous coverage duration of a satellite constellation over a target area and the visibility duration of the target area to the satellite constellation. Multi-objective optimization is then performed to determine the target values ​​of the satellite constellation's optimization parameters, thereby obtaining a constellation design scheme for the target area. This multi-objective collaborative optimization can automatically and dynamically optimize the satellite constellation's parameters and simultaneously balance multiple performance indicators such as continuous coverage duration and visibility duration, thus improving constellation performance.

[0032] Figure 1 This diagram illustrates an application scenario of the constellation design method and apparatus provided in the embodiments of this disclosure.

[0033] like Figure 1 As shown, the application scenario of this disclosure embodiment may include terminal device 101, network 103, and server 102. Network 103 is used as a medium to provide a communication link between terminal device 101 and server 102. Network 103 may include various connection types, such as wired or wireless communication links or fiber optic cables, etc.

[0034] Users can use terminal device 101 to interact with server 102 via network 103 to receive or send messages, etc. Various communication client applications can be installed on terminal device 101, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (for example only).

[0035] Terminal device 101 can be various electronic devices with a display screen and support web browsing, including but not limited to in-vehicle systems, smartphones, tablets, laptops, and desktop computers.

[0036] Server 102 can be a server that provides various services, such as a backend management server that supports websites browsed by users using terminal device 101 (for example only). The backend management server can analyze and process data such as received user requests, and feed back the processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal device.

[0037] It should be noted that the constellation design method and apparatus provided in this disclosure can be executed by server 102. Accordingly, the constellation design method and apparatus provided in this disclosure can be located in server 102. Alternatively, the constellation design method and apparatus provided in this disclosure can also be executed by a server or server cluster that is different from server 102 but capable of communicating with terminal device 101 and / or server 102. Accordingly, the constellation design method and apparatus provided in this disclosure can also be located in a server or server cluster that is different from server 102 but capable of communicating with terminal device 101 and / or server 102.

[0038] It should be understood that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.

[0039] Figure 2 A flowchart illustrating a constellation design method provided in an embodiment of this disclosure. (Refer to...) Figure 2 The method includes:

[0040] Step S210: Obtain the value range of the parameters to be optimized for the satellite constellation of the target area.

[0041] In this embodiment of the disclosure, satellite communication has advantages such as low latency and high reliability. To ensure the performance of satellite communication, the parameter design of the satellite constellation is very important. In practice, the constellation can be designed for the target area according to the requirements, and there is no limitation on the target area. The parameters of the satellite constellation may include, for example, the number, orbital altitude, orbital inclination, etc., and there is no specific limitation.

[0042] Step S220: Determine the duration of continuous coverage of the target area by the satellite constellation, and the duration of visibility of the target area to the satellite constellation.

[0043] In this embodiment of the disclosure, the continuous coverage duration can be used to represent the maximum continuous coverage of the satellite constellation over the target area. Generally, the longer the continuous coverage duration, the better the performance. The visibility duration can represent the total duration during which the user and the satellite constellation can maintain a communication link in the target area. Generally, the longer the visibility duration, the better the performance.

[0044] Step S230: Optimize with the goal of maximizing continuous coverage duration and visibility duration. Based on the range of values ​​of the parameters to be optimized, determine the target values ​​of the parameters to be optimized.

[0045] Step S240: Based on the target values ​​of the parameters to be optimized, obtain a constellation design scheme for the target region.

[0046] In this embodiment of the disclosure, multi-objective collaborative optimization can be performed based on continuous coverage duration and visibility duration to dynamically generate orbital parameters of the satellite constellation, thereby improving the performance of the satellite constellation and enhancing the reliability and performance of the constellation design scheme.

[0047] The constellation design method according to embodiments of this disclosure will now be described in detail.

[0048] As mentioned above, in this embodiment of the disclosure, there are no restrictions on the target area and the parameters to be optimized for the satellite constellation. In one possible embodiment, the target area can be determined according to different application scenarios. For example, for the Internet of Vehicles (IoV) scenario, an area with a high demand for IoV satellite connectivity can be selected.

[0049] In one possible implementation, since there are many parameters for the satellite constellation, several can be pre-set based on practical experience and circumstances, while other parameters can be dynamically generated using chromosome encoding. For example, the number of satellite constellations can be set to 6, using circular orbits with an eccentricity of 0.0, and the perigee arguments of all satellite constellations can be set. The value is 0, and the parameters to be optimized include orbital altitude, orbital inclination, right ascension of the ascending node, and mean anomaly. Furthermore, the range of values ​​for these parameters can be set; for example, the orbital altitude can range from 800 to 1100 km, the orbital inclination from 0 to 180 degrees, the right ascension of the ascending node from 0 to 360 degrees, and the mean anomaly from 0 to 360 degrees, without any restrictions.

[0050] Therefore, in this embodiment of the disclosure, dynamic optimization can be performed based on the value range of the parameter to be optimized. In one possible embodiment, it may include:

[0051] S1. Obtain the current parent population of the current iteration. The current parent population is the target population of the previous iteration obtained in the previous iteration. The population represents a set consisting of multiple candidate values ​​that satisfy the range of values ​​of the parameter to be optimized.

[0052] In this embodiment of the disclosure, multi-objective optimization can be performed through multiple rounds of iteration to determine the target value of the final parameter to be optimized. In addition, multiple rounds of iteration parameters can also be set, such as iteration termination conditions, population size, etc., without limitation.

[0053] For example, simulation tests can be performed using Matlab to output the value range of the parameters to be optimized, the iteration parameters, and other fixed parameters of the satellite constellation. Real number encoding can be used, and the target values ​​of the parameters to be optimized and the constellation design scheme can be automatically determined based on the constellation design method in the embodiments of this disclosure.

[0054] In this context, the population is a set of many individuals that represent a set of candidate solutions in the current search space. In this embodiment, an individual can represent a set of candidate values ​​for the parameters to be optimized for multiple satellite constellations. That is, it can also be understood that an individual is a constellation design scheme. By continuously iterating and evolving the population, the optimal target value is gradually determined.

[0055] S2. Perform genetic operations based on the current parent population to generate the current offspring population corresponding to the current parent population, and merge the current parent population and the current offspring population to obtain the current merged population.

[0056] Genetic operations can include selection, crossover, and mutation operations. Genetic operations can be performed based on the crossover probability and mutation probability. For example, if the current parent population has N candidate values, and the current offspring population also has N candidate values ​​after the generation is generated through genetic operations, then the current merged population has 2N candidate values.

[0057] S3. Based on the multiple current candidate values ​​included in the current merged population, determine the multiple current continuous coverage durations of the satellite constellation over the target area, and determine the multiple current visibility durations of the target area over the satellite constellation.

[0058] In one possible embodiment, there are multiple satellite constellations. Determining multiple current continuous coverage durations of the satellite constellations over the target area includes: obtaining the first continuous coverage duration of the multiple satellite constellations over multiple target points in the target area during a statistical period for any one of the multiple current candidate values; and averaging the multiple first continuous coverage durations to obtain the current continuous coverage duration of the multiple satellite constellations over the target area.

[0059] The statistical period can be one day, one week, etc., and can be set according to actual needs. This embodiment does not impose any restrictions on this. Target points can be selected from the target area, and multiple target points should be selected as evenly as possible, and key areas should be prioritized.

[0060] For example, the formula for calculating continuous coverage duration is:

[0061]

[0062] Where M represents the number of satellite constellations and N represents the number of target points. This represents the maximum duration of continuous coverage of the j-th satellite constellation to the i-th target point.

[0063] In one possible embodiment, determining the target area's multiple current visibility durations for the satellite constellation includes: for each of the multiple current candidate values, obtaining the number of times multiple target points in the target area are visible to multiple satellite constellations in a statistical period, and the first visibility duration for each visibility; and summing the multiple first visibility durations to obtain the target area's current visibility duration for the multiple satellite constellations.

[0064] For example, the formula for calculating the visible duration is:

[0065] Where M is the number of satellite constellations, N is the number of target points, and K is the number of times the target is visible. This represents the visibility duration of the i-th target point relative to the j-th satellite constellation during the k-th visibility period.

[0066] S4. Based on multiple current continuous coverage durations and multiple current visibility durations, select the current target population that meets the conditions from the current merged population. The current target population will be used as the parent population in the next iteration.

[0067] In this embodiment of the disclosure, multi-objective optimization can be performed based on continuous coverage duration and visibility duration. For example, the optimization objective function can be: The system calculates the duration of continuous coverage and the duration of visibility for each candidate value in the current merged population, and then sorts and filters them to obtain the current target population that meets the criteria.

[0068] In one possible embodiment of this step, it specifically includes:

[0069] 1) Based on multiple current continuous coverage durations and multiple current visibility durations, perform non-dominated sorting to obtain multiple levels. The lower the level, the better the corresponding candidate value. The candidate value in each level is not dominated by other candidate values ​​in the same level. Domination means that the continuous coverage duration and visibility duration corresponding to a candidate value are not less than another candidate value, and at least one of the continuous coverage duration and visibility duration is greater than another candidate value.

[0070] For example, for any two individuals (i.e. two current candidate values) x and y, if x is not inferior to y in terms of both continuous coverage duration and visibility duration (i.e., both are not less than the continuous coverage duration and visibility duration corresponding to y), and is superior to y in at least one of them, then x is determined to dominate y; individuals that are not dominated by any other individual can be classified into the same level.

[0071] In this embodiment of the disclosure, a fast non-dominated sort can be performed based on the current continuous coverage duration and current visibility duration corresponding to each candidate value. All non-dominated candidate values ​​in the current merged population are divided into a unified level, with the level set to 1. After masking this level, the remaining candidate values ​​are repeatedly divided into non-dominated sorts until all candidate values ​​are distinguished, thus obtaining multiple levels, each level including multiple candidate values.

[0072] 2) For each level, calculate the crowding distance corresponding to each candidate value in the level.

[0073] Among them, the crowding distance can measure the distribution density or distribution uniformity of candidate values ​​in the same level. The larger the crowding distance, the sparser the distribution. Candidate values ​​with sparse distribution are preferred to be retained to improve diversity.

[0074] In one possible embodiment, an initial congestion distance is first assigned to candidate values ​​at the same level. Then, the candidate values ​​at this level are sorted in ascending order according to the current continuous coverage duration and the current visibility duration. Candidate values ​​located at the boundary are assigned a larger congestion distance. And according to the preset congestion rules, the congestion distances corresponding to other candidate values ​​are calculated.

[0075] The preset congestion rule, for example, for candidate values ​​other than those located at the boundary after ascending order, determines the congestion distance based on the continuous coverage duration and visibility duration of the two adjacent candidate values. For example, a specific calculation formula is as follows:

[0076]

[0077] Where i represents the i-th candidate value after sorting in a certain level, and the value of i is greater than 1 and less than the number of candidate values ​​included in that level. and These are the maximum and minimum durations of continuous coverage at this level. The maximum and minimum visible duration within the hierarchy.

[0078] 3) Based on multiple levels and the crowding distance corresponding to each candidate value in each level, select the current target population from the current merged population.

[0079] In one possible implementation of this step, candidate values ​​are sequentially obtained from each level in ascending order of hierarchy until N candidate values ​​are selected. The selected N candidate values ​​constitute the current target population, where the current parent population includes N candidate regions, where N is an integer greater than 1. If the number of candidate values ​​added to the nth level exceeds N, then candidate values ​​that can reach N are sequentially selected in descending order of the crowding level of the candidate values ​​in the nth level, where n is an integer greater than 1.

[0080] In this embodiment of the disclosure, the logical rule for screening the current target population is to prioritize the selection of candidate values ​​from the smaller non-dominant levels. If a certain level cannot be fully included (more than N), then selection is made from the largest to the smallest crowding distance in that level until N is satisfied.

[0081] S5. Based on the parent population of the next iteration, proceed to the next iteration until the termination condition is met. Determine the target value of the parameter to be optimized based on the parent population of the last iteration.

[0082] For example, the termination condition can be reaching a preset number of iterations or the value converging, and there are no restrictions on this.

[0083] In this embodiment of the disclosure, when the termination condition is met, multiple candidate values ​​in the parent population of the last iteration can be sorted in a non-dominated manner, and then any one of the candidate values ​​in the first level can be selected as the target value of the parameter to be optimized.

[0084] In this embodiment of the disclosure, multi-objective optimization through multiple iterations can simultaneously optimize continuous coverage duration and visibility duration, thereby improving the accuracy and reliability of satellite constellation parameter determination and enhancing constellation design performance.

[0085] Furthermore, based on the target values ​​of the parameters to be optimized determined by the constellation design method in this embodiment, further tests can be conducted to verify the effect. For example, based on the target values ​​of the parameters to be optimized for the satellite constellation, the continuous coverage duration for the target area and the visibility duration of the target area to the satellite constellation can be determined. Through testing, it can be found that the constellation design method in this embodiment is more effective. For example, by comparison, the continuous coverage duration obtained by the constellation design method in this embodiment is much higher than that obtained by a certain related technical method, and the visibility duration is also improved.

[0086] It is understood that the various method embodiments mentioned above in this disclosure can be combined with each other to form combined embodiments without violating the principle and logic. Due to space limitations, this disclosure will not elaborate further. Those skilled in the art will understand that in the above methods of specific implementation, the specific execution order of each step should be determined by its function and possible internal logic.

[0087] In addition, this disclosure also provides constellation design apparatus, electronic devices, computer-readable storage media, and computer program products, all of which can be used to implement any of the constellation design methods provided in this disclosure. The corresponding technical solutions and descriptions are described in the corresponding descriptions in the method section and will not be repeated here.

[0088] Figure 3 A block diagram of a constellation design device provided in an embodiment of this disclosure.

[0089] Reference Figure 3 This disclosure provides a constellation design device, which includes:

[0090] The acquisition module 31 is used to acquire the value range of the parameters to be optimized for the satellite constellation of the target area;

[0091] The first determining module 32 is used to determine the duration of continuous coverage of the target area by the satellite constellation and the duration of visibility of the target area to the satellite constellation;

[0092] The second determining module 33 is used to optimize with the maximization of the continuous coverage duration and the visibility duration as the optimization objective, and to determine the target value of the parameter to be optimized based on the value range of the parameter to be optimized.

[0093] The module 34 is used to obtain a constellation design scheme for the target region based on the target value of the parameter to be optimized.

[0094] In one possible embodiment, optimization is performed with the maximization of the continuous coverage duration and the visibility duration as the optimization objective. When determining the target value of the parameter to be optimized based on its value range, the second determining module 33 is used to:

[0095] Obtain the current parent population for the current iteration, where the current parent population is the target population obtained in the previous iteration. The population represents a set consisting of multiple candidate values ​​that satisfy the range of values ​​of the parameter to be optimized.

[0096] Genetic operations are performed on the current parent population to generate the current offspring population corresponding to the current parent population, and the current parent population and the current offspring population are merged to obtain the current merged population;

[0097] Based on the multiple current candidate values ​​included in the current merged population, determine multiple current continuous coverage durations of the satellite constellation over the target area, and determine multiple current visibility durations of the target area for the satellite constellation;

[0098] Based on multiple current continuous coverage durations and multiple current visibility durations, a current target population that meets the conditions is selected from the current merged population, and the current target population is used as the parent population in the next iteration.

[0099] Based on the parent population of the next iteration, the next iteration is performed until the termination condition is met. Based on the parent population of the last iteration, the target value of the parameter to be optimized is determined.

[0100] In one possible embodiment, the number of satellite constellations is multiple, and when determining multiple current continuous coverage durations of the satellite constellations over the target area, the second determining module 32 is used to:

[0101] For any one of the multiple current candidate values, obtain the first continuous coverage duration of multiple satellite constellations over multiple target points in the target area during the statistical period;

[0102] The average of the multiple first continuous coverage durations is calculated to obtain the current continuous coverage duration of the multiple satellite constellations for the target area.

[0103] In one possible embodiment, the number of satellite constellations is multiple. When determining the target area for multiple currently visible durations of the satellite constellations, the second determining module 33 is used to:

[0104] For any one of the multiple current candidate values, obtain the number of times multiple target points in the target area are visible to multiple satellite constellations in the statistical period, and the first visible duration for each visible value;

[0105] The target area is obtained by summing up multiple first visible durations to obtain the current visible duration of the target area for multiple satellite constellations.

[0106] In one possible embodiment, when selecting a current target population that meets the criteria from the currently merged population based on a plurality of current continuous coverage durations and a plurality of current visibility durations, the second determining module 32 is used to:

[0107] Based on multiple current continuous coverage durations and multiple current visibility durations, a non-dominated sorting is performed to obtain multiple levels. The lower the level, the better the corresponding candidate value. The candidate value in each level is not dominated by other candidate values ​​in the same level. Domination means that the continuous coverage duration and visibility duration corresponding to a candidate value are not less than another candidate value, and at least one of the continuous coverage duration and visibility duration is greater than another candidate value.

[0108] For each of the aforementioned levels, calculate the crowding distance corresponding to each candidate value in that level;

[0109] Based on the multiple levels and the crowding distance corresponding to each candidate value in each level, the current target population is selected from the current merged population.

[0110] In one possible embodiment, when selecting the current target population from the current merged population based on multiple levels and the crowding distance corresponding to each candidate value in each level, the second determining module 33 is used to:

[0111] Candidate values ​​are obtained sequentially from low to high level until N candidate values ​​are selected. The selected N candidate values ​​constitute the current target population. The current parent population includes N candidate regions, where N is an integer greater than 1.

[0112] If the number of candidate values ​​added to the nth level exceeds N, then candidate values ​​that can reach N are selected sequentially according to the crowding level of the candidate values ​​in the nth level from largest to smallest, where n is an integer greater than 1.

[0113] Each module in the aforementioned constellation design device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the memory of a computer device as software, so that the processor can call and execute the corresponding operations of each module.

[0114] Figure 4 This is a block diagram of an electronic device provided in an embodiment of the present disclosure.

[0115] Reference Figure 4 This disclosure provides an electronic device comprising: at least one processor 401; at least one memory 402; and one or more I / O interfaces 403; wherein the memory 402 stores one or more computer programs executable by at least one processor 401, the one or more computer programs being executed by at least one processor 401 to enable at least one processor 401 to perform the constellation design method described above.

[0116] The modules in the aforementioned electronic devices can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in the processor of a computer device in hardware form or independent of it, or stored in the memory of a computer device in software form, so that the processor can call and execute the operations corresponding to each module.

[0117] This disclosure also provides a computer-readable storage medium storing a computer program thereon, wherein the computer program, when executed by a processor, implements the constellation design method described above. The computer-readable storage medium may be volatile or non-volatile.

[0118] This disclosure also provides a computer program product, including computer-readable code, or a non-volatile computer-readable storage medium carrying computer-readable code, wherein when the computer-readable code is run in a processor of an electronic device, the processor in the electronic device executes the above-described constellation design method.

[0119] Those skilled in the art will understand that all or some of the steps, systems, and apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit (ASIC). Such software can be distributed on a computer-readable storage medium, which may include computer storage media (or non-transitory media) and communication media (or transient media).

[0120] As is known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information, such as computer-readable program instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), static random access memory (SRAM), flash memory or other memory technologies, portable compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, it is known to those skilled in the art that communication media typically contain computer-readable program instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0121] The computer-readable program instructions described herein can be downloaded from computer-readable storage media to various computing / processing devices, or downloaded via a network, such as the Internet, local area network, wide area network, and / or wireless network, to an external computer or external storage device. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers, and / or edge servers. A network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards them to the computer-readable storage media in the respective computing / processing device.

[0122] Computer program instructions used to perform the operations of this disclosure may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Smalltalk, C++, etc., and conventional procedural programming languages ​​such as the "C" language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or may be connected to an external computer (e.g., via the Internet using an Internet service provider). In some embodiments, electronic circuitry, such as programmable logic circuitry, field-programmable gate arrays (FPGAs), or programmable logic arrays (PLAs), is personalized by utilizing the status information of the computer-readable program instructions to implement various aspects of this disclosure.

[0123] The computer program product described herein can be implemented specifically through hardware, software, or a combination thereof. In one alternative embodiment, the computer program product is specifically embodied in a computer storage medium; in another alternative embodiment, the computer program product is specifically embodied in a software product, such as a software development kit (SDK), etc.

[0124] Various aspects of this disclosure are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer-readable program instructions.

[0125] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that, when executed by the processor of the computer or other programmable data processing apparatus, they create means for implementing the functions / actions specified in one or more blocks of the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium that causes a computer, programmable data processing apparatus, and / or other device to operate in a particular manner; thus, the computer-readable medium storing the instructions comprises an article of manufacture that includes instructions for implementing aspects of the functions / actions specified in one or more blocks of the flowchart and / or block diagram.

[0126] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions executed on the computer, other programmable data processing apparatus, or other device to perform the functions / actions specified in one or more boxes of a flowchart and / or block diagram.

[0127] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of an instruction containing one or more executable instructions for implementing a specified logical function. In some alternative implementations, the functions marked in the blocks may occur in a different order than those shown in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, may be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0128] Example embodiments have been disclosed herein, and while specific terminology has been used, it is for illustrative purposes only and should be construed as such, and is not intended to be limiting. In some instances, it will be apparent to those skilled in the art that features, characteristics, and / or elements described in connection with particular embodiments may be used alone, or in combination with features, characteristics, and / or elements described in connection with other embodiments, unless otherwise expressly indicated. Therefore, those skilled in the art will understand that various changes in form and detail may be made without departing from the scope of this disclosure as set forth by the appended claims.

Claims

1. A constellation design method, characterized in that, include: Obtain the value range of the parameters to be optimized for the satellite constellation in the target area; Determine the duration of continuous coverage of the target area by the satellite constellation, and the duration of visibility of the target area to the satellite constellation; The optimization objective is to maximize the continuous coverage duration and the visibility duration. Based on the value range of the parameter to be optimized, the target value of the parameter to be optimized is determined. Based on the target values ​​of the parameters to be optimized, a constellation design scheme for the target region is obtained.

2. The method according to claim 1, characterized in that, The optimization objective is to maximize the continuous coverage duration and the visibility duration. Based on the value range of the parameter to be optimized, the target value of the parameter to be optimized is determined, including: Obtain the current parent population for the current iteration, where the current parent population is the target population obtained in the previous iteration. The population represents a set consisting of multiple candidate values ​​that satisfy the range of values ​​of the parameter to be optimized. Genetic operations are performed on the current parent population to generate the current offspring population corresponding to the current parent population, and the current parent population and the current offspring population are merged to obtain the current merged population; Based on the multiple current candidate values ​​included in the current merged population, determine multiple current continuous coverage durations of the satellite constellation over the target area, and determine multiple current visibility durations of the target area for the satellite constellation; Based on multiple current continuous coverage durations and multiple current visibility durations, a current target population that meets the conditions is selected from the current merged population, and the current target population is used as the parent population in the next iteration. Based on the parent population of the next iteration, the next iteration is performed until the termination condition is met. Based on the parent population of the last iteration, the target value of the parameter to be optimized is determined.

3. The method according to claim 2, characterized in that, The number of satellite constellations is multiple, and determining multiple current continuous coverage durations of the satellite constellations over the target area includes: For any one of the multiple current candidate values, obtain the first continuous coverage duration of multiple satellite constellations over multiple target points in the target area during the statistical period; The average of the multiple first continuous coverage durations is calculated to obtain the current continuous coverage duration of the multiple satellite constellations for the target area.

4. The method according to claim 2, characterized in that, The number of satellite constellations is multiple, and the target area is determined to have multiple current visibility durations for the satellite constellations, including: For any one of the multiple current candidate values, obtain the number of times multiple target points in the target area are visible to multiple satellite constellations in the statistical period, and the first visible duration for each visible value; The target area is obtained by summing up multiple first visible durations to obtain the current visible duration of the target area for multiple satellite constellations.

5. The method according to any one of claims 2-4, characterized in that, The step of selecting a current target population that meets the criteria from the current merged population based on multiple current continuous coverage durations and multiple current visibility durations includes: Based on multiple current continuous coverage durations and multiple current visibility durations, a non-dominated sorting is performed to obtain multiple levels. The lower the level, the better the corresponding candidate value. The candidate value in each level is not dominated by other candidate values ​​in the same level. Domination means that the continuous coverage duration and visibility duration corresponding to a candidate value are not less than another candidate value, and at least one of the continuous coverage duration and visibility duration is greater than another candidate value. For each of the aforementioned levels, calculate the crowding distance corresponding to each candidate value in that level; Based on the multiple levels and the crowding distance corresponding to each candidate value in each level, the current target population is selected from the current merged population.

6. The method according to claim 5, characterized in that, The step of selecting the current target population from the current merged population based on multiple levels and the crowding distance corresponding to each candidate value in each level includes: According to the hierarchical order from low to high, the candidate values ​​in each level are obtained in turn until N candidate values ​​are selected. The selected N candidate values ​​constitute the current target population. The current parent population includes N candidate regions, where N is an integer greater than 1. If the number of candidate values ​​added to the nth level exceeds N, then candidate values ​​that can reach N are selected sequentially according to the crowding level of the candidate values ​​in the nth level from largest to smallest, where n is an integer greater than 1.

7. A constellation design device, characterized in that, include: The acquisition module is used to obtain the value range of the parameters to be optimized for the satellite constellation of the target area; The first determining module is used to determine the duration of continuous coverage of the target area by the satellite constellation, and the duration of visibility of the target area to the satellite constellation; The second determining module is used to optimize with the maximization of the continuous coverage duration and the visibility duration as the optimization objective, and to determine the target value of the parameter to be optimized based on the value range of the parameter to be optimized. The acquisition module is used to obtain a constellation design scheme for the target region based on the target value of the parameter to be optimized.

8. An electronic device, characterized in that, include: At least one processor; as well as A memory communicatively connected to the at least one processor; wherein, The memory stores one or more computer programs that can be executed by the at least one processor, such that the at least one processor is able to perform the constellation design method as described in any one of claims 1-6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the constellation design method as described in any one of claims 1-6.

10. A computer program product, characterized in that, Includes computer-readable code, or a non-volatile computer-readable storage medium carrying computer-readable code, wherein when the computer-readable code is run in a processor of an electronic device, the processor in the electronic device performs the constellation design method as described in any one of claims 1-6.

Images