Four-Impulsive Rendezvous Maneuvers for Spacecrafts in Circular Orbits Using Genetic Algorithms

Spacecraft maneuvers is a very important topic in aerospace engineering activities today. In a more generic way, a spacecraft maneuver has the objective of transferring a spacecraft from one orbit to another, taking into account some restrictions. In the present paper, the problem of rendezvous is considered. In this type of problem, it is necessary to transfer a spacecraft from one orbit to another, but with the extra constraint of meeting another spacecraft when reaching the final orbit. In particular, the present paper aims to analyze rendezvous maneuvers between two coplanar circular orbits, seeking to perform this transfer with lowest possible fuel consumption, assuming that this problem is time-free and using four burns during the process. The assumption of four burns is used to represent a constraint posed by a real mission. Then, a genetic algorithm is used to solve the problem. After that, a study is made for a maneuver that will make a spacecraft to encounter a planet, in order to make a close approach that will change its energy. Several simulations are presented.


Introduction
This paper aims to analyze optimal rendezvous maneuvers between two spacecrafts that are initially in circular coplanar orbits around the Earth.The main goal is to perform this transfer having the fuel consumption as a penalty function, so the minimization of this quantity is searched during the process of finding the solutions.The approach used here is to assume that the problem is time-free, which means that the time of the transfer is not important.The control assumed to perform this task is an engine that can deliver four burns.This assumption is used to represent a common constraint posed by real missions.In the present paper, we are considering a generic problem, not a specific mission, but this type of constraint appears very often in space activities.
Then, a genetic algorithm is used in order to solve the problem.This type of approach represents a new alternative to solve this problem and can be used for comparisons with results obtained by standard procedures available in the literature, as shown in 1-28 .Preliminary studies showed that, in some situations, this algorithm can be faster in convergence and more accurate, while in some others, it is slower and presents less accuracy.A detailed comparison still has to be made to evaluate under which circumstances this algorithm can be more efficient.In any case, several kinds of missions can use the benefits of the techniques based on the genetic algorithm showed in this work.The main types are transference with free time to change the orbit of the space vehicle without restrictions in the time required by the execution of the maneuver , "rendezvous" when one desires that the space vehicle stands alongside another spacecraft , "flyby" a mission to intercept another body, however without the objective to remain next to it , "swing-by" a close approach to a celestial body to gain or lose energy , and so forth.But, in the present paper, only the rendezvous maneuver is considered.

