CN114996841B - Optimal coplanarity transfer search method based on tangent initial value - Google Patents

Optimal coplanarity transfer search method based on tangent initial value Download PDF

Info

Publication number
CN114996841B
CN114996841B CN202210581517.9A CN202210581517A CN114996841B CN 114996841 B CN114996841 B CN 114996841B CN 202210581517 A CN202210581517 A CN 202210581517A CN 114996841 B CN114996841 B CN 114996841B
Authority
CN
China
Prior art keywords
pulse
theta
initial
fuel
optimal
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
CN202210581517.9A
Other languages
Chinese (zh)
Other versions
CN114996841A (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.)
Harbin Institute of Technology
Original Assignee
Harbin Institute of Technology
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 Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN202210581517.9A priority Critical patent/CN114996841B/en
Publication of CN114996841A publication Critical patent/CN114996841A/en
Application granted granted Critical
Publication of CN114996841B publication Critical patent/CN114996841B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • G06F30/27Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/12Computing arrangements based on biological models using genetic models
    • G06N3/126Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00Details relating to CAD techniques
    • G06F2111/10Numerical modelling
    • 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
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T90/00Enabling technologies or technologies with a potential or indirect contribution to GHG emissions mitigation

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Geometry (AREA)
  • General Physics & Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • Biophysics (AREA)
  • General Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Evolutionary Biology (AREA)
  • Artificial Intelligence (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • Mathematical Optimization (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Physiology (AREA)
  • Genetics & Genomics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Biomedical Technology (AREA)
  • Computational Linguistics (AREA)
  • Pure & Applied Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Automation & Control Theory (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Medical Informatics (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

The invention discloses an optimal coplanarity transfer search method based on a tangent initial value, and relates to an optimal coplanarity transfer search method based on a tangent initial value. The invention aims to solve the problems that the existing method is limited by optimization variables, has long calculation time and low solving efficiency and is difficult to meet the large-scale track transfer requirement. The process is as follows: 1. completing initial condition setting of pulse optimization; 2. limiting the thrust direction in the velocity tangent direction, setting an optimization index as the optimal fuel, and performing global search on 2n-3 variables needing to be optimized for the optimal solution of the tangential impulse fuel by utilizing a genetic algorithm to obtain the optimal solution of the global fuel under the condition of the tangential impulse; 3. completing initialization of the fmincon algorithm; 4. and limiting the pulse direction in a track plane, setting an optimization index as the optimal fuel, and carrying out local optimization on 3n-4 optimization variables by using an fmincon algorithm to obtain the optimal local fuel solution. The invention is used in the field of spacecraft orbit transfer.

Description

Optimal coplanarity transfer search method based on tangent initial value
Technical Field
The invention relates to an optimal coplanarity transfer search method based on a tangent initial value.
Background
The orbital dynamics of a spacecraft is the fundamental science of aerospace engineering. The orbit design of the spacecraft is the key for ensuring the smooth execution of the working task of the spacecraft. Since the time that mankind entered space, the theory of orbit design developed rapidly, and relevant methods and techniques were verified by a large number of practical projects. The orbit transfer is a basic problem of orbit design, and means that a spacecraft is actively transferred from an original orbit to a target orbit through a maneuvering process, and design indexes such as fuel consumption, transfer time, control accuracy and the like are generally considered.
At present, the number of on-orbit satellites is increasing, and the requirement of orbit design for task transfer is increasing. This puts higher demands on the solution efficiency of the transfer task. When solving the fuel optimal transfer orbit, a global optimal pulse transfer scheme is usually obtained through a global search algorithm such as a genetic algorithm according to the number of pulses required by a task. However, the traditional method is limited by the optimization variables (3 n-4 optimization variables), has long calculation time and low solving efficiency, and is difficult to meet the large-scale track transfer requirement.
Disclosure of Invention
The invention aims to provide an optimal coplanar transfer search method based on tangent initial values, which aims to solve the problems that the existing method is limited by optimization variables (3 n-4 optimization variables), the calculation time is long, the solving efficiency is low, and the large-scale track transfer requirements are difficult to deal with.
The optimal coplanarity transfer search method based on the tangent initial value comprises the following specific processes:
step one, finishing initial condition setting of pulse optimization:
setting iteration times and population quantity parameters of a genetic algorithm according to initial orbit parameters, target orbit parameters and pulse number n required by a task of the spacecraft;
step two, solving a tangent pulse global optimal solution by a genetic algorithm:
based on the first step, limiting the thrust direction in the speed tangent direction, setting an optimization index as the optimal fuel, and performing global search on 2n-3 variables needing to be optimized for the optimal solution of the tangent pulse fuel by utilizing a genetic algorithm to obtain the optimal solution of the global fuel under the tangent pulse condition;
step three, finishing initialization of the fmincon algorithm:
setting the radial value of the global optimal solution under the tangent pulse condition obtained by the genetic algorithm to 0, and substituting the radial value into the fmincon algorithm as an initial guess;
step four, solving the local optimal solution of the free direction pulse by using an fmincon algorithm:
and (3) limiting the pulse direction in the track plane according to the initial conditions given in the step one, setting an optimization index as the optimal fuel, and carrying out local optimization on 3n-4 optimization variables by using an fmincon algorithm to obtain the optimal local fuel solution under the pulse condition in the free direction.
The invention has the beneficial effects that:
the invention provides a coplanar orbit transfer fuel optimal fast search algorithm based on tangent pulse initial guess. The tangential pulse is a pulse with the thrust direction and the speed direction collinear, and has the characteristics of easiness in realization, high safety, convenience in solution and approximately optimal energy in engineering, and the tangential direction is the thrust direction with the fastest energy for changing the track. The algorithm effectively improves the calculation efficiency by searching the global optimal solution of the tangent pulse and utilizing the characteristics of less optimization variables (2 n-3 optimization variables) of the tangent pulse and approximate optimal fuel, and takes the solution as the initial guess of the local optimization algorithm to obtain the final solution by adopting the local optimization algorithm, thereby ensuring the optimal fuel and saving the calculation time.
In the invention, the pulse is directly limited to be the tangent pulse, so that the optimization variables are reduced, the global optimal solution under the tangent condition is obtained, the solution is taken as the initial guess of the local optimization algorithm, and the final solution is obtained by adopting the local optimization algorithm. The algorithm utilizes the characteristic of less optimization variables of the tangent pulse, effectively improves the calculation efficiency, can be converged to the same group of fuel optimal solution with the original free pulse global search method, saves the calculation time, and can be used for any number of pulses.
Drawings
FIG. 1 is a flow chart of a coplanar orbit transfer fuel optimum search algorithm based on tangent initial values;
FIG. 2 is a flow chart illustrating a conventional method for solving coplanar rail transfer fuel optimality;
FIG. 3 is a schematic view of a track transfer process;
FIG. 4 is a two pulse fuel comparison plot;
FIG. 5 is a three pulse fuel comparison plot.
Detailed Description
The first embodiment is as follows: the optimal coplanarity transfer search method based on the tangent initial value in the embodiment comprises the following specific processes:
step one, finishing initial condition setting of pulse optimization:
setting parameters such as iteration times, population quantity and the like of a genetic algorithm according to initial orbit parameters of the spacecraft, target orbit parameters and pulse number n required by a task;
step two, solving a tangent pulse global optimal solution by a genetic algorithm:
based on the first step, limiting the thrust direction in the speed tangent direction, setting an optimization index as the optimal fuel, and performing global search on 2n-3 variables needing to be optimized for the optimal solution of the tangent pulse fuel by utilizing a genetic algorithm to obtain the optimal solution of the global fuel under the tangent pulse condition;
step three, completing initialization of the fmincon algorithm:
according to initial conditions such as pulse number and the like, parameters such as the maximum iteration times and the convergence error limit of the fmincon algorithm are reasonably set so as to ensure that the convergence precision reaches the simulation requirement, the radial value of each pulse of the global optimal solution obtained by the genetic algorithm under the tangent pulse condition is set to be 0, and then the radial value is substituted into the fmincon algorithm to serve as an initial guess; the maximum iteration times of the fmincon algorithm can be increased, and a convergence condition is reasonably set to obtain an optimal solution meeting the convergence condition;
step four, solving the local optimal solution of the free direction pulse by using an fmincon algorithm:
and (2) limiting the pulse direction in the rail plane according to the initial conditions given in the step one, setting optimization indexes as fuel optimization, and carrying out local optimization on 3n-4 optimization variables by using an fmincon algorithm to obtain a local fuel optimal solution under the pulse condition in the free direction.
The second embodiment is as follows: the difference between this embodiment and the first embodiment is that the initial condition setting for completing the pulse optimization in the first step is as follows:
setting parameters such as iteration times, population quantity and the like of a genetic algorithm according to initial orbit parameters, target orbit parameters and pulse number n required by a task of the spacecraft;
the specific process is as follows:
the orbit parameters of the spacecraft at the initial moment are given under a J2000 geocentric inertial coordinate system, and the initial orbit parameters of the spacecraft comprise: semi-major axis a 0 Eccentricity e 0 Track inclination i 0 The right ascension channel omega 0 Angle distance omega from the proximal point 0
The target orbit parameters include: semi-major axis a f Eccentricity of the rotore f Track inclination i f And the right ascension omega f Angle distance omega from the near center point f (ii) a Where the orbital inclination and ascent intersection declination should be the same as for the spacecraft at the initial moment, i 0 =i f ,Ω 0 =Ω f Namely, the initial orbit and the target orbit of the spacecraft meet the coplanar condition;
when the initial orbit and the target orbit eccentricity is larger in the initial condition, the situation that the difference between the global optimal solution of the tangent pulse and the global optimal solution of the free direction pulse is larger occurs, namely the pulse is applied to the global optimal solution of the tangent pulse and is not close to the pulse applied to the global optimal solution of the direction free pulse, and a local optimal solution can be obtained by using the method provided by the invention with a certain possibility; the population number and the iteration times of the genetic algorithm are reasonably set to ensure the convergence and the convergence speed;
the dynamic models adopted in the whole process of the invention are two-body models, namely perturbation factors such as earth non-spherical perturbation, sunlight pressure, atmospheric resistance and the like are not considered;
Figure BDA0003664022940000031
Figure BDA0003664022940000032
mu represents the gravity constant of the earth, r and v represent the position vector and the velocity vector of the spacecraft under the J2000 geocentric inertial coordinate system respectively, and | r | represents the magnitude of the corresponding position vector;
Figure BDA0003664022940000033
denotes the first derivative of r,. Sup.>
Figure BDA0003664022940000034
The first derivative of v is indicated.
Other steps and parameters are the same as those in the first embodiment.
The third concrete implementation mode: the difference between the present embodiment and the first or second embodiment is that, in the second step, the genetic algorithm solves the tangent pulse global fuel optimal solution:
based on the first step, limiting the thrust direction in the tangential direction, setting an optimization index as the optimal fuel, and performing global search on 2n-3 variables needing to be optimized for the optimal solution of the tangential impulse fuel by utilizing a genetic algorithm to obtain the optimal solution of the global fuel under the condition of the tangential impulse;
the specific process is as follows:
in step two, the calculation and optimization process of the fuel consumption is as follows:
step two, assuming that the pulse number is n, the number of state variables needing to be optimized for obtaining the fuel optimal solution is at least 2n-3, and selecting the state variable to be optimized as X = [ theta ] = 12 ,...,θ n-1 ,Δv 1 ,Δv 2 ,...,Δv n-2 ];
Wherein, theta i The included angle between the position of the spacecraft and the rise point of the initial orbit in the radial direction OX is shown in the ith pulse, and the value range is [0,2 pi ]];Δv i For the size of the ith pulse, considering the speed of the elliptic orbit of the earth satellite, the pulse is not necessarily too large, and the value range is set to be [ -10,10 [)]The direction same as the original speed direction is taken as positive, and the unit is km/s;
step two, according to the initial orbit parameter [ a ] 0 ,e 0 ,i 000 ]And the state variables to be optimized can be subjected to orbit recursion, and by taking the first pulse process as an example, the orbit recursion process is represented as follows:
from initial orbit parameters and theta 1 It can be obtained that the spacecraft is at theta before the first pulse is applied 1 Six number of tracks [ a ] 1 ,e 1 ,i 111 ,f 1 ]Wherein the first five orbital parameters are the same as the initial orbital parameters, i.e. satisfy a 1 =a 0 、e 1 =e 0 、i 1 =i 0 、Ω 1 =Ω 0 、ω 1 =ω 0 True proximal angle f 1 =θ 11 (ii) a Tong (Chinese character of 'tong')Over at theta 1 Six tracks before applying pulse and pulse size Deltav 1 Solving for theta after the first applied pulse 1 Six number of tracks [ a ] 1 ′,e 1 ′,i 1 ′,Ω 1 ′,ω 1 ′,f 1 ′];
Step two and step three, the first five items of six track numbers are known easily, namely a 1 ′=a 2 、e 1 ′=e 2 、i 1 ′=i 2 、Ω 1 ′=Ω 2 、ω 1 ′=ω 2 (ii) a Through theta 2 Can find f 2 =θ 22 (ii) a From which the second pulse av can be applied 2 Six number of front track [ a ] 2 ,e 2 ,i 222 ,f 2 ]By passing at theta 2 Six number of tracks and pulse Δ v before applying pulse 2 Solving for second applied pulse at θ 2 Six number of tracks [ a ] 2 ′,e 2 ′,i 2 ′,Ω 2 ′,ω 2 ′,f 2 ′];
The orbit recursion is carried out in this manner until a value at θ is obtained n-2 To apply a pulse Δ v n-2 Rear orbital parameter [ a ] n-2 ′,e n-2 ′,i n-2 ′,Ω n-2 ′,ω n-2 ′,f n-2 ′]By knowing the orbital parameters of the target orbit [ a ] f ,e f ,i fff ]And theta in the state variable to be optimized n-1 The magnitude Deltav of the last two tangent pulses can be obtained by the existing method n-1 ,Δv n
Therefore, the total number of state variables to be optimized in the whole solving process is 2n-3, namely, by optimizing X = [ theta ]) 12 ,...,θ n-1 ,Δv 1 ,Δv 2 ,...,Δv n-2 ]The optimal fuel transfer orbit under the tangent pulse condition can be obtained through solving; and (3) carrying out global search on 2n-3 variables needing to be optimized for obtaining the fuel optimal transfer orbit under the tangent pulse condition through a genetic algorithm to obtain a global fuel optimal solution under the tangent pulse condition.
Other steps and parameters are the same as those in the first or second embodiment.
The fourth concrete implementation mode: the difference between this embodiment and the first to the third embodiment is that the second step is based on the initial orbit parameter [ a ] 0 ,e 0 ,i 000 ]And the state variable to be optimized can be subjected to orbit recursion, and by taking the first pulse process as an example, the orbit recursion process is represented as follows:
from initial orbit parameters and theta 1 It can be obtained that the spacecraft is at theta before the first pulse is applied 1 Six number of tracks [ a ] 1 ,e 1 ,i 111 ,f 1 ]Wherein the first five orbital parameters are the same as the initial orbital parameters, i.e. satisfy a 1 =a 0 、e 1 =e 0 、i 1 =i 0 、Ω 1 =Ω 0 、ω 1 =ω 0 True proximal angle f 1 =θ 11 (ii) a By passing at theta 1 Six tracks before pulse application and pulse size Δ v 1 Solving for theta after the first applied pulse 1 Six number of tracks [ a ] 1 ′,e 1 ′,i 1 ′,Ω 1 ′,ω 1 ′,f 1 ′];
The specific process is as follows:
position and velocity vectors r of the spacecraft on the first pulse application 1 ,v 1 ]Can be expressed as
Figure BDA0003664022940000051
r 1 =C 31 )C 1 (i 1 )C 31 )[|r 1 |sinf 1 ;|r 1 |cosf 1 ;0]
Figure BDA0003664022940000052
In the formula, C 1 、C 3 Representing a rotation matrix of the form:
Figure BDA0003664022940000053
wherein α represents Ω 1 、i 1 Or ω 1
At theta 1 To apply a pulse Δ v 1 Then, the position vector is not changed, the speed vector is changed, and the position vector and the speed vector [ r ] of the spacecraft are changed at the moment 1 ′,v 1 ′]Can be expressed as
r 1 ′=r 1
Figure BDA0003664022940000054
So that the position and velocity vector r after the pulse is applied can be used 1 ′,v 1 Solving at θ 1 Where a pulse Δ v is applied 1 Six number of rear tracks [ a ] 1 ′,e 1 ′,i 1 ′,Ω 1 ′,ω 1 ′,f 1 ′]。
Other steps and parameters are the same as those in one of the first to third embodiments.
The fifth concrete implementation mode is as follows: the difference between this embodiment and one of the first to fourth embodiments is that in the third step, it is easy to know that a is a for the first five items of six tracks 1 ′=a 2 、e 1 ′=e 2 、i 1 ′=i 2 、Ω 1 ′=Ω 2 、ω 1 ′=ω 2 (ii) a Through theta 2 Can find f 2 =θ 22 (ii) a From which the second pulse av can be applied 2 Six number of front track [ a ] 2 ,e 2 ,i 222 ,f 2 ]By passing at theta 2 Six number of tracks and pulse Δ v before applying pulse 2 Solving for second applied pulse at θ 2 Six rails ofNumber [ a ] 2 ′,e 2 ′,i 2 ′,Ω 2 ′,ω 2 ′,f 2 ′];
The orbit recursion is carried out in this way until the value obtained is theta n-2 Where a pulse Δ v is applied n-2 Rear orbital parameter [ a ] n-2 ′,e n-2 ′,i n-2 ′,Ω n-2 ′,ω n-2 ′,f n-2 ′]By knowing the orbit parameters of the target orbit [ a ] f ,e f ,i fff ]And theta in the state variable to be optimized n-1 The magnitude Deltav of the last two tangent pulses can be obtained by the existing method n-1 ,Δv n
The process is as follows:
Figure BDA0003664022940000061
θ=θ nn-1
in which theta represents theta n Angle of included angle and theta n-1 The difference of the included angles; λ represents an intermediate variable;
the relationship between the flight direction angle gamma and the true approach point angle can be used to obtain
Figure BDA0003664022940000062
Figure BDA0003664022940000063
Figure BDA0003664022940000064
In the formula of gamma j Indicates the application of the jth pulse Deltav j Front flight direction angle, | r j L denotes the application of the jth pulse Δ v j Position vector magnitude of time, p j Representing the half-diameter of the track;
multiplication of both sides by p n sinθ,
Figure BDA0003664022940000071
Can be obtained by finishing
Figure BDA0003664022940000072
Order to
Figure BDA0003664022940000073
Then->
Figure BDA0003664022940000074
In the formula k 1 、k 2 The intermediate variable is represented by a number of variables,
Figure BDA0003664022940000075
representing an intermediate variable;
the transfer orbit half-diameter and the angular momentum in the process are respectively
Figure BDA0003664022940000076
Figure BDA0003664022940000077
The magnitude Deltav of the last two pulses can thus be determined n-1 ,Δv n
Figure BDA0003664022940000078
Figure BDA0003664022940000079
The total fuel consumption can be expressed as
Figure BDA00036640229400000710
Other steps and parameters are the same as in one of the first to fourth embodiments.
The sixth specific implementation mode: the difference between this embodiment and one of the first to fifth embodiments is that the fmincon algorithm in step four solves the local fuel optimum solution of the free direction pulse:
limiting the pulse direction in a rail plane according to the initial conditions given in the step one, setting optimization indexes as fuel optimization, and carrying out local optimization on 3n-4 optimization variables by using an fmincon algorithm to obtain a local fuel optimal solution under the pulse condition in the free direction;
in step four, when the pulse directions are all pulses in free directions, the calculation and optimization process of the fuel consumption is as follows:
assuming that the pulse number is n, the number of the state variables to be optimized required for obtaining the optimal solution is at least 3n-4, and the state variable is selected to be X = [ theta ] = 12 ,...,θ n ,Δv i1 ,Δv i2 ,...,Δv i(n-2) ,Δv j1 ,Δv j2 ,...,Δv j(n-2) ]Wherein, theta k The included angle between the position of the spacecraft and the rise point radial direction OX of the initial orbit at the kth pulse is represented, and the value range is [0,2 pi ]];Δv ik Is the radial component of the kth pulse and has the value range of [ -10],Δv jk Is the size of the circumferential component of the kth pulse and has the value range of [ -10,10,]the direction same as the original speed direction is taken as positive, and the unit is km/s;
similar to the tangential orbit recursion process, taking the first pulse process as an example, the initial orbit parameter and θ can be used 1 ,Δv i1 ,Δv j1 Recursion is carried out to obtain a position velocity vector r after pulse is applied 1 ′,v 1 ' to find out six tracks after pulse application, and then passing through theta 2 To obtain f 2 By passing at theta 2 Six tracks before applying pulse andpulse Δ v i2 ,Δv j2 Solving for second applied pulse at θ 2 Six number of tracks [ a ] 2 ′,e 2 ′,i 2 ′,Ω 2 ′,ω 2 ′,f 2 ′]Then the next step of track recursion can be carried out;
finally, solving to obtain six tracks after the pulse is applied for the (n-2) th time, knowing the track parameters of the target track, and considering the variable theta to be optimized n-1 ,θ n The problem is converted into the traditional optimal double-pulse transfer problem, and the optimal double-pulse transfer can be used for obtaining delta v i(n-1) ,Δv j(n-1) ,Δv in ,Δv jn So that the whole process requires 3n-4 state variables to be optimized, i.e. the total fuel consumption of the whole transfer process can be obtained
Figure BDA0003664022940000081
Other steps and parameters are the same as those in one of the first to fifth embodiments.
The following examples were used to demonstrate the beneficial effects of the present invention:
the first embodiment is as follows:
two-pulse example
The following is a set of two-pulse specific examples, the orbit parameters of which are shown in table 1:
TABLE 1 orbital parameters of example one
Figure BDA0003664022940000082
The genetic algorithm sets PopulationSize to 150 and the generations to 100. The fmincon algorithm sets maxfenevals to 6000, maxter to 5000, and tolcon to 1e-6.
The simulation results are shown in table 2:
table 2 example-simulation results
Figure BDA0003664022940000083
Therefore, the method of the invention and the traditional method converge to the same group of solutions and have great advantages in computational efficiency.
Three pulse example
The following is a specific example of a set of three pulses, the orbit parameters of which are shown in table 3:
TABLE 3 orbital parameters of example two
Figure BDA0003664022940000091
The parameter settings of the algorithm are the same as in the first example. The simulation results are shown in table 4:
TABLE 4 simulation results of example two
Figure BDA0003664022940000092
Therefore, the method of the invention and the traditional method converge to the same group of solutions and have great advantages in computational efficiency.
Overall effect of the method
A large number of examples were simulated for reliable conclusions:
the initial track near-location height is a random number of 300-2000 km, the target track near-location height is 0.3-3 times of the initial track near-location height, and the multiple is the random number. Initial orbital eccentricity e 0 Target orbit eccentricity e f Is a random number from 0 to 1. Omega 0 、ω f Is a random number of 0-2 pi. The random numbers are uniformly distributed, 600 groups of two pulses are used for simulation, and 250 groups of three pulses are used for simulation. The parameter settings of the algorithm are as above.
The resulting comparison of the conventional method to the calculation time is shown in table 5.
TABLE 5 calculation time comparison Table
Figure BDA0003664022940000093
The fuel optimum solution obtained by the method used in the present invention was compared with the fuel of the fuel optimum solution obtained by the conventional method, and the comparison results are shown in fig. 4 and 5. The percentage of the legend is the percentage of fuel consumed by the method compared with the traditional method, and because the fuel consumed by mutual transfer between two rails is the same, the drawing is convenient, and the default is e 0 Is less than e f . The height of the vertical axis represents the coincidence of e 0 、e f Number of classified simulation groups.
From the results of fig. 4 and 5, it can be seen that the fuel index obtained by the method of the present invention and the conventional method have almost no difference in the case of a small eccentricity. The method used in the present invention is universal, as earth orbiting satellites generally do not design large eccentricity orbits.
As can be seen, a great number of examples show that the method provided by the invention can be converged to the same group of solutions as the traditional method, and has the advantage of 1-2 orders of magnitude in calculation time.
The present invention is capable of other embodiments and its several details are capable of modifications in various obvious respects, all without departing from the spirit and scope of the present invention.

