Walker constellation emission deployment design method
By decoupling the Walker constellation transmission deployment solution design and adopting an integer linear planning method, the problem of difficulty in finding the optimal transmission deployment solution in the prior art is solved, and an efficient decision-making process and an optimal transmission deployment solution are achieved.
Patent Information
- Application Number
- CN202411840742.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-13
- Publication Date
- 2025-03-11
AI Technical Summary
It is difficult for the prior art to find the optimal launch deployment solution for the Walker constellation under a variety of alternative rockets and multiple constraints, especially when the number of alternative rockets increases, and traditional enumeration methods are difficult to effectively accomplish this work.
By decoupling the design of the constellation emission deployment scheme into a single orbital optimal transmission deployment and a constellation optimal transmission deployment, and optimizing it using integer linear planning method, the optimal constellation emission deployment scheme is obtained.
It realizes finding the optimal constellation launch deployment solution under a variety of alternative rockets and multiple constraints, improves decision-making efficiency, avoids the exponential increase in the enumeration scale, and provides efficient computing means for the overall design of constellation engineering.
Smart Images
Figure CN119598769A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of launch vehicle mission design, and in particular to a launch deployment design method for a Walker constellation. Background Art
[0002] At present, satellite design is developing in two levels. For multi-functional satellites, the functions of single satellites are becoming more and more powerful, the weight and envelope of satellites are significantly enhanced, the weight of satellites is mostly tons, and the number of satellites and orbits are relatively single. For distributed constellations, the weight of satellites ranges from tens of kilograms to hundreds of kilograms. The advantages of distributed satellite constellations, such as robust system flexibility, high temporal resolution and spatial resolution, and relatively low single-satellite R&D costs, are becoming more and more obvious. At present, the main large-scale constellation designs include the Walker constellation design method proposed by JG Walker and the street of coverage (SOC) design method proposed by Ullock and Sciolion. The above methods are recognized in the world as analytical design methods for satellite constellations that achieve continuous global coverage of circular orbits. In constellation design, the Walker constellation is increasingly valued due to its concise expression and diversified constellation design. The configuration code of the Walker constellation is N / P / F:i,h, where the parameters represent the number of satellites in the constellation, the number of orbital planes, the phase factor, the orbital inclination and the orbital altitude.
[0003] Based on the experience of satellite launch and deployment this year, the launch and deployment of the Walker constellation often adopts the launch of dozens or even hundreds of satellites with one rocket as the main method, the launch of several satellites with one rocket as a supplement, and the launch of one satellite with one rocket as a backup method. In order to quickly realize large-scale constellation networking, mobilize the enthusiasm of launch vehicle companies to the greatest extent, and activate the vitality of the launch service market, the launch and deployment of the Walker constellation can be considered in the range of large / medium / small launch vehicles, national / civilian / commercial launch vehicles, etc., to form the optimal launch deployment plan. However, when different launch vehicles are used for launch and deployment, when the number of alternative launch vehicles increases, the feasible launch deployment plans will increase exponentially, and the previous launch deployment plan based on enumeration method is difficult to complete this task efficiently. In addition, if the upper limit of the carrying capacity of each type of rocket, the upper limit of the fairing envelope, the number of seats that can be provided for satellites, the rocket production capacity (or annual launch capacity), etc. are superimposed, the traditional enumeration method may be more difficult to obtain the optimal launch deployment plan. Summary of the invention
[0004] In view of the deficiencies in the above-mentioned prior art, the present invention provides a launch deployment design method for a Walker constellation. A launch deployment scheme based on integer linear programming is adopted for a large Walker constellation. The optimal launch deployment scheme of the Walker constellation can be obtained under a variety of alternative rockets and multiple constraints, which can provide a basis for the overall design, engineering implementation, construction and operation of the constellation.
[0005] To achieve the above object, the present invention provides a Walker constellation launch deployment design method, characterized in that the design of the constellation launch deployment scheme is decoupled into a single orbital plane optimal launch deployment and a constellation optimal launch deployment; In the single orbital plane optimal launch deployment phase, optimization is performed based on an integer linear programming method to obtain several single orbital plane optimal launch deployment schemes; In the constellation optimal launch deployment stage, optimization is performed based on the integer (0-1) linear programming method, and the single orbital plane optimal launch deployment plan obtained in the single orbital plane optimal launch deployment stage is distributed to all orbital planes and annual launch missions to obtain multiple single orbital plane optimal launch deployment plans.
[0006] In one embodiment, during the single orbital plane optimal launch deployment phase: The optimization goal is: Under the condition of meeting the launch deployment mission requirements of a single orbital plane, the sum of the launch costs of all launch vehicles selected for a single orbit is minimized; The optimization constraints include: the number of launch vehicles selected for a single orbit is not greater than the specified number; the number of satellite seats that can be provided by all launch vehicles is not less than the number of satellites on a single orbit; the sum of the carrying capacity that all launch vehicles can provide to satellites for the target orbit is not less than the sum of the weights of all satellites on a single orbital plane; The optimization variables are: the models and numbers of alternative launch vehicles participating in orbital launch deployment.
[0007] In one embodiment, the number of launch vehicles selected for the single track is not greater than a specified number, specifically: The number of launch vehicles selected for a single track is less than 3.
[0008] In one of the embodiments, during the constellation optimal transmission deployment phase: The optimization goal is: while meeting the launch and deployment mission requirements of the constellation, the sum of the launch costs of all launch vehicles selected by the constellation is minimized; The optimization constraints include: the annual number of selected launch vehicles of a single model shall not exceed the annual production capacity threshold of the model; the annual number of selected launch vehicles of a single model shall not exceed the remaining annual launch capacity of the model at the selected launch station; The optimization variables are: the selection and distribution of the preferred launch deployment scheme for the single orbital plane.
[0009] In one embodiment, the annual selected quantity of a single launch vehicle model is not greater than the annual production capacity threshold of the model: The annual number of launch vehicle models selected is less than 50% of the annual production capacity of that model.
[0010] In one embodiment, the annual selected quantity of a single launch vehicle model is not greater than the remaining annual launch capacity of the model at the selected launch station, specifically: The annual number of selected launch vehicle models of a single type is less than 50% of the annual launch capacity of the selected launch site.
[0011] In one embodiment, the launch cost of the carrier rocket is specifically: rocket ordering price + measurement and control service fee + propellant fee.
[0012] Compared with the prior art, the present invention has the following beneficial technical effects: 1. The present invention decouples the design of the constellation launch deployment plan into the optimal launch deployment of a single orbital plane and the optimal launch deployment of the constellation, and uses the integer linear programming method to seek the optimal solution to obtain the optimal constellation launch deployment plan. This method not only has high decision-making efficiency, but is also not affected by the increase in the number of alternative launch vehicles and the increase in the enumeration scale. It can provide an efficient calculation method for the overall design of the constellation project; 2. The present invention adopts an integer linear programming method to convert non-technical constraints such as the number of launch vehicles used in a single orbital plane, networking plan, annual launch capacity, etc. into inequality constraints, equality constraints, upper and lower limit constraints, etc. Compared with the existing enumeration method that converts non-technical constraints into subjective decision constraints for restriction, the present invention can be free from the interference of subjective will in the decision-making process and can obtain a more objective and more preferred solution. BRIEF DESCRIPTION OF THE DRAWINGS
[0013] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the structures shown in these drawings without paying creative work.
[0014] Figure 1 The figure is a flow chart of the Walker constellation transmission deployment design method in an embodiment of the present invention.
[0015] The realization of the purpose, functional features and advantages of the present invention will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION
[0016] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0017] In addition, the technical solutions between the various embodiments of the present invention can be combined with each other, but it must be based on the fact that ordinary technicians in the field can implement it. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such combination of technical solutions does not exist and is not within the scope of protection required by the present invention.
[0018] like Figure 1 The figure shows a Walker constellation launch deployment design method disclosed in this embodiment. According to the characteristics of the Walker constellation, the design of the constellation launch deployment plan is decoupled into two stages: the optimal launch deployment of a single orbital plane and the optimal launch deployment of the constellation. In the optimal launch deployment stage of a single orbital plane, optimization is performed based on the integer linear programming method to obtain multiple single orbital plane preferred launch deployment plans. For example, it is necessary to screen out the best N deployment plans in the optimal launch deployment stage of a single orbital plane as the output of the single orbital plane preferred launch deployment plan. In the constellation optimal launch deployment stage, optimization is performed based on the integer (0-1) linear programming method, and the single orbital plane preferred launch deployment plan obtained in the single orbital plane optimal launch deployment stage is distributed to all orbital planes and each annual launch mission to obtain the optimal constellation launch deployment plan.
[0019] The problem of the optimal launch deployment phase for a single orbital plane can be described as:
[0020] in, represents the optimization goal, Represents the coefficient column vector of each decision variable in the objective function, represents the transpose of a matrix, represents the decision variable, , The coefficient matrix representing the constraints, , The constant term representing the constraint condition, represents the lower limit of the decision variable, represents the upper limit of the decision variable; Optimization goal of optimal launch deployment on a single orbital plane That is: under the condition of meeting the launch deployment mission requirements of a single orbital plane, the sum of the launch costs of all carrier rockets selected for a single orbit is the smallest. In this embodiment, the launch cost of the carrier rocket is specifically: rocket ordering price + measurement and control service fee + propellant fee.
[0021] The optimization constraints for the optimal launch deployment phase of a single orbital plane include: 1. The number of launch vehicles selected for a single orbit is not greater than the specified number; 2. The number of satellite seats that can be provided by all launch vehicles is not less than the number of satellites on a single orbit; 3. The sum of the carrying capacity that all launch vehicles can provide to satellites for the target orbit is not less than the sum of the weights of all satellites on a single orbital plane. Specifically, the number of launch vehicles selected for a single orbit is not greater than the specified number: the number of launch vehicles selected for a single orbit is less than 3 types; the carrying capacity that the launch vehicle can provide to satellites for the target orbit does not include the weight of the satellite bracket and separation mechanism.
[0022] The optimization variables in the optimal launch deployment phase of a single orbital plane are: the models and numbers of alternative launch vehicles participating in orbital launch deployment.
[0023] In this embodiment, in the process of optimizing rocket selection and deployment schemes for multiple orbital planes during the optimal launch and deployment phase of the constellation, the integer linear programming method is also used. Unlike the integer linear programming for optimizing rocket selection and deployment methods for a single orbital plane, its optimization variable can only be 0 or 1, so it is a typical integer (0-1) linear programming. Therefore, the optimization goal of the optimal launch and deployment phase of the constellation is: the sum of the launch costs (rocket ordering price + measurement and control service fee + propellant fee) of all launch vehicles selected by the constellation is minimized while meeting the requirements of the constellation launch and deployment mission. The optimization constraints include: 1. The annual selection quantity of a single launch vehicle model is not greater than the annual production capacity threshold of the model; 2. The annual selection quantity of a single launch vehicle model is not greater than the remaining annual launch capacity of the model at the selected launch station. The optimization variables are: the selection and distribution of the optimal launch and deployment scheme for a single orbital plane. Among them, the annual selection quantity of a single launch vehicle model is not greater than the annual production capacity threshold of the model, specifically: the annual selection quantity of a single launch vehicle model is less than 50% of the annual production capacity of the model. The annual number of selected single launch vehicle models shall not be greater than the remaining annual launch capacity of the model at the selected launch position. Specifically, the annual number of selected single launch vehicle models shall be less than 50% of the annual launch capacity of the selected launch position.
[0024] The Walker constellation transmission deployment design method in this embodiment is further described below with reference to specific examples.
[0025] The configuration code of the Walker constellation in this example is 1000 / 10 / 1:50,1000, indicating that the total number of satellites in the Walker constellation is 1000, with 10 orbital planes, an orbital inclination of 50° and an orbital altitude of 1000km. The launch deployment of the constellation is further described as follows: no more than 3 types of launch vehicles are selected from the existing 8 types of launch vehicles to form a launch plan for an orbital plane, with a carrying capacity of no less than 10,000 kg for the total weight of 100 satellites in a single orbit, and the number of satellite seats that can be provided by all launch vehicles is no less than 100, and the launch cost is required to be minimized. In contrast to the method of this embodiment, the optimal launch deployment of a single orbital plane is first optimized. The basic conditions of these 8 types of launch vehicles are shown in Table 1.
[0026] Table 1--Basic information of Type 8 launch vehicles
[0027] By comparing the basic information of the 8 launch vehicles in Table 1, we can get the following parameterized description: First, the optimization goal is to minimize the launch cost of a single orbital plane, so we can conclude that:
[0028] Secondly, the combined carrying capacity of all types of rockets should not be less than 10,000 kg of the weight of all satellites on one orbital plane, the total number of satellite seats should not be less than 100, and the total number of launch vehicles should not be more than 3. Therefore, the coefficient matrix of the constraint conditions in the inequality constraint can be obtained. A With constant term b ,for:
[0029]
[0030] According to the constraints of the optimal launch deployment on a single orbital plane in the method of this embodiment, there is no need to consider the upper and lower limit constraints and equality constraints in the integer linear programming process. Therefore, by performing integer linear programming on the above mathematical model, the three better solutions shown in Table 2 can be obtained.
[0031] Table 2 - Optimal launch deployment plan for a single orbital plane
[0032] The optimal launch deployment in the constellation is equivalent to optimizing the three single orbital plane preferred launch deployment plans in Table 2 to 10 orbital planes and launch missions in each year according to the annual launch capabilities of various types of launch vehicles.
[0033] The constellation launch deployment problem is redefined as shown in Tables 3 and 4.
[0034] Table 3 - Optimization variable definitions
[0035] Table 4 - Launch capability constraints for Type 3 rockets
[0036] The constellation launch deployment is also equivalent to solving the following integer (01 programming) linear programming problem:
[0037] Comparing the situation in Table 2-4, we can get the following parameterized description: First, the optimal goal is to minimize the constellation launch cost, so we can conclude that:
[0038] Secondly, the number of launches of the three types of launch vehicles in each year should be less than the launch capacity constraint of that year, so the coefficient matrix of the constraint conditions in the inequality constraint can be obtained: A With constant term b ,for:
[0039]
[0040] Then, since only one launch mode can be selected for each orbital plane, the coefficient matrix of the constraint conditions in the equality constraint can be obtained: Aeq With constant term beq ,for:
[0041]
[0042] Finally, since 0-1 planning is used, the optimization variable can only be assigned 0 or 1, so the upper and lower limits of the decision variables are:
[0043]
[0044] The optimal constellation launch deployment plan finally calculated is shown in Table 5.
[0045] Table 5 - Optimal Constellation Launch Deployment Plan
[0046] The above description is only a preferred embodiment of the present invention, and does not limit the patent scope of the present invention. All equivalent structural changes made by using the contents of the present invention specification and drawings under the inventive concept of the present invention, or directly / indirectly applied in other related technical fields are included in the patent protection scope of the present invention.
Claims
1. A Walker constellation launch deployment design method, characterized in that: Decouple the design of the constellation launch deployment plan into the optimal launch deployment for a single orbital plane and the optimal launch deployment for the constellation; In the single orbital plane optimal launch deployment phase, optimization is performed based on an integer linear programming method to obtain multiple single orbital plane optimal launch deployment schemes; In the constellation optimal launch deployment stage, optimization is performed based on the 0-1 integer linear programming method, and the single orbital plane preferred launch deployment plan obtained in the single orbital plane optimal launch deployment stage is distributed to all orbital planes and annual launch missions to obtain the optimal constellation launch deployment plan.
2. The Walker constellation launch deployment design method according to claim 1, characterized in that: In the optimal launch deployment phase of the single orbital plane: The optimization goal is: Under the condition of meeting the launch deployment mission requirements of a single orbital plane, the sum of the launch costs of all launch vehicles selected for a single orbit is minimized; The optimization constraints include: the number of launch vehicles selected for a single orbit is not greater than the specified number; the number of satellite seats that can be provided by all launch vehicles is not less than the number of satellites on a single orbit; the sum of the carrying capacity that all launch vehicles can provide to satellites for the target orbit is not less than the sum of the weights of all satellites on a single orbital plane; The optimization variables are: the models and numbers of alternative launch vehicles participating in orbital launch deployment.
3. The Walker constellation launch deployment design method according to claim 2, characterized in that: The number of launch vehicles selected for the single track shall not exceed the specified number, specifically: The number of launch vehicles selected for a single track is less than 3.
4. The Walker constellation launch deployment design method according to claim 1, characterized in that: During the optimal launch deployment phase of the constellation: The optimization goal is: while meeting the launch and deployment mission requirements of the constellation, the sum of the launch costs of all launch vehicles selected by the constellation is minimized; The optimization constraints include: the annual number of selected launch vehicles of a single model shall not exceed the annual production capacity threshold of the model; the annual number of selected launch vehicles of a single model shall not exceed the remaining annual launch capacity of the model at the selected launch station; The optimization variables are: the selection and distribution of the preferred launch deployment scheme for the single orbital plane.
5. The Walker constellation launch deployment design method according to claim 4, characterized in that: The annual number of selected launch vehicles of a single model shall not exceed the annual production capacity threshold of the model: The annual number of launch vehicle models selected is less than 50% of the annual production capacity of that model.
6. The Walker constellation launch deployment design method according to claim 4, characterized in that: The annual number of selected launch vehicles of a single launch vehicle model shall not exceed the remaining annual launch capacity of the model at the selected launch station, specifically: The annual number of selected launch vehicle models of a single type is less than 50% of the annual launch capacity of the selected launch site.
7. The Walker constellation transmission deployment design method according to any one of claims 2 to 6, characterized in that: The launch cost of the carrier rocket is specifically: rocket ordering price + measurement and control service fee + propellant fee.