Description of the Problem
The problem of orbital maneuvers has been studied in several published papers.Some of them are shown in 1-28 .The different approaches to solve this problem can be appreciated in those references.Some authors assumed that a low magnitude force is applied to the spacecraft during a finite time.This is the so-called continuous thrust approach.References 7, 10, 17, 28 have some details on this topic.As an alternative approach, the idea of an impulsive maneuver is also studied.In this situation, a high magnitude force is applied during a time that can be considered negligible.References 3, 5, 8, 27 used this important approach.More recently, two more ideas appeared in the literature to perform orbital maneuvers.The first one is the use of a close approach with a celestial body to change the orbit of a spacecraft.It is the swing-by maneuver.References that used this approach are 2, 13 .The second recent approach is the gravitational capture, where the force generated by the perturbation of a third body 14 can be used to decrease the fuel expenditure of a space maneuver.References 11, 12 have some details of this idea.Some publications cover all those topics in more details, like 6, 9, 15 .Studies more related to the research shown in the present paper are the ones considering the Lambert's problem 1, 16 , the rendezvous maneuver 20-26 , and genetic algorithms itself 18, 19 .
In the present research, in order to solve the transfer proposed here, the Lambert's problem is used, in the way described below.The Lambert's problem can be formulated as follows: "Find an unperturbed orbit, under the mathematical model given by a law that works with the inverse square of the distance Newtonian formulation , that connects two given points P 1 and P 2 , with the transfer time Δt specified."In the literature, several researchers have solved this problem by using distinct formulations.Reference 1 shows several of them.In this way, the parameters of the transfer orbit can be defined by 3 a t is the semimajor axis of the transfer orbit.Note that, for each pair of departure and arrival points, a minimum value a min exists for a t .Two transfer orbits can be found for the same value of a t , depending on the sense of the transfer.
The parameter a t is usually replaced by a different parameter y.The advantage of this substitution is that the new variable has values between 0 and 1.The relationship is shown below 19 The parameters ν 1 and Δν determine the position of the points P 1 and P 2 that can be related to the radius vectors r 1 and r 2 .Any permitted value of the parameter y determines univocally one transfer orbit.These parameters are, from the point of view of the genetic optimizer, the genes of the members of the population.
The genetic algorithm searches for the best solution among a number of possible solutions, represented by vectors in the solution space.To find a solution is to look for some extreme value minimum or maximum in the solution space.The fitness of each individual is represented by the total velocity impulse ΔV required to perform the orbital transfer.The total impulse is given by the sum of the single impulses ΔV i provided in each thrust point in order to pass from an orbital arc to the following one.It corresponds to the velocity difference at the relevant thrust point.
The positions of the thrust points and the parameters of the transfer orbit are obtained using as input the three genes, that is, the parameters previously chosen.The velocities at the thrust points, before and after firing the engine, are easily computed, and it provides the total velocity impulse, which is the measurement of the individual fitness.The evolutionary process will select individuals with the genes corresponding to the optimal maneuver.Figure 1 shows an instantaneous scenario of the problem.
Note that ν 1 is the true anomaly of the point P 1 on the initial orbit; ν 2 is the true anomaly of the point P 2 on the final orbit; Δν is the angular length of the transfer; the orientation of the transfer orbit is defined by the angle ω between its axis and the axis of the initial orbit; c is the distance between P 1 and P 2 2.4 ; F i are the focus of the ellipse.

Figure 2:
The genetic algorithm.

The Genetic Algorithm
The procedure starts with a random population of up to 800 individuals.The initial population is generated randomly, and consider its characteristics distance and angles according to the constrains of each variable.The vectors x are assembled according to the allowed boundary condition.Then, the fitness of each individual is verified, following the criteria of the objective function, which is to minimize the fuel consumption measured by the ΔV found by solving the Lambert's problem.So, the best individuals are selected to go to the next generation, parents, and children.The procedure of crossover is then applied, as well as a mutation to insert diversity in the population Figure 2 .
The random variables used for the implementation of the algorithm are x Δθ 1 , Δθ 2 , R 1 , R 2 , y 1 , y 3 .Those symbols have the meaning that θ i ν i − ω is the true anomaly of the Pi points that determine the transfer orbit, as shown in Figure 3; R i determines the radius vector position in each thrust; the y 2.7 are the angles between F 1 , P 1 , P 2 see Figure 3 again .
Eventually, there are epidemics, with the goal of inserting diversity and reducing the elitism.After that, a new population is created, and the procedure is started again, finishing after n attempts.The block diagram of the genetic algorithm Figure 2 shows the procedures followed to solve the problem.More details of the genetic algorithm can be obtained in 18, 19 .

Selecting the Next Generation and Performing the Crossover and the Epidemic Process
The selection of the new generation is made after the analysis of each individual by measuring its objective function Fitness .The ones with better values for this measurement are selected to undergo a process of crossing or reproduction crossover , where parents are selected, and the children of this intersection are raised Figure 2 .When the population is too uniform, measured by the values of their objective functions, part of the population suffers an epidemic process, where many individuals are killed and replaced by others using again a random process, to insert diversity in the population and to prevent premature convergence to local optimal values.The crossover starts by separating the chromosomes of the parents in two parts.After this separation, the first part of the parent 1 is combined with the second part of the parent 2, and the first part of the parent 2 is combined with the second part of the parent 1.In this way, a second generation is created.See 18, 19 for more details.

