# Preliminary Capture Trajectory Design for Europa Tomography Probe.

1. IntroductionThe Jovian moon Europa is a celestial body of primary interest for astrophysicists. The likely existence of a global subsurface ocean, proved by measurements carried out during Galileo mission, makes Europa one of the most promising environments in the Solar System to sustain human habitability. The presence of an ocean may also imply that Europa hosts (or, at least, hosted) life [1]. The importance of the determination of the ice-water layer characteristics is clearly stated in NASA's 2013-2022 Decadal Survey [2].

Europa Clipper is the next mission planned by NASA with the aim of exploring Europa. Because of the extremely harsh Jovian environment in the proximity of Europa, the initial concept of an orbiter was abandoned in favour of a multi-flyby strategy, the same considered for Galileo mission. The present mission profile, with more than 40 flybys of Europa, allows for a paramount investigation of Europa surface and subsurface properties, but is not very favourable to the investigation of Europa's deep interior structure.

A scientific enhancement to Europa Clipper mission was investigated in [3]. There, a small probe deployed on a polar orbit around Europa, hosting just one scientific instrument (a magnetometer) and a transponder required for the Intersatellite Link (ISL) with the mother spacecraft, is proved to be capable of providing crucial information on the interior structure of the moon, such as depth, thickness, and conductivity of the subsurface ocean. Also, ISL could support the reconstruction of the mother spacecraft orbit, hence significantly improving the accuracy of the topographic reconstruction of Europa's surface.

Standing on these arguments, a scientific and engineering team at Sapienza University of Rome, in collaboration with the Imperial College of London, carried out a feasibility study for a probe that could be hosted by the main spacecraft during the interplanetary cruise and released in the Jovian system with the aim at entering into a low-altitude circular quasi-polar orbit around Europa [4]. The result is a small spacecraft named Europa Tomography Probe (or ETP), which could fit the provisional 250 kg allowance that NASA has assigned to a secondary flight element hosted by the main spacecraft.

The feasibility study was carried out under the design philosophy of determining the minimum total mass and volume that allows for the scientific measurements considered in [3]. All subsystems have been described with some details, with the relevant exception of only two elements: (a) the transponder and (b) the trajectory which moves ETP into a polar orbit around Europa, which should interfere as less as possible with the mother spacecraft mission plan. This paper investigates the latter point, that is, the capture strategy for an Europa orbiter at the level of preliminary mission analysis.

The problem of optimizing the capture trajectory of an orbiter (or a lander) directed towards a moon of an outer planet, such as Europa [5], Enceladus [6], or Titan [7], has been the subject of many investigations. A two-body patched-conic approximation is usually assumed for interplanetary missions and transfers in a multibody planetary system [8]. This dynamical model retains the most prominent features of the real system, while keeping the numerical difficulties low. Three-dimensionality and eccentricity of the planetary bodies can be easily taken into account, and several flybys of different moons can be dealt with.

The same kind of missions have been also studied by using dynamical system techniques, which rely on circular restricted three-body problem (CRTBP). Low-energy trajectories are searched for, attempting the construction of "transfer tubes," whose boundaries are typically given by invariant manifolds originating from invariant sets (such as [L.sub.1] and [L.sub.2] Lyapunov orbits). As an example, dynamical chains formed by linking heteroclinic connections and homoclinic orbits [9] are proposed for the analysis of fast resonance transitions between exterior and interior resonant orbits (in the Sun-Jupiter system) [10] or "loose" capture trajectories [11]. Similar concepts are exploited for Halo-to-Halo [12] or libration-to-libration [13] transfers between planetary moons in the Jovian system, adopting a "patched" CRTBP model.

In the present problem, the probe comes from a highenergy condition and approaches the moon with a high hyperbolic excess velocity. The latter techniques are thus not efficient for attaining a solution, while a patched-conic approximation can be profitably adopted.

Delta velocity gravity assist ([DELTA]V-GA) or [v.sub.[infinity]] leveraging

[14] has proved a powerful concept to improve the design of capture (or escape) trajectories. Large changes of the hyperbolic excess velocity at the encounter ([v.sub.[infinity]]) are obtained by using small deep-space maneuvers. When this strategy is used in conjunction with a series of resonant gravity assists, a significant reduction of propellant requirement can be achieved, with respect to a direct insertion maneuver [15].

In the present paper, the design of ETP capture trajectory using [v.sub.[infinity]] leveraging is pursued by blending the patchedconic model and a modern global optimization procedure based on a differential evolution algorithm. The trajectory is modeled as a sequence of legs between two moon encounters; only one deep-space maneuver is permitted in each leg. This approach, proposed in [16] and hereafter referred as "MGA-1DSM," permits a quite general parameterization of the whole trajectory, which is not limited to [DELTA]V-GA maneuvers. A preliminary solution (the sequence of resonant orbits and intercepted bodies) is defined by using two simple tools: the suboptimal solution of the [v.sub.[infinity]] leveraging problem proposed by Sims and Longuski [17] and the Tisserand graph [18]. The former permits an easy design of a mission based only on [v.sub.[infinity]] leveraging maneuvers, by suggesting a viable sequence of resonant orbits. The latter is a powerful graphical aid for the design of the same class of missions, when multiple bodies are intercepted, and some deep-space maneuvers are conveniently replaced by gravity assists of other moons in the planetary system.

The paper organization is here outlined. In Section 2, the physical problem of interest is described, and the adopted dynamical model and relevant assumptions are stated. A mathematical formulation (MGA-1DSM), which parameterizes a generic interplanetary trajectory as a sequence of legs containing a gravity assist and one deep-space maneuver, is outlined, leading to the purposeful definition of a global optimization problem. Section 3 presents the multipopulation differential evolution algorithm that has been used to solve the optimization problem. Fundamental tools for preliminary mission design, that is, [v.sub.[infinity]] leveraging and Tisser-and graph, are discussed in Section 4. A tentative solution is devised and used to prune global optimization search. Numerical results of this investigation are presented in Section 5. A conclusion section ends the paper.