Claims (5)

1. An optimal coplanarity transfer search method based on tangent initial values is characterized in that: the method comprises the following specific processes:
step one, finishing initial condition setting of pulse optimization:
setting iteration times and population quantity parameters of a genetic algorithm according to initial orbit parameters, target orbit parameters and pulse number n required by a task of the spacecraft;
step two, solving a tangent pulse global optimal solution by a genetic algorithm:
based on the first step, the thrust direction is limited in the speed tangential direction, optimization indexes are set as fuel optimum, 2n-3 variables needing to be optimized for the tangential pulse fuel optimum solution are searched globally by utilizing a genetic algorithm, and the global fuel optimum solution under the tangential pulse condition is obtained;
step three, completing initialization of the fmincon algorithm:
setting the radial value of the global optimal solution under the tangent pulse condition obtained by the genetic algorithm to 0, and substituting the radial value into the fmincon algorithm as an initial guess;
step four, solving the local optimal solution of the free direction pulse by using an fmincon algorithm:
limiting the pulse direction in the plane of the track according to the initial conditions given in the step one, setting optimization indexes as fuel optimization, and carrying out local optimization on 3n-4 optimization variables by using an fmincon algorithm to obtain a local fuel optimal solution under the pulse condition in the free direction;
solving the local fuel optimal solution of the free direction pulse by using an fmincon algorithm in the fourth step:
limiting the pulse direction in the plane of the track according to the initial conditions given in the step one, setting optimization indexes as fuel optimization, and carrying out local optimization on 3n-4 optimization variables by using an fmincon algorithm to obtain a local fuel optimal solution under the pulse condition in the free direction; the process is as follows:
assuming that the number of pulses is n, the state variable is selected to be X = [ theta ] 12 ,...,θ n ,Δv i1 ,Δv i2 ,...,Δv i(n-2) ,Δv j1 ,Δv j2 ,...,Δv j(n-2) ]Wherein, θ k The included angle between the position of the spacecraft and the rise point radial direction OX of the initial orbit at the kth pulse is represented, and the value range is [0,2 pi ]];Δv ik Is the radial component of the kth pulse and has the value range of [ -10],Δv jk Is the size of the circumferential component of the kth pulse and has the value range of [ -10,10,]the direction same as the original speed direction is taken as positive, and the unit is km/s;
by initial orbit parameter and theta 1 ,Δv i1 ,Δv j1 Recursion is carried out to obtain a position velocity vector r after pulse is applied 1 ′,v 1 ' to find out six tracks after pulse application, and then passing through theta 2 To obtain f 2 Disclosure of the inventionOver at theta 2 Six number of tracks and pulse Δ v before applying pulse i2 ,Δv j2 Solving for second applied pulse at θ 2 Six number of tracks [ a ] 2 ′,e 2 ′,i 2 ′,Ω 2 ′,ω 2 ′,f 2 ′];
Finally, solving to obtain six tracks after the pulse is applied for the (n-2) th time, knowing the track parameters of the target track, and considering the variable theta to be optimized n-1 ,θ n Obtaining Δ v using optimal dipulse transfer i(n-1) ,Δv j(n-1) ,Δv in ,Δv jn So that the whole process requires 3n-4 state variables to be optimized, i.e. the total fuel consumption of the whole transfer process can be obtained
Figure FDA0003988357860000021
2. The optimal coplanar transition search method based on the tangent initial value as claimed in claim 1, wherein: the initial condition setting for completing the pulse optimization in the first step is as follows:
setting iteration times and population quantity parameters of a genetic algorithm according to initial orbit parameters, target orbit parameters and pulse number n required by a task of the spacecraft; the specific process is as follows:
the orbit parameters of the spacecraft at the initial moment are given under a J2000 geocentric inertial coordinate system, and the initial orbit parameters of the spacecraft comprise: semi-major axis a 0 Eccentricity e 0 Track inclination i 0 The right ascension channel omega 0 Angle distance omega from the proximal point 0
The target orbit parameters include: semi-major axis a f Eccentricity e f Track inclination i f And the right ascension omega f Angle distance omega from the proximal point f (ii) a Where the orbital inclination and ascent intersection declination should be the same as for the spacecraft at the initial moment, i 0 =i f ,Ω 0 =Ω f I.e. the initial orbit of the spacecraft is full of the target orbitA foot coplanarity condition;
the adopted dynamic model is a two-body model, namely factors such as earth non-spherical perturbation, sunlight pressure and atmospheric resistance perturbation are not considered;
Figure FDA0003988357860000022
Figure FDA0003988357860000023
wherein mu represents the gravitational constant of the earth, r and v represent the position vector and the velocity vector of the spacecraft under the J2000 geocentric inertial coordinate system, and | r | represents the size of the position vector;
Figure FDA0003988357860000024
denotes the first derivative of r,. Sup.>
Figure FDA0003988357860000025
Representing the first derivative of v.
3. The optimal coplanar transition search method based on tangent initial value as claimed in claim 2, wherein: solving the tangent pulse global fuel optimal solution by the genetic algorithm in the step two:
based on the first step, limiting the thrust direction in the tangential direction, setting an optimization index as the optimal fuel, and performing global search on 2n-3 variables needing to be optimized for the optimal solution of the tangential impulse fuel by utilizing a genetic algorithm to obtain the optimal solution of the global fuel under the condition of the tangential impulse; the specific process is as follows:
step two, assuming that the pulse number is n, the number of state variables needing to be optimized for obtaining the fuel optimal solution is at least 2n-3, and selecting the state variable to be optimized as X = [ theta ] = 12 ,...,θ n-1 ,Δv 1 ,Δv 2 ,...,Δv n-2 ];
Wherein, theta i Is shown asThe included angle between the position of the spacecraft and the rise-intersection point of the initial orbit in the radial direction OX during the i-time pulse is in the value range of [0,2 pi];Δv i The value range of the ith pulse is set to be [ -10,10]The direction same as the original speed direction is taken as positive, and the unit is km/s;
step two, according to the initial orbit parameter [ a ] 0 ,e 0 ,i 000 ]And carrying out track recursion on the state variable to be optimized, wherein the track recursion process is represented as follows:
from initial orbit parameters and theta 1 It can be obtained that the spacecraft is at theta before the first pulse is applied 1 Six number of tracks [ a ] 1 ,e 1 ,i 111 ,f 1 ]Wherein the first five orbital parameters are the same as the initial orbital parameters, i.e. satisfy a 1 =a 0 、e 1 =e 0 、i 1 =i 0 、Ω 1 =Ω 0 、ω 1 =ω 0 True proximal angle f 1 =θ 11 (ii) a By passing at theta 1 Six tracks before applying pulse and pulse size Deltav 1 Solving for θ after the first applied pulse 1 Six number of tracks [ a ] 1 ′,e 1 ′,i 1 ′,Ω 1 ′,ω 1 ′,f 1 ′];
Step two and step three, for the first five items of six track numbers, there is a 1 ′=a 2 、e 1 ′=e 2 、i 1 ′=i 2 、Ω 1 ′=Ω 2 、ω 1 ′=ω 2 (ii) a Through theta 2 Can find f 2 =θ 22 (ii) a From which the second pulse av can be applied 2 Six number of front tracks [ a 2 ,e 2 ,i 222 ,f 2 ]By passing at theta 2 Six number of tracks and pulse Δ v before applying pulse 2 Solving for second applied pulse at θ 2 Six number of tracks [ a ] 2 ′,e 2 ′,i 2 ′,Ω 2 ′,ω 2 ′,f 2 ′];
Until obtaining at theta n-2 To apply a pulse Δ v n-2 Rear orbital parameter [ a n-2 ′,e n-2 ′,i n-2 ′,Ω n-2 ′,ω n-2 ′,f n-2 ′]By knowing the orbital parameters of the target orbit [ a ] f ,e f ,i fff ]And theta in the state variable to be optimized n-1 The magnitude Deltav of the last two tangent pulses is obtained n-1 ,Δv n
4. The optimal coplanar transition search method based on the tangent initial value as claimed in claim 3, wherein: in the second step, the initial orbit parameter [ a ] is used as the basis 0 ,e 0 ,i 000 ]And the state variables to be optimized can be subjected to track recursion, and the track recursion process is expressed as follows:
from initial orbit parameters and theta 1 The first time before pulse is applied can be obtained that the spacecraft is at theta 1 Six number of tracks [ a ] 1 ,e 1 ,i 111 ,f 1 ]Wherein the first five orbital parameters are the same as the initial orbital parameters, i.e. satisfy a 1 =a 0 、e 1 =e 0 、i 1 =i 0 、Ω 1 =Ω 0 、ω 1 =ω 0 True proximal angle f 1 =θ 11 (ii) a By passing at theta 1 Six tracks before pulse application and pulse size Δ v 1 Solving for theta after the first applied pulse 1 Six number of tracks [ a ] 1 ′,e 1 ′,i 1 ′,Ω 1 ′,ω 1 ′,f 1 ′];
The specific process is as follows:
position and velocity vectors r of the spacecraft on the first pulse application 1 ,v 1 ]Can be expressed as
Figure FDA0003988357860000041
r 1 =C 31 )C 1 (i 1 )C 31 )[|r 1 |sinf 1 ;|r 1 |cosf 1 ;0]
Figure FDA0003988357860000042
In the formula, C 1 、C 3 Representing a rotation matrix of the form:
Figure FDA0003988357860000043
at theta 1 To apply a pulse Δ v 1 Then, the position vector is not changed, the speed vector is changed, and the position vector and the speed vector [ r ] of the spacecraft are changed at the moment 1 ′,v 1 ′]Can be expressed as
r 1 ′=r 1
Figure FDA0003988357860000044
So that the position and velocity vector r after the pulse is applied can be used 1 ′,v 1 Solving at θ 1 To apply a pulse Δ v 1 Six number of rear tracks [ a ] 1 ′,e 1 ′,i 1 ′,Ω 1 ′,ω 1 ′,f 1 ′]。
5. The optimal coplanar transition search method based on tangent initial value as claimed in claim 4, wherein: in the second step and the third step, the first five items of six orbits are known to have a 1 ′=a 2 、e 1 ′=e 2 、i 1 ′=i 2 、Ω 1 ′=Ω 2 、ω 1 ′=ω 2 (ii) a Through theta 2 Can find f 2 =θ 22 (ii) a From which the second pulse av can be applied 2 Six number of front tracks [ a 2 ,e 2 ,i 222 ,f 2 ]By at θ 2 Six number of tracks and pulse Δ v before applying pulse 2 Solving for θ after second pulse application 2 Six number of tracks [ a ] 2 ′,e 2 ′,i 2 ′,Ω 2 ′,ω 2 ′,f 2 ′];
Until obtaining at theta n-2 To apply a pulse Δ v n-2 Rear orbital parameter [ a ] n-2 ′,e n-2 ′,i n-2 ′,Ω n-2 ′,ω n-2 ′,f n-2 ′]By knowing the orbital parameters of the target orbit [ a ] f ,e f ,i fff ]And theta in the state variable to be optimized n-1 The magnitude Deltav of the last two tangent pulses is obtained n-1 ,Δv n
The process is as follows:
Figure FDA0003988357860000045
θ=θ nn-1
in which theta represents theta n Angle of included angle and theta n-1 The difference of the included angles; λ represents an intermediate variable;
the relationship between the flight direction angle gamma and the true approach point angle can be used to obtain
Figure FDA0003988357860000051
Figure FDA0003988357860000052
Figure FDA0003988357860000053
In the formula of gamma j Indicating the application of the j-th pulse av j Front flight direction angle, | r j L denotes the application of the jth pulse Δ v j Position vector magnitude of time, p j Representing the radius of the track;
multiplication of both sides by p n sinθ,
Figure FDA0003988357860000054
Can be obtained by finishing
Figure FDA0003988357860000055
Order to
Figure FDA0003988357860000056
Then->
Figure FDA0003988357860000057
In the formula k 1 、k 2 The intermediate variable is represented by a number of variables,
Figure FDA0003988357860000058
representing an intermediate variable;
the transfer orbit has a radius and an angular momentum of
Figure FDA0003988357860000059
Figure FDA00039883578600000510
The magnitude Deltav of the last two pulses can thus be determined n-1 ,Δv n
Figure FDA00039883578600000511
Figure FDA0003988357860000061
The total fuel consumption can be expressed as
Figure FDA0003988357860000062
CN202210581517.9A 2022-05-26 2022-05-26 Optimal coplanarity transfer search method based on tangent initial value Active CN114996841B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210581517.9A CN114996841B (en) 2022-05-26 2022-05-26 Optimal coplanarity transfer search method based on tangent initial value

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210581517.9A CN114996841B (en) 2022-05-26 2022-05-26 Optimal coplanarity transfer search method based on tangent initial value