Chromosome
The chromosome representation is vital for a genetic algorithm GA , because it is the way that we translate the information from the problem to a format that can be handled by the computer.This representation is completely arbitrary, so it varies according to the choice made by each developer, without any kind of obligation to adopt any representation available in the literature.This is a very important point to emphasize.The vast majority of researchers use the binary representation for this problem because it is the simplest one.In fact, many people, when they imagine a GA, quickly make an association with binary chromosomes used to facilitate the crossing .However, other formulations using real chromosomes, modifying the way of performing crossover, get satisfactory results 18 .In this paper, each gene is chosen to be a real number between 0 and 1, being generated in a binary form and then converted in a real number.The value of the corresponding parameter is , where X min i and X max i are the minimum and maximum values of those variables, which means that they are the boundary conditions.The main reason to use the binary approach is to validate this usual approach, in GA problems, in the particular type of problem considered here.References 18, 19 , that studied this same problem using GA, used different approaches, so the validation of the binary approach was considered important.

Objective Function
Most of the selection techniques used in this procedure require comparisons of the fitness to decide which solutions should be propagated to the next generation.Normally, the fitness has a direct relation with the value of the objective function, according to the rule that better values of the objective function generate higher values of the fitness parameter.When the genetic algorithm calls the objective function, it transfers an array of parameters that specify the selected solution.This selection parameter must not be changed in any way by the objective function.Genetic algorithms are based on biological evolution, and they are able to identify and explore environmental factors to converge to optimal solutions, or approximately optimal global levels.Then, the fitness of each individual can be computed by using the five data that define the problem a 1 , e 1 , a 2 , e 2 , Δω, the first one being unit because of the normalization of the variables and the three genes ν 1 , Δν, y that characterize the individual.Then, we can obtain several important parameters 15 .The true anomaly of the arrival point is given by The radii of the departure and arrival point are given by 1 e 2 cos ν 2 .

2.3
The distance between P 1 and P 2 is The semimajor axis of the transfer orbit is

2.5
The distances c 1 and c 2 of P 1 and P 2 from the vacant focus F 2 can be specified by the equations Figure 3 shows a description of several important variables.
The angles can be calculated by y y 1 y 2 , .

2.7
The eccentricity of the transfer orbit is given by The true anomaly θ 1 of the P 1 on the transfer orbit is 2.9 The argument of perigee for the transfer orbit is which is the angle between the perigees of the transfer and the initial orbits.Now that the geometry of the maneuver has been shown, it is possible to calculate the radial and the tangential components of the spacecraft velocity before and after both impulses, what permits the computation of the total ΔV , which has been assumed to be the measurement of the individual fitness.

Normalization
Nondimensional variables are used in the procedure.They are shown below

2.11
The distance and velocity units for the normalized variables are the semimajor axis of the initial orbit and the velocity on a circular orbit with the same energy as the initial one.So, the reference time is Δt a 3 1 /μ.