2. Problem Statement and Mathematical Modeling

2.1. Problem Overview. According to the ongoing proposal [4], the probe is assumed to be released by the main spacecraft after a few Europa flybys have been completed. In particular, ETP starts its own transfer at the apocenter of a Jovian orbit of period four times the period of Europa ([T.sub.Eu]), pericenter equal to the Europa semi-major axis, and coplanar with the Europa orbit; the orientation of the major axis is left free. A target circular quasi-polar orbit around Europa is desired, of assigned altitude [h.sub.EOI] = 250 km over Europa's surface. Four R-6D bipropellant thrusters form the primary propulsion system of the probe, which allows for a total thrust of 88 N with specific impulse [I.sub.sp] = 294 s. This propulsion system will be used for deep-space maneuvers, Europa Orbit Insertion (EOI) maneuver, and orbit maintenance during the scientific part of the mission.

A probe "net" mass [m.sub.u] = 146.6 kg, which does not account for the propellant [m.sub.p] and tank [m.sub.s] masses, was estimated in [4]. Assuming a structural coefficient [member of] = [m.sub.s] + [m.sub.p]/[m.sub.s] = 6, which is a reasonable value for liquid propellant systems, a maximum value of velocity increment [DELTA][V.sub.max] = 1240.8 m/s can be obtained if the spacecraft wet mass [m.sub.0] = [m.sub.u] + [m.sub.p] + [m.sub.s] is constrained at 250 kg. This value of [DELTA][V.sub.max] must cover the orbit maintenance (about 43.2 m/s for a 6-month mission) and capture cost. The goal is to reduce the [DELTA]V required for the capture, so that a convenient safety margin is left.

2.2. Dynamical Model. A patched-conic model is assumed for the present analysis. Flybys are modeled as instantaneous changes in velocity. Subscripts "-" and "+" are used to distinguish between values immediately before or after the discontinuity, respectively. The radius of the sphere of influence (SOI) of the secondary bodies and the travel time inside these regions are assumed to be negligible. Powered flybys are neglected, as considered useless to reduce propellant consumption [19]. An impulsive-thrust model is adopted. This assumption well suits deep space maneuvers (DSMs), which are performed at a large distance from the main body and require usually a quite short time if compared to the orbital period, as chemical engines are here considered. This assumption is also used for the EOI maneuver, even though finite-thrust losses might be considered. Only one DSM is permitted between a flyby and the other. As a further assumption, Jovian moons move on Keplerian orbits (even though the proposed procedure is soon applicable to the general case that uses planetary ephemeris).

Despite its simplicity, this model allows to capture the most prominent features of the mission, while keeping the analysis simple enough. In fact, under the hypothesis of impulsive thrust, the trajectory can be computed analytically, without involving the numerical integration of the complete equations of motion.