Publications (2)

Publication Number Publication Date
CN114996841A CN114996841A (en) 2022-09-02
CN114996841B true CN114996841B (en) 2023-04-07

Family

ID=83029744

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210581517.9A Active CN114996841B (en) 2022-05-26 2022-05-26 Optimal coplanarity transfer search method based on tangent initial value

Country Status (1)

Country Link
CN (1) CN114996841B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106560991A (en) * 2016-08-12 2017-04-12 中国船舶重工集团公司第七〇二研究所 Pulse width modulation method for H-bridge cascading-type inverter

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140214373A1 (en) * 2013-01-30 2014-07-31 The Mathworks, Inc. Framework for solving trajectory optimization problems
CN104794311A (en) * 2015-05-15 2015-07-22 哈尔滨工业大学 Global optimal double-pulse orbit transfer method under time free conditions
CN105138011B (en) * 2015-08-31 2017-10-03 哈尔滨工业大学 A kind of time of spacecraft in-orbit service observation space target subrange and the optimal traversal method of fuel impulse
CN109799835B (en) * 2019-01-17 2020-10-09 北京理工大学 Optimal derailing method for rope system towing of space debris
CN114492175B (en) * 2022-01-10 2024-09-06 北京航空航天大学 Multi-target satellite patrol scheme planning method based on intelligent optimization algorithm

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106560991A (en) * 2016-08-12 2017-04-12 中国船舶重工集团公司第七〇二研究所 Pulse width modulation method for H-bridge cascading-type inverter