Numerical Solutions
Several maneuvers were simulated with the procedure developed here, using the genetic algorithm.Then, the equivalent Hohmann maneuvers were calculated to provide a level of comparison.The idea is not to find a transfer that has a smaller total ΔV , when compared to the Hohmann transfers, but to try to minimize the difference in costs, assuming that the engine of the spacecraft has a limitation that does not allow two impulsive maneuvers to be performed.In theory, for the cases simulated here, the two impulses maneuvers always have a lower consumption.So, the idea is to find the best maneuver that has four impulses, in order to compare with other works 18, 19 .The number of impulses is a parameter that can be modified in the input data of the algorithm to be useful for other applications.The results shown in the present paper always consider a rendezvous maneuver between two spacecrafts, where the radius of the orbit of the first spacecraft is r o 1, and several values were used for the radius of the spacecraft that is in the final orbit see Table 1 .The genetic  algorithm provided satisfactory solutions, when compared with the solutions of the literature 18 , as shown in Table 1.The population is composed by 800 individuals, and up to 400 generations of individuals were used.
The results indicated that the maneuvers using the GA with 4 impulses do not provide savings over the Hohmann transfer for all cases simulated see Figure 4 and Table 1 , as expected and explained before, but it minimizes the difference in costs for the assumed four impulsive maneuvers.Figure 4 shows all the details for this comparison.
Figures 5, 6, 7, 8, and 9, as well as Table 1, show a series of maneuvers.In general, an impulse is applied in the initial orbit ΔV 1 , generating the first elliptical transfer arc, and then, according to the procedure, the second impulse is applied ΔV 2 , leading to another elliptical transfer orbit.The third point of burn will happen ΔV 3 to put the spacecraft in the last transfer arc, and, finally, the last impulse ΔV 4 is applied to locate the vehicle in the desired orbit.The total consumption is the sum of all the intermediate impulses, and it is named ΔV T Table 1 .This total consumption serves as an index of measurement and comparison between the methods.In other words, the information of the extra cost is due to Four-burn orbit transfers-genetic algorithm

Figure 6:
The variables of the problem using the method of genetic algorithm and the best fitness for simulation 6.
the fact that a two-impulse maneuver is not possible and a detailed vision of the best fourimpulse strategy is generated by the GA.The variables of the problem are x Δθ 1 , Δθ 2 , R 1 , R 2 , y 1 , y 3 see Figures 5 and 7 .In each new generation of the population, the individuals are approaching the values suggested by the algorithm, converging to a solution of the problem.The best fitness values of the parameters show the convergence to the optimal value.Table 2 shows a detailed view of the maneuver, explaining all the intermediate Keplerian orbits obtained.
Four-burn orbit transfers-genetic algorithm Simulation 8 and Figure 7 show some new results that confirm that the use of the procedure with four impulses provides results with higher consumption than the biimpulsive maneuver Table 1 , but that minimizes the four-impulsive burn technique.
This study can also be applied to find orbital maneuvers that search for the minimum fuel consumption for a spacecraft that leaves one celestial body and goes back to this same body Figures 9 and 10 .This question is of great importance for missions whose objective is to shift the position of the satellite in a given orbit, without changing the other orbital elements.Prado and Broucke 1 also studied this problem using the Lambert method, under different circumstances.

The Swing-By Maneuvers
The next step is to use the algorithm developed here to study a maneuver that will make a spacecraft to encounter a planet, in order to make a close approach that will change its energy.This problem can be seen as a rendezvous problem, where the second spacecraft, the one to be reached, is a planet and not a space vehicle.Using this approach, a transfer maneuver using Four-burn orbit transfers-genetic algorithm an impulsive engine with four burns is followed by a gravity-assisted maneuver to send the spacecraft further in the solar system.This technique will reduce the cost of an interplanetary mission.This is a standard procedure in orbital maneuvers, and a more detailed description is available in references 2, 9 .In this case, the system consists of three bodies: Four-burn orbit transfers-genetic algorithm 2 M 2 , a smaller body, that can be a planet or a satellite of M 1 , in a Keplerian orbit around M 1 ; 3 a body M 3 , a space vehicle with infinitesimal mass, traveling in a Keplerian orbit around M 1 , when it passes close to M 2 .
This close approach changes the orbit of M 3 and, by the hypothesis assumed for the problem, it is considered that the orbits of M 1 and M 2 do not change.Using the "patched conics" approximation, the equations that quantify those changes are available in the literature 9 .
The standard maneuver can be identified by the following three parameters Figure 11 : i | V ∞ |, the magnitude of the velocity of the spacecraft with respect to M 2 when approaching the celestial body; ii r p , the distance between the spacecraft and the celestial body during the closest approach; iii Ψ A , the angle the approach.
Having those variables, it is possible to obtain δ, half of the total deflection angle, by using the equation 2