2.3. Trajectory Parameterization. Let us assume that a sequence M = ([M.sub.j] | j = 1,.., N +1 of N +1 body encounters, where [M.sub.j] [member of] [1..4] identifies the encountered body (1 = Io, 2 = Eu, 3 = Ga, and 4 = Ca), has been established. Europa is the first and last body in the series. The spacecraft trajectory can be modeled according to the multiple gravity assist-one deep space maneuver (MGA-1DSM) formulation [16]. The trajectory is broken down into a series of bodyto-body legs. Each leg starts with a flyby and is made up of two ballistic arcs, joined by an impulsive maneuver.

This general formulation for a multigravity assist trajectory can be adapted to the problem at hand by adding an initial leg, which moves the probe from the assigned initial conditions to the first encounter with Europa. The mission ends with a last approach to Europa's surface, where an impulsive maneuver inserts the probe into the assigned polar orbit.

2.3.1. Departure Leg. The departure leg, which connects ETP release position to the first encounter with Europa, is modeled as a Lambert arc, where release epoch [t.sub.0], flight angle [DELTA][theta], and flight time [DELTA][T.sub.0] are design parameters to optimize.

Let {[mathematical expression not reproducible] } be a Jovicentric radial-traversal-normal reference frame connected to a Europa position at epoch [t.sub.1] = [t.sub.0] + [DELTA][T.sub.0], that is,

[mathematical expression not reproducible] (1)

where [mathematical expression not reproducible] ([t.sub.1]) indicates position and velocity vectors of Europa ([M.sub.[1]] = 2) at time [t.sub.1], respectively, which are provided by the ephemeris.

The probe departure point is located on a circle of radius [??] which lies on the plane [mathematical expression not reproducible] hence, it can be expressed as

[mathematical expression not reproducible], (2)

while the velocity immediately before the release maneuver is

[mathematical expression not reproducible], (3)

where the values [mathematical expression not reproducible] are, respectively, the radius and velocity magnitude at the apocenter of a Jovian orbit with pericenter equal to the Europa semi-major axis, and period [4T.sub.Eu]. In this respect, the problem solution will eventually define the optimal orientation of the line of apses of the initial orbit with respect to Europa's orbit.

The velocity vectors after the release maneuver v 0 and immediately before the first flyby [mathematical expression not reproducible] can now be evaluated by solving the associated Lambert problem:

Lambert ([mathematical expression not reproducible]]. (4)

The propulsive cost of the release maneuver is evaluated as

[mathematical expression not reproducible] (5)

2.3.2. Intermediate Legs. The kth leg can be parametrized by using four parameters [mathematical expression not reproducible], which represent, respectively, the flyby radius, the flyby plane orientation, the (overall) leg flight time, and the fraction of the leg flight time at which DSM occurs. The trajectory associated to a generic intermediate leg is presented in Figure 1.

Beginning from time [t.sub.1] at the first encounter, the epochs of the following encounters can be evaluated recursively as [t.sub.k+1] = [t.sub.k] + [DELTA][T.sub.k], while the DSM epochs are [mathematical expression not reproducible] [T.sub.k]. Moon position [mathematical expression not reproducible] and velocity [mathematical expression not reproducible] are obtained from the body ephemeris. The position of the spacecraft at the flyby must be the same as the intercepted body; hence, [mathematical expression not reproducible].

Let's define a body-centered reference system {[mathematical expression not reproducible]}, where [??] is directed along the spacecraft incoming relative velocity, [??] is orthogonal to the moon orbital plane, and [??] closes the right-hand side term

[mathematical expression not reproducible] (6)

where [mathematical expression not reproducible] is the probe relative velocity before the flyby. The probe velocity [v.sub.k+] after the flyby is evaluated as

[mathematical expression not reproducible] (7)

where the rotation [[delta].sub.k] of the hyperbolic excess velocity in the flyby plane is

[mathematical expression not reproducible] (8)

Once the spacecraft state after the flyby is fully known, the position and velocity just before DSM, which are [r.sub.k+1/2] and [r.sub.(k+1/2)-], respectively, can be evaluated analytically by using propagation formulas for Keplerian orbits [20].

Position of the spacecraft is known at both DSM maneuver and next flyby; the transfer time (1 -[[eta].sub.k])[DELTA][T.sub.k] is also known. Velocity vectors [v.sub.(k+1/2])+ immediately after the DSM and [v.sub.(k+1)-] just before the subsequent flyby can be evaluated by solving the associated Lambert problem

[mathematical expression not reproducible] (9)

Evaluation of the DSM propulsive cost is now straightforward

[mathematical expression not reproducible] (10)

2.3.3. Europa Orbit Insertion. The ETP injection into the target polar orbit around Europa is modeled as an impulsive burn applied at the hyperbola pericenter, which is purposely located on the target circular orbit.

[mathematical expression not reproducible] (11)

The cost of the EOI maneuver is evaluated as

[mathematical expression not reproducible] (12)

2.4. Optimization Problem. For an assigned sequence of encountered body [M.sub.seq], the capture problem can be formally defined as follows:

[mathematical expression not reproducible] (13)

where [mathematical expression not reproducible] is the overall cost of the capture trajectory, accounting for deep-space, release, and EOI maneuvers; x is a vector of design variables given by

[mathematical expression not reproducible]. (14)

and [x.sub.L] and [x.sub.U] are, respectively, lower and upper bounds of the design variables. The whole trajectory is thus parametrized by using 3 + 4N parameters.

3. Optimization Algorithm

The global optimization problem stated in Section 2 presents several features that make it hard to solve with local optimization approaches (e.g., Newton-like methods) as (i) multiple local optima exist, (ii) the solution may not be defined for some "unfortunate" set of optimization variables, and (iii) the gradient of the objective function is often not available or does not exist at all. In these cases, stochastic algorithms are usually preferred.

In the present application, an optimization algorithm based on differential evolution (DE) has been employed. DE is a population-based algorithm, featuring simple and efficient heuristics for global optimization problems defined over a continuous space [21]. Its good performance on several benchmarks and real-world problems drew the attention of many researchers all over the world, who further improved the effectiveness of the algorithm, by devising many variants. A review of the state of art can be found in [22]. The implementation adopted in this study collects several of these ideas.

3.1. Standard Differential Evolution. A brief description of the standard DE algorithm is here provided. Let us consider the minimization problem

[mathematical expression not reproducible] (15)

A population of [N.sub.P] candidate solutions Pop = {[x.sub.i], i=1 .. [N.sub.p]} is randomly created, and for each individual (or agent) [mathematical expression not reproducible], the corresponding fitness f ([x.sub.i]) is evaluated. Then, a new population [Pop.sup.new] is constructed by repeating, for each vector [x.sub.i] belonging to Pop, a sequence of mutation/crossover/selection steps, defined as follows.

3.1.1. Mutation. A mutated vector [v.sub.i] is created as a linear combination of a few population members. More precisely, several mutation rules were proposed in order to attain either a better exploration of the search space or a faster convergence (exploitation). In the present implementation, the following four strategies, among those available in literature,

[mathematical expression not reproducible] (16)

where F is a parameter controlling the mutation scale, [x.sub.Gbest] is the best individual (or agent) of the current generation, and [r.sub.1],..., [r.sub.4] represent randomly chosen, nonrepeated, indexes belonging to {1..[N.sub.P]}.

Each strategy has weaknesses and strengths: Strategies based on mutation of the best individual (strategies 2 and 4) typically show a faster converge rate toward an (often local) minimum, whereas strategies based on randomly chosen individuals (strategies 1 and 3) better explore the whole search space.

3.1.2. Crossover. A trial vector [u.sub.i] is obtained by a crossover between the target vector [x.sub.i] and the mutated vector [v.sub.i]

[mathematical expression not reproducible] (17)

where [p.sub.j] is a random number between 0 and 1, [C.sub.R] is an algorithm parameter (typical values about 0.5), and [j.sub.rand] is a randomly chosen index in the range {1..[N.sub.D]}.

3.1.3. Selection. Target and trial vectors are compared. The best one is retained and inserted in the new population

[mathematical expression not reproducible] (18)

This process is repeated iteratively, creating at each generation a new population which replaces the previous one. The procedure ends after a fixed number of generations ([N.sub.G]). The best attained solution is deemed the optimal problem solution.

3.2. Self-Adaptation of Control Parameters. A common practical issue for many stochastic algorithms concerns the selection of suitable values for the control parameters. A fine tuning is often required in order to make the algorithm suitable for complex, real-world problems. DE is privileged in this respect, as the number of its parameters is very low. Apart from the the population size [N.sub.P], the performance of the DE algorithm depends on an appropriate selection of the scale factor F, which controls the mutation phase, and crossover probability [C.sub.R], which controls the crossover phase.

In order to avoid the manual tuning of DE control parameters, a self-adaptation scheme [23] has been implemented. The values of F and [C.sub.R] are encoded into the individuals, which enter the optimization procedure, and randomly initialized within the intervals [mathematical expression not reproducible], respectively. Better values of these encoded control parameters will presumably lead to better individuals who, in turn, are more prone to survive and produce offspring, thus propagating these "superior" control parameters.

In order to maintain a certain diversity of the control parameters among the population, at the end of each generation, each individual undergoes a random uniform mutation of his control parameters which happens with probability [p.sub.[tau]], that is,

[mathematical expression not reproducible] (19)

where [p.sub.1] and [p.sub.2] are random numbers in [0,1], the apexes G and G+1 refer to the current and next generation, respectively, and U(a, indicates to a randomly sampled number in the range [a, b]. In the present implementation, the following values are used: [mathematical expression not reproducible]

3.3. Balancing Local and Global Search. A key point in designing a global optimization algorithm concerns the delicate balance between two opposite needs: "global" exploration and "local" exploitation. Exploration refers to the algorithm capability of probing wide portions of the search space, with the hope of finding promising solutions that are yet to refine, while exploitation is the ability of improving a previous solution by probing a small region of the search space around it. A proper balance is required for the success of the algorithm: favouring local search reduces computational time, at the risk of being trapped in local optima, whereas favouring the global search requires longer computation time as a wide portion of the search space has to be tested. In order to achieve a good balance between exploration and exploitation, the proposed algorithm encompasses the creation of different populations, or tribes, each located on an "island."

Each tribe evolves independently from the others and features one specific mutation strategy among the four proposed variants. As shown in Figure 2, the different islands are arranged in a radial configuration, so that tribes on inner islands feature the less exploiting (i.e., most exploring) mutation strategy, whereas tribes on the outer islands feature the most exploiting mutation strategy. The order of the strategies from the outer to the inner islands is then 2, 4, 3, and 1. Every 100 generations, a migration is performed: Each tribe passes its best three agents to the "following one" (if it does exist, according to the direction of migration), in which these agents replace the three worst agents. Outward and inward migration tides alternate at each migration event. The proposed scheme allows an easy parallelization. A minimum of 4 islands are required to make it effective, but it scales well on any architecture with 4x cores.

3.4. Termination Criterion. The termination criterion is mainly based on the generation number, that is, on the available computational budget. This parameter strongly depends on the complexity of the analyzed problem. The maximum number of generation is chosen in such a way that the outcomes of independent runs of the code bring, in almost all cases, to similar results. In this respect, maintaining a certain diversity of the population in terms of its distribution on the search space is mandatory, to avoid a premature convergence on a local optimum.

A partial-restart mechanism, hereafter named "Epidemic," is adopted to handle this issue. More precisely, population diversity is evaluated for each tribe at the end of each generation, by using as metric the Euclidean distance between pairs of solutions. If the diversity score falls under a certain threshold, a large part (90%) of the population is randomly reinitialized over the entire search space. The maximum number of epidemic events that may occur in any run is fixed (2, in this application) in order not to compromise the overall efficiency of the search.

The reported solutions have been obtained by exploiting an 8-tribe optimization engine, with 512 agents per tribe and a maximum number of generations equal to 10000. In order to mitigate potential issues due to the stochastic nature of the algorithm, that is, an unfortunate premature convergence on a suboptimal solution, several runs can be performed starting from a different initial population, increasing the confidence on the attained result. In the present application, each optimization is repeated 25 times, and the best found solution is assumed as putative optimal solution.

4. Preliminary Analysis

A preliminary analysis is carried out in order to define the main features of the tentative trajectory that undergoes the DE optimization process. For the sake of simplicity, the orbits of the Galilean moons are assumed to be circular and coplanar. The Tisserand graph and the numerical suboptimal solution of the [v.sub.[infinity]] leveraging or [DELTA]V-Europa gravity assist ([DELTA]V-EGA) maneuver are effective tools in defining the preliminary solution. These tools are here described with reference to the dual problem of escaping from Europa, because it is more intuitive and several papers are found in literature, dealing with vo leveraging to move away from the Earth.

4.1. Tisserand Graph. The Tisserand graph is a powerful instrument for the preliminary design of trajectories of a spacecraft that exploits multiple gravity assists in a multibody planetary system. Several versions have been discussed by different authors. The two-dimensional apoapsis-periapsis (or [r.sub.a] - [r.sub.p]) plot is adopted here.

Any point on the graph ([r.sub.a] > [r.sub.p] >0) identifies a Keplerian elliptical orbit of the spacecraft around the central body (Jupiter). For a given secondary body M, moving on a circular orbit of radius [r.sub.M], the region [mathematical expression not reproducible] encompasses all spacecraft orbits that intersect the moon orbit. For each point ([r.sub.a], [r.sub.p]) in this region, one can easily compute the values of magnitude and direction of the hyperbolic excess velocity [v.sub.[infinity]] in case of encounter. The direction of [v.sub.[infinity]] with respect to the moon velocity [v.sub.m] is defined by the pump angle [alpha] (see Figure 3).

Curves of constant hyperbolic excess velocity are typically superimposed on this plot. Each curve collects all Jovicentric orbits approaching the moon with the same [v.sub.[infinity]] magnitude and pump angle ranging from 0 degrees ([r.sub.p] = [r.sub.M], rightmost point) to 180 degrees ([r.sub.a] = [r.sub.M], leftmost point).

Lines of constant orbital period (i.e., constant energy) can also be plotted. This feature is mainly used to represent K : L resonant orbits, where K and L indicate the number of revolutions completed by moon and spacecraft, respectively, between two successive encounters.

Starting from any point on the graph, a shift to another orbit along a curve of constant [v.sub.[infinity]] can be obtained at no cost, as result of a gravity assist. The displacement along the curve depends on the rotation of the hyperbolic excess velocity 8, which is given by 8.

Sequences of flybys can be performed, provided that the spacecraft is able to re-encounter the moon. The role of resonant orbits is now apparent, as hopping between resonant orbits guarantees the re-encounter in a known time.

For each resonant orbit, one can draw a pair of maximum deviation curves, assuming that a minimum-altitude flyby is enforced. These curves encompass all Jovicentric orbits achievable from that resonant orbit, by means of a gravity assist. Maximum deviation curves show, for any initial [v.sub.[infinity]] value, which resonances are available for the next jump.

Points that do not lay on the same [v.sub.[infinity]] curve can be connected only by means of some propulsive maneuver. As an example, vertical displacements on the graph can be obtained as a result of a tangential impulse at the apocenter.

Figure 4 shows a Tisserand plot for the Jovian planetary system. Contour lines of constant [v.sub.[infinity]] value are displayed for Europa and Ganymede. Resonant orbits corresponding to resonance 6:5, 3:2, 7:4, 2:1, and 5: 2 with Europa and associated maximum-deviation curves are shown as an example.

4.2. Suboptimal Solution for V Leveraging Transfers. The maneuver known as [v.sub.[infinity]] leveraging, illustrated in Figure 5, provides an efficient way to move between points on the Tisserand graph that do not lay on the same [v.sub.[infinity]] curve, as a large change of [v.sub.[infinity]] is obtained by means of a small [DELTA]V. The spacecraft leaves the secondary body (Europa) with a given hyperbolic excess velocity [v.sub.[infinity]], entering a near-resonant orbit around the central body (Jupiter). A deep-space maneuver is performed near the apoapsis in order to modify [v.sub.[infinity]] (increase, if one is considering an escape trajectory, or decrease, if one instead considers a capture) at the next encounter of the probe with the secondary body. Here, a flyby permits to rotate the hyperbolic excess of velocity, allowing the probe to enter a Jovicentric orbit with a larger apocenter. A generic AV-EGA maneuver can be labeled as K : L(M) [+ or -], where K and L indicate the number of revolutions that moon and probe complete, respectively, before the next encounter; M [less than or equal to] L denotes the spacecraft orbit where DSM occours; the sign [+ or -] is used to distinguish between the possible encounter locations: just before (-) or after (+) traversing the line of apsides.

A suboptimal solution for [DELTA]]V-EGA maneuvers is easily achieved [14] under the assumption that (i) the spacecraft initial orbit is tangent to the moon's orbit and (ii) a tangential [DELTA]V is applied at the apocenter of the nearly-resonant K : L orbit. The maneuver is slightly improved if the aforementioned assumptions are removed [24]. Dealing with high-[v.sub.[infinity]] flybys, the replacement of the patched-conic model with the RTBP model does not modify the mission and the numerical performance [25].

5. Numerical Results

5.1. Tentative Solution. The dual problem of escaping from Europa is considered in this section. A sequence of [DELTA]VEGA maneuvers with increasing K : L resonances is used to progressively augment the probe apocenter, by targeting, after each flyby, a larger near-resonant orbit. Eventually, the spacecraft enters a hyperbolic trajectory and escapes Jupiter SOI [15]. In the present case, the probe trajectory ends at the apocenter of a 4: 1 resonant orbit.

The tentative solution depends on the performance index that is minimized. In a minimum-propellant problem, the total [DELTA]V is minimized by aligning vector [v.sub.[infinity]], after each flyby, to Europa orbital velocity. This corresponds to maximizing the energy after the flyby (max-E strategy), assuming assigned [v.sub.[infinity]]. Low increments of v[infinity] correspond to very small deep-space impulses. The optimization problem is ill-defined without any kind of time constraints, as the optimal solution would require an infinite number of [DELTA]V-EGA maneuvers, each with infinitesimal [v.sub.[infinity]] increment. Overall flight time is approximately equal to [T.sub.Eu][epsilon]K. As a consequence, high-K resonances should be avoided.

Assuming [K.sub.max] = 16, the suboptimal minimumpropellant solution presents [DELTA]V = 1.04318 km/s with flight time of 627.8 days. However, by skipping some resonances, while keeping max-E strategy, flight time can be considerably reduced with a minimum increment of propellant expenditure. Europa, due to its small mass, can provide only small rotations of the hyperbolic excess velocity, and long resonances, such as 9: 5 and 11:5, must be included in order to exploit max-E strategy. Flight time remains incompatible with ETP mission requirements.

High-K resonances can be skipped by privileging the energy increment provided by each gravity assist, instead of the energy after the flyby. The maximum increment of energy (max-[DELTA]E strategy) implies the maximum change of the semimajor axis, that is, period. In an unconstrained gravity assist, max-[DELTA]E strategy requires the alignment of the hyperbola axis to the velocity of the secondary body ([[alpha].sub.+] = [pi] - [alpha]_. Moreover, a [v.sub.[infinity] magnitude exists that maximizes [DELTA]E. The present problem is, at a large extent, different. The resonant orbit after the previous gravity assist is assigned, and the pump angle [alpha]_ before the flyby is not free but a function of [v.sub.[infinity]]. Moreover, the new resonance is "a priori" selected in order to contain the trip time (low K is preferred). Therefore, [DELTA]E is assigned and the mission designer just selects a hyperbolic excess velocity in the range that permits the desired resonance jump. The best [v.sub.[infinity]] value depends on the entire mission and will be a result of the optimization process. When the max-[DELTA]E strategy (here improperly so called) is adopted, [v.sub.[infinity]] and pump angle after the gravity assist are large, and a further flyby, without any DSM (and leveraging), could align the spacecraft velocity to the moon orbital velocity.

The mission can be further improved by taking advantage from Europa's eccentricity and by removing constraints on position and direction of the deep-space impulse. This task is carried out by means of the proposed optimization algorithm, based on the general MGA-1DSM formulation described in Section 2. A reasonable tentative sequence of resonances is used to prune the global search. A careful exam of the Tisserand graph, in the light of the previous concepts, permits the exclusion of resonances with K >7. Lower and upper bounds of the optimization variables are conveniently adjusted to improve convergence. In particular, for a generic K : L(M) AV-EGA maneuver, one has

[mathematical expression not reproducible]

Flyby parameters [r.sub.[pi]] and [beta] do not depend on the prescribed resonance.

A capture trajectory is first attained under the hypothesis of a circular orbit for Europa (solution "A"). Next, this assumption is removed, and a slightly different trajectory is attained (solution "B"). Eventually, a third trajectory, which also exploits a flyby of Ganymede, is proposed (solution "C").

5.2. Solution "A"--Europa Circular Orbit. Solutions according to max-E strategy are impractical as the overall flight time is incompatible with ETP mission requirements. The Tisserand graph actually suggests that a reduction of the flight time can be achieved performing maneuvers based on max-AE strategy. Solution "A" is obtained by assuming that Europa moves on a circular orbit, in order to match hypothesis and indications of the Tisserand graph. A suitable sequence of resonant orbits is assumed, and an optimal solution is provided by the DE algorithm. Features of the mission are summarized in Table 1. Each row presents initial time, [v.sub.[infinity]] magnitude at flyby, resonance, and deep-space impulse of each leg. The last row refers to the impulsive injection into the target orbit around Europa.

Capture [DELTA]V is reduced substantially with respect to a direct insertion (2781.9 m/s), allowing to reduce ETP total mass (including propellant and structures) to 239.58 kg. The Jovicentric trajectory is plotted in Figure 6. Deep-space maneuvers are performed substantially at the apogee of the resonant orbits. Flyby locations on Europa orbit move clockwise, indicating that all maneuvers belong to class (-). Only the first flyby does not follow this rule, probably due to the peculiar features of the transition from the initial leg to the first intermediate leg.

The Tisserand graph is presented in Figure 7. For resonances lower than 2:1, after the flyby the spacecraft enters a Jovicentric orbit with perigee equal to Europa radius. This matches the suboptimal solution proposed by Longuski, where the hyperbolic excess of velocity is aligned with the moon velocity. The alignment condition is not verified for resonance higher than 2:1, when max-[DELTA]E maneuvers are carried out in order to minimize the number of AV-EGA maneuvers, skipping the most time-consuming legs.

5.3. Solution "B"--Europa Elliptic Orbit. The hypothesis on circularity of Europa's orbit is removed, and a new solution for the same mission scheme is searched for. Table 2 describes the attained solution. Figures 8 and 9 present the spacecraft trajectory and the corresponding Tisserand graph, respectively. Minor, yet interesting differences, can be observed. The transition between resonances 2: 1 and 7: 4 is now obtained by means of a max-[DELTA]E maneuver. The final flybys and EOI maneuver occur in close proximity of Europa pericenter, in order to benefit from a lower v[infinity]. The propellant consumption is coherent with solution A, and the mission takes slight advantage from the eccentricity of Europa orbit.

5.4. Solution "C"--Ganymede Flyby. Previous solutions show that ETP trajectory crosses Callisto and Ganymede orbits during its journey. An improved solution is searched for, aiming at replacing some deep-space maneuvers with Ganymede or Callisto flybys.

In particular, the semi-major axis of Ganymede (1.595 [R.sub.Eu]) almost matches the apoapsis radius of the nominal 3: 2 orbit (1.621 [R.sub.Eu]). The 3: 2(2) arc from Europa to Europa is thus substituted by two legs: the first from Europa to Ganymede and the second from Ganymede to Europa. Also, a 5: 3 resonant orbit is used instead of 7: 4, reducing the flight time by 2[T.sub.Eu].

Results for this mission are summarized in Table 3. The Jovicentric trajectory and the Tisserand graph are presented in Figures 10 and 11, respectively. The flybys progressively rotate the initial hyperbolic excess velocity of the spacecraft, moving the spacecraft through a series of resonant orbits, until the apocenter is close to the Ganymede orbit, where a gravity assist from this moon makes the spacecraft orbit almost tangent to Europa orbit. No significant DSM is performed during the legs preceding the Ganymede flyby; thus, the Europa position at the encounters A-F is the same.

The Tisserand graph for this solution is presented in Figure 11, confirming that one Ganymede flyby is sufficient to change [v.sub.[infinity]] in a so large amount that no deep space maneuver is necessary before two final Europa gravity assists permit the achievement of the 6: 5 resonant orbit which ends with the EOI maneuver. A closer inspection shows small changes of [v.sub.[infinity]] in the first part of the mission, despite no impulsive maneuver is performed. This is explained by recalling that [v.sub.[infinity]] curves on the Tisserand plot are drawn assuming circular and coplanar orbits of the moons. In particular, Ganymede and Europa orbits are not coplanar (their inclinations are 0.2 and 0.4 degree, resp.); therefore, unlike previous solutions, this ETP trajectory is not coplanar with the Europa orbit. Spacecraft inclination and velocity vary at each flyby, resulting into a deceptive [v.sub.[infinity]] change on the planar circular Tisserand graph.

The DE algorithm was able to find a solution with negligible deep-space impulses between flybys A and H. This kind of optimization method suffers the very low variation of the performance index in the proximity of the optimal solution and cannot be very accurate. The quality of the solution can be improved by replacing the general MGA-1DSM formulation with another one that considers ballistic legs between flybys, when required by theoretical considerations.

By reducing the capture [DELTA]V to 882.04 m/s, ETP mass becomes 218.61 kg, saving approximately 21 kg with respect to previous solutions. The exploitation of a gravity assist by Ganymede also permits a 6-day reduction of the mission time length. A major drawback is the requirement of a suitable initial phasing between Europa and Ganymede, or a precise timing for ETP release, which repeats every 7.058 days, that is, the Ganymede-Europa synodic period. Even though this issue might be thought irrelevant, as nowadays missions withstand many complex trajectory constraints, this is quite a delicate point for a probe that aims at minimal impact on the mission of the mother spacecraft. In this respect, a similar solution should be searched for, only after the baseline mission has been defined. The ETP release condition will be accordingly constrained.

6. Conclusions

In the search for a low-AV capture of a light-weight spacecraft into a polar orbit around Europa, [v.sub.[infinity]] leveraging represents an excellent technique, which reduces the propellant consumption, at the cost of increased flight time. Moreover, several deep-space maneuvers along Europa-resonant orbits can be replaced by a single Ganymede gravity assist; total AV is further reduced with a small saving of the flight time. The Tisserand graph has proved to be an effective tool for the preliminary analysis. The same graph is also useful to introduce in the mission the gravity assist from other Galilean moons.

The search for the optimal solution is made complex by the need that the actual mission must take eccentricity and inclination of the secondary bodies into account. The exploitation of an effective heuristic optimization code allowed a wide exploration of the solution space, and an optimal solution is found in a relatively easy and fast manner. The performance of this Europa capture trajectory confirms the feasibility of a low-cost exploration mission, carried out by a small orbiter, compatible with the specifics for the secondary payload of Europa Clipper mission.

Data Availability

All data generated or analyzed during this study are included in the present paper, with the relevant exception of physical constants and orbit parameters of Jupiter and its moons, which are easy to retrieve elsewhere. As an example, an interested reader can look at ESA/GTOC6 repository, https:// sophia.estec.esa.int/gtoc_portal/?page_id=26.

https://doi.org/10.1155/2018/6890173

Conflicts of Interest

The authors declare that there is no conflict of interest regarding the publication of this paper.

Acknowledgments

This research was financed by University of Rome-Sapienza.

References

[1] C. F. Chyba and C. B. Phillips, "Europa as an abode of life," Origins of Life and Evolution of the Biosphere, vol. 32, no. 1, pp. 47-67, 2002.

[2] National Research Council, Vision and Voyages for Planetary Science in the Decade 2013-2022, National Academies Press, 2012.

[3] M. di Benedetto and V. Notaro, Augmenting NASA Europa Clipper by a Small Probe: Europa Tomography Probe (ETP) Mission Concept, IAC, 2016.

[4] V. Notaro, L. Iess, and A. Zavoli, Europa Tomography Probe (ETP) Mission Feasibility -Spacecraft Design, IAC, 2016.

[5] J. Johannesen and L. D'Amario, "Europa orbiter mission trajectory design," in AAS/AIAA Astrodynamics Specialist Conference, Girdwood, Alaska, August 1999.

[6] N. J. Strange, S. Campagnola, and R. P. Russell, "Leveraging flybys of low mass moons to enable an enceladus orbiter," in Paper AAS 09-435, AAS/AIAA Astrodynamics Specialist Conference and Exhibit, Pittsburgh, PA, USA, August 2009.

[7] N. Strange, T. Spilker, D. Landau, T. Lam, D. Lyons, and J. Guzman, "Mission design for the titan saturn system mission concept," vol. 135, pp. 919-934, 2010.

[8] M. H. Kaplan, Modern Spacecraft Dynamics and Control, Wiley, 1976.

[9] W. S. Koon, M. W. Lo, J. E. Marsden, and S. D. Ross, "Heteroclinic connections between periodic orbits and resonance transitions in celestial mechanics," Chaos: An Interdisciplinary Journal ofNonlinear Science, vol. 10, no. 2, pp. 427-469, 2000.

[10] W. S. Koon, M. W. Lo, J. E. Marsden, and S. D. Ross, "Resonance and capture of Jupiter comets," Celestial Mechanics and Dynamical Astronomy, vol. 81, no. 1/2, pp. 27-38, 2001.

[11] R. L. Anderson, "Approaching moons from resonance via invariant manifolds," Journal of Guidance, Control, and Dynamics, vol. 38, no. 6, pp. 1097-1109, 2015.

[12] G. Lantoine and R. P. Russell, "Near ballistic halo-to-halo transfers between planetary moons," The Journal of the Astronautical Sciences, vol. 58, no. 3, pp. 335-363, 2011.

[13] G. Gomez, W. S. Koon, M. W. Lo, J. E. Marsden, J. Masdemont, and S. D. Ross, "Connecting orbits and invariant manifolds in the spatial restricted three-body problem," Nonlinearity, vol. 17, no. 5, pp. 1571-1606, 2004.

[14] J. Sims and J. Longuski, "Analysis of Vo Leveraging for Interplanetary Missions," in Astrodynamics Conference, American Institute ofAeronautics and Astronautics, Scottsdale,AZ,U.S.A, 1994.

[15] G. Colasurdo, L. Casalino, and E. Fantino, "Minimum-fuel escape from two-body sun-earth system," Journal of Guidance, Control, and Dynamics, vol. 22, no. 5, pp. 632-636, 1999.

[16] D. Myatt, V. Becerra, S. Nasuto, J. Bishop, and D. Izzo, Advanced Global Optimisation for Mission Analysis and Design, Tech. rep., European Space Agency and The University of Reading, 2004.

[17] J. A. Sims, J. M. Longuski, and A. J. Staugler, "Vto Leveraging for Interplanetary Missions: Multiple-Revolution Orbit Techniques," Journal of Guidance, Control, and Dynamics, vol. 20, no. 3, pp. 409-415, 1997.

[18] S. Campagnola and R. P. Russell, "Endgame problem part 1: Vo-leveraging technique and the leveraging graph," Journal of Guidance, Control, and Dynamics, vol. 33, no. 2, pp. 463475, 2010.

[19] L. Casalino, G. Colasurdo, and D. Pastrone, "Simple strategy for powered swingby," Journal of Guidance, Control, and Dynamics, vol. 22, no. 1, pp. 156-159, 1999.

[20] R. R. Bate, D. D. Mueller, and J. E. White, Fundamentals of Astrodynamics, Dover Publications, 1971, http://www. worldcat.org/isbn/0486600610.

[21] R. Storn and K. Price, "Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces," Journal of Global Optimization, vol. 11, no. 4, pp. 341-359, 1997.

[22] S. Das and P. N. Suganthan, "Differential evolution: a survey of the state-of-the-art," IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 4-31, 2011.

[23] J. Brest, B. Boskovic, S. Greiner, V. Zumer, and M. S. Maucec, "Performance comparison of self-adaptive and adaptive differential evolution algorithms," Soft Computing, vol. 11, no. 7, pp. 617-629, 2007.

[24] L. Casalino, G. Colasurdo, and D. Pastrone, "Optimization of AV earth-gravity-assist trajectories," Journal of Guidance, Control, and Dynamics, vol. 21, no. 6, pp. 991-995, 1998.

[25] L. Casalino and G. Colasurdo, "Optimal deltav-earth-gravityassist trajectories in the restricted three-body problem," in AAS/AIAA Astrodynamics Specialist Conference, Girdwood, AK, USA, August 1999.

Lorenzo Federici (iD), Alessandro Zavoli (iD), and Guido Colasurdo (iD)

Department of Mechanical and Aerospace Engineering, Sapienza-University of Rome, Via Eudossiana 18, Rome, Italy

Correspondence should be addressed to Alessandro Zavoli; alessandro.zavoli@uniroma1.it

Received 31 March 2018; Accepted 9 July 2018; Published 9 August 2018

Academic Editor: Linda L. Vahala

Caption: Figure 1: Trajectory sketch for an intermediate leg.

Caption: Figure 2: Migration scheme: forward (red) and backward (blue), for the 16-island case.

Caption: Figure 3: Velocity before (-) and after (+) the flyby.

Caption: Figure 4: Tisserand graph for the Jovian planetary system. Contour lines of constant [v.sub.[infinity]], at steps of 2% of [V.sub.m]. Sample resonant orbits with Europa and corresponding maximum-deviation curves for a minimum flyby altitude [h.sub.[pi],min] = 30 km are also depicted.

Caption: Figure 5: [DELTA]V-EGA trajectory.

Caption: Figure 6: Jovicentric trajectory of solution A.

Caption: Figure 7: Tisserand graph of solution A. Axes are normalized with respect to Europa semi-major axis.

Caption: Figure 8: Jovicentric trajectory of solution B.

Caption: Figure 9: Tisserand graph of solution B. Axes are normalized with respect to the Europa semi-major axis.

Caption: Figure 10: Jovicentric trajectory of solution C.

Caption: Figure 11: Tisserand graph of solution C. Axes are normalized with respect to the Europa semi-major axis.

Table 1: Solution "A"-mission features. Event Time [days] [v.sub.[invinity] Resonance DSM [m/s] [m/s] 0 Departure 0.00 4:1 1.931 A Eu flyby 7.07 3683.4 7:2 13.09 B Eu flyby 32.13 3519.7 3:1 15.16 C Eu flyby 42.74 3351.2 5:2 21.00 D Eu flyby 60.46 3150.8 2:1 97.19 E Eu flyby 67.29 2353.0 7:4 40.55 F Eu flyby 91.98 2016.7 3:2 62.49 G Eu flyby 102.39 1560.1 4:3 56.11 H Eu flyby 116.33 1176.8 6:5 60.56 I EOI 137.32 803.2 715.18 Totals 137.32 1083.27 Table 2: Solution "B"-mission features. Event Time [days] [m/s] Resonance DSM [m/s] 0 Departure 1.40 4:1 0.01 A Eu flyby 8.56 3702.4 7:2 14.65 B Eu flyby 33.36 3518.4 3:1 16.32 C Eu flyby 43.96 3335.6 5:2 21.58 D Eu flyby 61.67 3127.5 2:1 79.93 E Eu flyby 68.60 2478.3 7:4 57.09 F Eu flyby 93.26 2012.6 3:2 63.14 G Eu flyby 103.67 1548.9 4:3 55.76 H Eu flyby 117.62 1166.5 6:5 59.85 I EOI 137.21 797.0 712.76 Totals 137.88 1081.10 Table 3: Solution "C"-mission features. Event Time [days] vo [m/s] Resonance DSM [m/s] 0 Departure 3.03 4:1 0.64 A Eu flyby 10.05 3769.2 7:2 0.47 B Eu flyby 34.92 3772.7 3:1 0.01 C Eu flyby 45.58 3772.7 5:2 0.63 D Eu flyby 63.34 3767.9 2:1 0.05 E Eu flyby 70.45 3767.8 5:3 0.06 F Eu flyby 88.22 3767.7 0.11 G Ga flyby 95.65 2666.3 0.01 H Eu flyby 99.68 1784.5 4:3 90.24 I Eu flyby 113.61 1213.2 6:5 67.19 J EOI 134.59 806.9 716.64 Totals 131.56 882.04

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article |
---|---|

Author: | Federici, Lorenzo; Zavoli, Alessandro; Colasurdo, Guido |

Publication: | International Journal of Aerospace Engineering |

Date: | Jan 1, 2018 |

Words: | 8056 |

Previous Article: | Effective Computational Approach for Prediction and Estimation of Space Object Breakup Dispersion during Uncontrolled Reentry. |

Next Article: | Nonlinear Disturbance Observer-Based Adaptive Sliding Mode Control for a Generic Hypersonic Vehicle. |

Topics: |