Also Published As

Publication number Publication date
CN114996841A (en) 2022-09-02

Similar Documents

Publication Publication Date Title
CN106697333B (en) A kind of robust analysis method of spacecraft orbit control strategy
CN104527994B (en) Multi-polar cross-over becomes the track set time soon and holds position sensing tracking and controlling method
CN110989644B (en) Aircraft trajectory planning method considering target point multi-terminal constraint
CN110329546B (en) Small celestial body landing track optimization method considering gravitational attitude and orbit coupling effect
CN110032768B (en) Four-pulse orbit intersection optimization method using accurate dynamic model
CN104635741B (en) Control System for Reusable Launch Vehicle reenters attitude control method
CN108216687B (en) GEO satellite orbit-changing strategy calculation method, system and medium based on particle swarm optimization
CN104345738A (en) Rope system releasing stable control method and electric force rope system off-tracking stable control method
CN103226631A (en) Method for rapidly designing and optimizing low-thrust transfer orbit
CN111444603B (en) Method for rapidly planning shortest time off-orbit trajectory of recoverable spacecraft
CN110244767B (en) Formation configuration reconstruction optimization method adopting finite element method
CN105930305B (en) A kind of three pulses are intersected close to method of guidance
CN111268176A (en) Perturbation track four-pulse intersection rapid optimization method
CN105865459A (en) Visual angle constraint-considered small heavenly body approaching section guidance method
CN111123700B (en) Constraint full-course satisfied optimal control system for obstacle-detouring flight of hypersonic aircraft
CN115755598A (en) Intelligent spacecraft cluster distributed model prediction path planning method
CN109190155B (en) Hybrid continuous low-thrust track design method adopting electric propulsion/solar sail propulsion
CN107506505B (en) High-precision earth-moon free return orbit design method
CN114996841B (en) Optimal coplanarity transfer search method based on tangent initial value
Shen et al. Point return orbit design and characteristics analysis for manned lunar mission
CN113581494A (en) GEO (geostationary orbit) satellite electric hybrid propulsion orbital transfer method
CN116700013A (en) Mixed optimization method for fastest climbing track of aircraft
Halder et al. Nonlinear aeroelastic coupled trim analysis of a twin cyclocopter in forward flight
CN112506209B (en) Reentry vehicle prediction control method based on self-adaptive prediction period
CN115993777A (en) Track perturbation model inversion-based diameter-cut joint control decoupling iteration calibration method

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