3.1
Note that V 2 is the velocity of the celestial body with respect to the main body and V P is the velocity of the smaller mass when passing by the periapsis.A complete description of this maneuver and the derivation of the equations can be found in Prado 9 .The final equations are reproduced below where ω 2 is the angular velocity of the motion of the primaries, ΔE is the variation of energy, ΔC is the variation of the angular momentum, and ΔV is the variation of the magnitude of the velocity due to the swing-by.For the ΔV , we have the equation The gravity-assisted maneuver swing-by can provide a considerable change of the velocity and energy of the spacecraft, reducing the costs of the mission.During this approach, the spacecraft will be transferred to another orbit of interest of the mission.The dynamics used to solve this problem is the traditional model given by the "Patched Conics," so it is assumed that all three bodies involved are points of mass and do not suffer external disturbances.The variations given by the swing-by, in terms of velocity variation ΔV and energy variation ΔE , can now be obtained.
Figure 12 shows the maneuver obtained by the genetic algorithm.The spacecraft comes from an initial orbit with radius r o 1 u.a., which represents the position of the Earth's heliocentric system, in astronomical units.It means that the spacecraft starts from the Earth.Then, it performs a maneuver with 4 impulses, using three elliptic intermediate transfer orbits, and finally it arrives in an orbit with r f 5.202803 u.a.Jupiter .At this moment, it realizes a maneuver of Swing-by with the planet Jupiter.Note that the gain in velocity was ΔV SB 1.104368 and the gain in energy was ΔE 2.017347.During this approach, the space vehicle place itself in another orbit of the interest of the mission.In this mission, the participation of the GA is to find the best procedure to make the spacecrafts reach the planet  Jupiter.From this point, standard procedures of interplanetary trajectories can complete the mission.

Conclusion
Based on the analysis of the results obtained, the genetic algorithm implemented here shows that this technique brings good results for the proposed four impulsive rendezvous maneuvers, when compared with the ones obtained by the traditional impulsive methods.It means that it can be used in real cases, specially when a bi-impulsive transfer is not possible due to the limitations of the engine of the spacecfraft.The procedure is also effective in maneuvering the spacecraft from one body back to the same body, that is, making it leaving and returning to the same orbit.
The results indicate that the maneuver using the genetics algorithm with four impulses does not provide better fuel consumption in any case simulated, since the bi-impulsive maneuver is better in this situation, but the method proves to be efficient in minimizing the four impulsive maneuvers.It is necessary to take into account that, in many cases, the limitations of the propellers of the spacecraft require that the maneuver has to be performed using several impulses, passing through intermediate orbits to reach the target.
Then, we studied a maneuver where the goal is to send a spacecraft to encounter the planet Jupiter to make a swing-by maneuver.The algorithm worked well in finding a good solution for this problem.
In general, the proposed technique can be used when a rendezvous maneuver is required between two given circular orbits for a spacecraft that has an engine that requires the application of four impulses.
In the future, it is possible to apply this technique in three dimensions, in maneuvers that requires more impulses, and also in maneuvers to avoid collisions between a spacecraft and asteroids.

Figure 1 :
Figure 1: Instantaneous scenario of the problem.

Figure 3 :
Figure 3: Geometry of the problem and the angles involved in the problem.

Figure 8 :
Figure 8:The variables of the problem using the method of genetic algorithm and the best fitness for simulation 8.

Figure 10 :
Figure 10: Transfer maneuver from one orbit back to the same orbit.

Figure 11 :
Figure 11: The parameters of the swing-by maneuver.

Figure 12 :
Figure 12: Simulation of a maneuvers leaving the Earth r o 1 and reaching the orbit of Jupiter r f 5.202803 , performing a swing-by maneuver on the planet to gain velocity and energy.

Table 1 :
Rendezvous between coplanar circular orbits showing the values of the ΔV for each burn and the total expenditure ΔV T .The results for the Hohmann are included for comparison.

Table 2 :
The Keplerian elements of the intermediate orbits for the case where r f 2.