Professional Documents
Culture Documents
Geometric and Numeric Techniques in Optimal Orbital Transfer Using Low
Geometric and Numeric Techniques in Optimal Orbital Transfer Using Low
1 Introduction
In this article we consider the orbit transfer in the two and three bodies problem,
using low propulsion. In the rst case, the model is given by Kepler equation
q u
q̈ = − 3 + (1)
|q| m
when m represents the mass of the satellite, subjected to ṁ = −δu and the
control satises the constraint |u| ≤ ² where ² is a small parameter.
The physical optimal control amounts to maximise the nal mass and this leads
to
Z tf
Minu(.) |u|dt
0
where tf is the transfer time. From the Pontryagin's Maximum Principle [18],
xing the boundary conditions, e.g a transfer from a low eccentric to a geo-
stationary orbit, an optimal solution can be numerically computed, using a
shooting algorithm. This leads to a complicated numeric problem. In [14], the
following numerical scheme is proposed : compute the optimal solution using
the convex homotopy.
Z tf
Minu(.) (λ|u|2 + (1 − λ)|u|)dt,λ ∈ [0, 1]
0
1
wich amounts to regularize the L1 -minimization problem into a L2 -problem.
This was the starting point of the use of continuation methods in orbital trans-
fer, when low propulsion is applied, see also [9] for the use of the continuation
method in the time minimal control problem, where the homotopy parameter
is the bound of the maximal amplitude of the trust.
1 5 − 4e2 2
H= 5 [18n2 p2n + 5(1 − e2 )p2e + pθ ] (2)
8n 3 e2
where n is the mean motion, e is the eccentricity and θ the angle of the pericenter
where the singularity e = 0 corresponds to circular orbits. Moreover (n, e, θ)
are orthogonal coordinates for the Riemannian metric associated to H :
5 5
dn2 2n 3 2n 3
g= 1 + 2
de2 + dθ2 .
9n 3 5(1 − e ) 5 − 4e2
2 5
r= n 6 , φ = arcsine
5
→
−
Such an Hamiltonian ow H is Liouville integrable and the metric is the above
normal form captures the main properties of the averaged orbital transfer. In-
deed, one can extract from g the following 2D-Riemannian metrics :
2
• g2 = dφ2 + G(φ)dθ2 wich represents the restrition of the metric to r2 = c2
and describes by homogeneity the orbit transfer, in the general case.
A generalization of the results of [21] will allow for the metric g2 to compute
the conjugate and cut loci and to get a global optimality solution for the aver-
aged optimal control problem. This is the starting point to analyse the original
optimal control problem, using a continuation method.
q being the position of the spacecraft, %1 represents the distance to the earth
with mass 1 − µ located at (−µ, 0) and %2 the distance to the moon with mass
µ and located at (1 − µ, 0), while µ ' 0.012153 is a small parameter. The
Hamiltonian elds associated to the control are given by :
3
2 Geometric and numeric methods
2.1 Maximum principle
R tf 2
We consider the energy minimization problem
Pm Minu(.) 0 |u| dt, for a smooth
control system of the form ẋ = F0 (x(t))+ i=1 ui (t)Fi (x(t)) = F (x(t), u(t)), x ∈
X , the set of admissible controls is the subset U of L∞ [0, tf ] of measurable
mappings u(.) with corresponding trajectory q(.) dened on the whole [0, tf ].
The Pontryagin maximum principle [18] tells us the following
Proposition 2.1. If (x, u) is an optimal pair on [0, tf ], then there exists an
absolutely continuous adjoint vector p ∈ Tx∗ X such that on [0, tf ] we have
∂H
ẋ = ∂p (x, p, u)
(3)
ṗ = − ∂H
∂x (x, p, u)
and
4
The following standard geometric result is crucial.
−→
Proposition 2.2. Let L0 be the ber Tx∗0 X and Lt = expt(Hn )(L0 ) be the
image by the one-parameter subgroup generated by Hn . Then Lt is a Lagrangian
manifold whose tangent space at z(t) is generated by the Jacobi elds wich are
vertical at t = 0.
Denition 2.3. We x x0 = x(0) and we dene for t ∈ [0, tf ] the exponential
mapping
where z(t, z(0)), with z(0) = (x(0), p(0)), denotes the normal extremal starting
at t = 0 from z(0).
Denition 2.4. Let z=(x,p) be the reference normal extremal. The time tc ∈
[0, tf ] is called conjugate if the mapping expx0 ,tc is not an immersion at p(0).
The associated point x(t) is said to be conjugate to x0 . We denote by t1,c the
rst conjugate point and C(x0 ) the conjugate locus formed by the set of rst
conjugate points, at time tf , when we consider all the normal extremal starting
from x0 .
Let us note that the conjugate time notion admit the following generaliza-
tion.
Remark . The concept of conjugate point is related to the necessary and su-
cient optimality conditions, under generic assumptions, see for instance [6].
5
2.4.1 Shooting equation
One considers a family Hλ , λ ∈ [0, 1] of smooth Hamiltonians on T ∗ X associated
to normal extremals of an energy minimization problem and we x the boundary
conditions x0 , x1 and the transfer times. This leads to the family expλx0 ,tf (p0 )
of exponential mappings. Using the notation E λ : p0 −→ expλx0 ,tf (p0 ). One
must solve the shooting equation E λ (p0 ) = x1 . The following result follows
immediately :
Proposition 2.3. For each λ, the shooting equation is of maximal rank if and
only if the point x1 is not conjugate to x0 for the corresponding λ. Moreover, in
this case, the solutions of the shooting equation contain a smooth branch, wich
can be parametrized by λ and the derivative E 0λ can be generated integrating the
Jacobi equation.
From the above proposition, to ensure the convergence of the method one
must control :
• The distance to the conjugate loci.
• The branch has to be dened on the whole interval [0,1].
This second point is related to two standard problems in optimal control : exis-
tence of Lipschitzian minimizers and hence solutions of the maximum principle,
see [22] and compactness of the domain of the exponential mapping.
6
Theorem 2.1. Let gλ , λ ∈ [0, 1] be a smooth family of complete Riemannian
metrics on M . Let us x the initial point x0 . Denote iλ (x0 ) the distance from
x0 to the cut locus Cut
λ
(x0 ) and by iλ = infx(0) iλ (x0 ) the injectivity radius of
the corresponding metric. Then :
• For length shorter than infλ iλ (x0 ), the continuation method with initial
condition of the shooting equation at x0 converges.
• For length shorter than infλ iλ the continuation method converges for every
initial condition for the shooting equation.
Remark : in the Riemannian case, the situation is neat ; completness leads to
existence of smooth normal minimizers, the domain of the exponential mapping
is the sphere and estimates of the injectivity radius are related to the curva-
ture concept. In the general case such estimates are a dicult problem and a
pragmatic point of view is to have numeric estimates. This leads to the next
section.
Numeric methods
They are implemented in the Cotcot (Conditions of Order Two, COnjugate
Times) whose aim is to provide the numerical tool :
−→
• to integrate the smooth Hamiltonian vector eld Hn
• to solve the associated shooting equation
• to compute the corresponding Jacobi elds along the extremals
• to evaluate the resulting conjugate points
The code is written in Fortran language, while automatic dierentiation is used
to generate the Hamiltonian dierential equation and the variational one. For
the users the language is Matlab, see [6] for a precise description of the Cotcot
code, with the underlying algorithms : ODE integrators, Newton method solver.
The conjugate point test consists in checking a rank condition wich is based on
two methods : evaluating zeros of a determinant or a SVD ( Singular Value
Decomposition). The continuation method will be included in the code which
can be a simple discretization of the homotopy path, with a Newton method at
each step or a numeric continuation of the path, using the implicit ODE, where
the Newton method is used only at the rst step to initialize the continuation
and at the nal step, to solve the nal shooting equation with arbitrary accuracy.
7
where q = (q1 , q2 ) is the position and the state of the system is x = (q, q̇) ∈ R4 .
1
We denote by H0 (q, q̇) = 12 q̇ 2 − |q| the Hamiltonian of the free motion. We have
the following rst integrals :
• C = q ∧ q̇ (momentum)
q
• L = − |q| + q̇ ∧ C (Laplace integral)
We have the following.
Proposition 3.1. The domain Σe = {(q, q̇); H < 0, C 6= 0} called the elliptic
domain is lled by elliptic orbits and to each orbit (C, L) corresponds an unique
(oriented) ellipse
To represent the space of ellipses, one introduce the following geometric
coordinates :
• θ : angle representing the argument of the pericenter
• e : eccentricity. The eccentricity vector being −
→
e = (ex , ey ), ex = e cos(θ)
ey = e sin(θ).
• a : semi-major axis of the ellipse related to the semi-latus rectum by the
P
relation a = √1−e 2
.
q̇ ∂
• The tangential/normal frame {Ft , Fn } where Ft = |q̇| ∂ q̇
The control is rescaled with u = εv to introduce the small parameter ε and the
trajectories parameterized by l are solutions of
Pm
dx vi Fi (x, l)
= ε i=1
dl g0 (x, l)
8
whenever the cost takes the form
Z l(T ) X
m
vi2 (l)
ε2 dl .
l(0) i=1 g0 (x, l)
We assume that l(0) and l(T ) are xed. The cost extended system takes the
form Pn Pm 2
dx i=1 vi Fi (x, l) d c v (l)Fi (x, l)
=ε , = ε i=1 i
dl g0 (x, l) dt ε g0 (x, l)
and we rescale c into c̄ = εc .
The associated pseudo-Hamiltonian is
Xm
ε
H̃(x, p, l, v) = (p0 |v|2 + vi Hi (x, p, l))
g0 (x, l) i=1
Remark . According to this lemma, the rank of w̄(x) is not smaller than m if
the Fi0 s are m independent vector eld and we can only expect it to increase.
The geometric interpretation is straightforward. From the maximum principle,
an extremal control is computed as mapping of the form u(x, p, l) which is 2π -
periodic with respect to l. Hence, the corresponding trajectory is solution of the
9
averaged dierential equation. The oscillations induced by l which act as a fast
variable generate new control directions, namely Lie brackets in the linear space
E1 (t) = Span{adk F0 · Fi ; k ≥ 0, i = 1, · · · , m}. Moreover, generically we can
expect to generate all the Lie brackets in E1 (t) to provide an averaged system
of full rank.
Denition 3.2. The averaged system is said to be regular if the rank of w̄(x)
is a constant k .
In this case, there exists an orthogonal matrix R(x) such that if P = R(x)p
then w̄(x) is written as a sum of squares
k
1X
λi (x)Pi2
2 i=1
where the Fi 's are smooth vector elds on X . We deduce the following propo-
sition.
Proposition 3.2. If the averaged system is regular of rank k, the averaged
Hamiltonian H can be written as a sum of squares
k
1X 2
H= H , Hi = hp, Fi i
2 i=1 i
10
Corollary 3.1. If tF is the transfer time lF − l0 then tF ε → M constant as
ε → 0.
Proof. If we consider the SR-problem, it is equivalent
Pk to a time-minimal control
problem where the controls satisfy the bounds i=1 u2i (t) = 1 which amounts
to x the level set of the Hamiltonian to 1/2. By homogeneity, rescaling u into
εu, rescales the transfer time from t to t/ε. Therefore, the relation tF ε → M is
exact in the SR-case and the same is true for the original problem asymptotically
as ε → 0 since it is approximated by the SR-problem.
P 5/4
H1 = W (pex sin l − pey cos l)
P 5/4 2P ex +cos l ey +sin l
H2 = W [pp W + pex (cos l + W ) + pey (sin l + W )]
11
Substituting these expressions, we obtain the averaged Hamiltonian.
Proposition 3.4. We have
P 5/2
H(x, p) = [4p2 P 2 (−3 + 5(1 − e2 )−1 ) +
4(1 − e2 )5/2 p
p2ex (5(1 − e2 ) + e2y ) + p2ey (5(1 − e2 ) + e2x ) − 20Pp p2ex − 20Pp p2ey − 2pex pey ex ey ] .
12
L1 1 n L3
2 3
L2 ex
3.4.1 Analysis of g1
θ is a cyclic coordinate and pθ a rst integral. If pθ = 0 then θ is constant. The
corresponding extremals are geodesics of the 2D-Riemannian problem dened
by dθ = 0. We extend the elliptic domain to
Σ0 = {n > 0, e ∈] − 1, +1[, e = ex , ey }
Proposition 3.7. The extremals of the averaged coplanar transfer are straight
lines in the domain Σ0 in suitable coordinates, namely
13
In order to complete the analysis of g and to understand the role of g2 , we
present now the integration algorithm.
Lemma 3.6. Let dT = dt/4n5/3 then if H 00 (0) 6= 0, T (t) = 2√1|∆| [arctan L(s)]t0
where L(t) = 2at+b
√ , a = c1 , b = ṡ(0) and ∆ = − 25
2 H (0) is the discriminant of
00
|∆|
s(t).
This allows to make the integration. Indeed if H 00 = 0, pe = pθ = 0 and
the trajectories are straight lines (the line S in Figs. 1). Otherwise, we observe
that n5/3 (t) is known and depends only upon n(0), pn (0) and H which can be
xed to 1/2 by parameterizing by arc-length. Hence, it is sucient to integrate
the ow associated to H 00 using the parameter dT = 4ndt5/3 where T is given by
the previous lemma.
We proceed as follows. Let H 00 = c23 and pθ = c2 . Using pe = ė/10(1 − e2 ),
we obtain
20(1 − e2 )
ė2 = [c3 e2 − (5 − 4e2 )c22 ] .
e2
To integrate, we set for e ∈]0, 1[, w = 1 − e2 and the equation takes the form
dw
= Q(w)
dT
where
Q(w) = 80w[(c23 − c22 ) − (c23 + 4c22 )w]
with positive discriminant. Hence the solution is
1 c23 − c22 √ q
w= [1 + sin(4/ 5 c23 + 4c22 )T + K] ,
2 c23 + 4c22
14
K being a constant. We deduce that
Z T
1 + 4w(s)
θ(T ) = θ(0) + 2c2 ds
0 1 − w(s)
where θ(0) can be set to 0 by symmetry. To conclude, we must compute
R T 1+4w(s) p
0 1−w(s)
ds with w = K1 (1 + sin x) and x = √45 c23 + 4c22 s + K . Therefore,
we must evaluate an integral of the form
Z
A + B sin x
dx
C + D sin x
which is a standard exercise. More precisely, the formula is
Z Z
A + B sin x B dx
dx = x + AD − BC
C + D sin x D C + D sin x
with Z
dx 2 C tan(x/2) + D
=√ arctan( √ )
C + D sin x C 2 − D2 C 2 − D2
for C 2 − D2 > 0 in our case. The previous lemmas and computations give:
Proposition 3.8. For H 00 6= 0, the solutions of H ~ can be computed using
elementary functions and we get
n(t) = ( 25 2
2 Ht + 15n(0pn (0)t + n
5/3
(0))3/5
1
e(t) = (1 − 2 K1 (1 + sin K2 (t)))1/2
K (t)
θ(t) = θ(0) + 2|p pθ
θ|
K3 [−4x + K 10
3
arctan( (1−K1 ) tan(x/2)−K
K3 )]K2
2
1/2−p2 p
with K = arcsin( 1−e(0) K1
−1
), K1 = 21 1/2+4pθ2 , K2 (t) = √45 1/2 + 4p2θ (T (t) + K)
r θ
5p2θ
and K3 = 1/2+4p 2 . For H
00
= 0, they are straight lines.
θ
15
π−φ0
φ
φ0
0 θ θ
1
g2 = (Eµ (φ)dφ2 + sin2 φdθ2 )
Eµ (φ)
√
where µ = 1/ 5. We deduce the following lemma:
Lemma 3.10. Both extremals x1 and x2 share the same pr (0) and for each t,
r1 (t) = r2 (t).
16
0
If we consider now the integral curves of H 0 where H = 12 p2r + H
r 2 on the
dt
xed induced level and parameterizing these curves using dT = r2 , we deduce
the following characterization.
Proposition 3.9. The following conditions are necessary and sucient to char-
acterize extremals of H 00 6= 0 intersecting with the same length
p2θ (0) p
2H 0 = p2φ (0) + = λ2 (ε), λ(ε) = 1 − ε2 .
G(φ(0))
t̄ + ε ε
T1 = arctan[ ] − arctan[ ].
λ(ε) λ(ε)
Clearly, the maximum of the right member is π , taking ε < 0, |ε| → 1. Hence,
it can be satised since t1 < π . The at case shows that it is the sharpest
bound.
17
3.4.5 Riemann Curvature and Injectivity Radius in Orbital Transfer
Using standard formulae from Riemannian geometry [11], we have the following
proposition.
Proposition 3.10. Let g be a smooth metric of the form dr2 +r2 (dφ2 +G(φ)dθ2 )
with x = (x1 , x2 , x3 ) = (r, θ, φ) the coordinates. Then the only non-zero compo-
nent of the Riemann tensor is
which takes the form R2323 = −r2 F (F 00 + F ) if we set G(φ) = F 2 (φ). We have
therefore R2323 = 0 if and only if F (φ) = A sin(φ + φ0 ) which is induced by the
at case in spherical coordinates.
Hence, the main non-zero sectional curvature of the metric is
R2323
K= ∂ ∂ 2
| ∂θ∧ ∂φ |
and KV → 0 as r → +∞.
Proposition 3.11. The Gauss curvature of the metric on S 2 , g2 = dφ2 +
5 sin2 φ
G(φ)dθ2 with G(φ) = 1+4 cos2 φ is
5(1 − 8 cos2 φ)
KV = .
(1 + 4 cos2 φ)2
Theorem 3.2. The Gauss curvature of g2 is negative near the poles and
√ max-
imum (constant equal to 5) at the equator. The injectivity radius is π/ 5 and
is reached by the shortest conjugate point along the equator.
Proof. Clearly K is maximum and constant equal to 5 along the equator which
is an extremal solution. Hence a direct computation √ gives that the shortest
conjugate point is along the equator with length π/ 5. It corresponds to the
injectivity
√ radius if the half-length of a shortest periodic extremal is greater
than π/ 5. Simple closed extremals are computed in [Bonnard,Caillau, Forum]
using the integrability property but a simple reasoning gives that the shortest
corresponds to meridians with length 2π . Hence the result is proved.
√ p
Corollary 3.3. Since π/ 5 < π 2/5, the necessary optimality condition of
theorem 3.2 is not satised in orbital transfer for the extension of the metric to
R+ × S 2 .
18
π−φ0
φ
φ0
19
cut locus from the conjugate locus. Also a domain bounded by two intersecting
minimizing curves must contain a conjugate point.
In this case, the conjugate locus can be easily computed using the Cotcot
code. In such a situation, it can also be deduced by inspecting the extremal ow
only, the conjugate locus being an envelope. Finally, we observe that in order to
have intersecting minimizers, we must cross the equator φ = π for which e = 1.
The same is true for conjugate points. Hence we deduce:
Theorem 3.4. Conjugate loci and separating lines of the averaged Kepler met-
ric in the spaces of ellipses for which e ∈ [0, 1[ are always empty.
20
π−φ
0
φ
φ0 φ0
Figure 4: Conjugate and cut loci in averaged orbital transfer (tangential case)
21
3 3
2.5 2.5
2 2
φ
φ
1.5 1.5
1 1
0.5 0.5
0 0
0 0.5 1 1.5 2 2.5 3 0 0.5 1 1.5 2 2.5 3
θ θ
Figure 5: Extremal ow of g2 in the full control and tangential cases, in the
(φ, θ) coordinates, starting from φ = π/6
e = sin φ
and p
e = sin φ 1 + cos2 φ .
The ows in the two cases are presented on Fig. 5 and reveal the similar
structure and the conjuagte locus reached after having crossed the equator.
22
3.7 Conjugate and cut loci on a two-sphere of revolution
The problem of computing the conjugate and cut loci is connected to a very old
geometric problem wich goes back to Jacobi wich is briey introduced next.
Denition 3.3. The two-sphere S2 encowed with a smooth metric of the form
dφ2 + G2 (φ)dθ2 in spherical coordinates is called two-sphere of revolution.
Many of them can be realized as 2D-Riemannian surfaces of revolution em-
bedded in R3 by rotating on smooth curve homeomorphic to an half-circle.
The classical examples are the following :
23
The Gauss curvature is given by :
Here if 0 < λ ≤ 2, then Kλ is monotone non decreasing from the North pole
to the Equator and the previous theorem asserts that the one parameter has a
cutlocus reduced to a simple branch for λ ∈]0, 2].
If λ > 2 the Gaussian curvature Kλ is not monotone and the theorem can-
not be applied. In particular the orbit transfer with full control corresponds to
λ = 4, while at the limit case λ = +∞ a singularity appears : The Riemannian
metric has a pole at the equator , this situation being similar to the one occuring
when the thrust is only tangential. Hence the theorem 3.5 has to be rened to
deal with such situations. the nal result is coming from [5] .
Denition 3.4. The rst return mapping to the equator is the map :
π
R : pθ ∈]0, G( )[−→ ∆θ(pθ )
2
where ∆θ is the θ-variation of the extremal parametrized by arc-length and
associated to the adjoint pθ . The extremal ow is called tame is the rst return
mapping is monotone non-increasing for pθ ∈]0, G( π2 )[.
Theorem 3.6. In the tame case, the cut locus of a point dierent frame a
pole is a suset of the antipodal parallel. If moreover R0 (pθ ) < 0 < R00 (pθ ) on
]0, G( Π2 )[ then the conjugate locus of such a point has exactly four cusps.
Remark . This result can be extended to the singular case.
24
where the Hamiltonian is :
XN N
X
k pi k2 Gmi mj
H= − U , U (q) = .
i=1
2mi k qi − qj k
1≤i<j≤N
A restricting case being the coplanar situation where the N masses are in a plane
R2 . In this case the Galilean reference frame can be replaced by a rotating frame
dened by
µ ¶ µ ¶
0 1 cos ωt sin ωt
K= , exp(ωtK) = ,
−1 0 − sin ωt cos ωt
ui = exp(ωtK)qi , vi = exp(ωtK).
XN N N
k v k2 X t X Gmi mj
H= − w ui Kvi −
i=1
2mi i=1
k qi − qj k
1≤i<j≤N
25
1−µ µ
where −V is the potential of the system dened by V = %31
+ %32
. The system
can be written using Hamiltonian formalism setting :
q1 = x, q2 = y , p1 = ẋ − y , q2 = ẏ + x,
and the Hamiltonian describing the motion takes the form
1 2 1−µ µ
H0 (q1 , q2 , p1 , p2 ) = (p + p22 ) + p1 q2 − p2 q1 − − ,
2 1 %1 %2
26
4.5 The continuation method
The (mathematical) continuation method in the restricted circular problem is
omnipresent in Poincaré work, in particular for the continuation of circular or-
bits. Geometrically, it is simply a continuation of trajectories of Kepler problem
into trajectories of the 3-Body problem. It amounts to consider µ as a small
parameter, the limit case µ = 0 being Kepler-problem in the rotating frame,
writing :
k p k2 t 1
H0 = − qKp − + o(µ).
2 kqk
and the approximation for µ is valid, a neighborhood of the primaries being
excluded. In the Earth-Moon problem, since µ is very small, the Kepler-problem
is clearly a good approximation of the motion in a large neighborhood of the
Earth. This point of view is important in our analysis, as indicated by the
status report of the SMART-1 mission since most of the time mission is under
the inuence only of the Earth attraction, see [19] and [20].
27
4.5.2 Boundary conditions and shooting equation the Earth-L2 trans-
fer
As a rst approach we choose to simulate the Earth-L2 transfer in the restricted
three-Body problem. Indeed, at the limit case µ = 0, the Moon and the point L2
are identical. Moreover, in the Earth-Moon system, the point L2 and the Moon
are located very closely. As a result, the rst phase of a Earth-Moon transfer is
comparable to a Earth-L2 transfer. Solving the shooting function associated to
the Earth-L2 transfer is consequently usefull to provide a good approximation
of the solution of the Earth-Moon transfer shooting function.
Denoting x = (q, q̇) ∈ R4 , the control system in the rotating frame associated
to µ ∈ [0, 21 ] is equivalent to
where
x3
x4
F0 (x) = x1 +µ x1 −1+µ
2x4 + x1 − (1 − µ) ((x +µ)2 +x2 ) 32 − µ ((x −1+µ)2 +x2 ) 32
1
x2
2 1
x2
2
−2q3 + x2 − (1 − µ) 2 2
3 − µ
2 2
3
((x1 +µ) +x2 ) 2 ((x1 −1+µ) +x2 ) 2
0 0
0 0
F1 (x) =
1 , F2 (x) =
.
0
0 1
Using the circular orbit around the Earth to approximate the stationary one,
we set as initial condition x0 = (1 − µ + 0.1099, 0, 0, 2.8792). The L2 point is
located on (xL2 , 0) with xL2 solution of the equation :
(1 − µ)(x + µ) µ(x − 1 + µ)
x− − = 0.
%31 %32
Since we want to reach L2 with a speed of zero, we x the target xtf =
(xL2 , 0, 0, 0). The energy minimization problem with xed time transfer tf can
consequently be written
ẋ = F0 (x) + F1 (x)u1 + F2 (x)u2 ,
Rt
(Pµ ) Minu(.) t0f u21 + u22 dt
x(0) = x0 , x(tf ) = xf
The maximum principle is applied which asserts that in the normal case p0 < 0,
extremals of the problem are solutions of the Hamiltonian system
½ −
→
ż = H (z)
(5)
z(0) = (x0 , p0 )
28
P2 P2
with H(x, p) = i=1 Hi2 (x, p) = i=1 (< p, Fi (x)> )2 . This leads to solve the
shooting equation S(p0 ) = 0 where S is the shooting equation dened by
S : R4 −→ R4
p0 −→ expx0 ,tf (p0 ) − xf
At each step, the rst conjugate time tc,1 along the extremal have been
computed to ensure the necessary condition of convergence of the continuation
method tc,1 > tf . The conjugate time test follows the next principle : since
the time transfer is xed, the domain of expx0 ,tc is locally dieomorphic to
R4 . One has to compute numerically the Jacobi elds Ji (t) = (δxi (t), δpi (t)),
i = 1,..,4 corresponding to the initial condition δxi (0) = 0 and δpi (0) = ei ,
where {ei , i = 1,..,4} represents the canonical basis of R4 and to compute rank
(δx1 (t), .., δx4 (t)) which is equal to 4 outside a conjugate and being lower than
or equal to 3 at a conjugate time.
Additionally, the euclidian norm of the extremal control have been plotted to
stand a comparison between the control bound and the maximal thrust allowed
by electro-ionic engines used while the SMART-1 mission.
29
Figure 6: Earth-L2 trajectory in rotating frame, µ = 0.
0.8
0.6
0.4
0.2
−0.2
−0.4
−0.6
−0.8
−1 −0.5 0 0.5 1
30
100
80
arcsh det(δ x) 60
40
20
0
0 100 200 300 400 500 600 700
t
10
6
σn
0
0 100 200 300 400 500 600 700
t
31
Figure 10: Earth-L2 trajectory in rotating frame, µ = 0.012153.
0.8
0.6
0.4
0.2
−0.2
−0.4
−0.6
−0.8
−1 −0.5 0 0.5 1
32
Figure 12: First conjugate time, Earth-L2 transfer, µ = 0.012153.
33
The numerical continuation method considering µ as a small parameter led
to deduce an extremal trajectory of the energy minimization Earth-L2 trans-
fer problem from one corresponding to the Kepler case, in accordance with the
Poincaré Work. We checked that the rst conjugate time along each extremal
is higher than the time transfer, that was needed for the convergence of the
method. Moreover the second order optimality conditions ensure that the com-
puted extremals are locally energy minimizing in L∞ ([0, tf ]). We also note that
in both cases µ = 0 and µ = 0.012153, the maximum value reached by the
norm of the extremal control is highly inferior to the bound k u k≤ 0.08 which
corresponds to the maximal thrust of the Smart-1 electro-ionic engine (0.073
N). As one can see, we actually found a maximal bound of the norm of extremal
control twice lower than the one associated to Smart-1, the time transfer being
the same.
4.5.4 Boundary conditions and shooting function for the the Earth-
Moon transfer.
The second part of our trajectories analysis has been devoted to the Earth-Moon
transfer. We used the same dynamics and initial condition as previously. In this
case, the circular orbit around the Moon, denoted OL and is dened by :
(x1 − 1 + µ)2 + x22 = 0.0017
OL = (x1 , x2 , x3 , x4 ) ∈ R4 , x23 + x24 = 0.2946
< (x1 − 1 + µ, x2 ), (x3 , x4 ) >= 0.
h : R4 −→ R3
(x1 − 1 + µ)2 + x22 − 0.0017
x −→ x23 + x24 = 0.2946 ,
< (x1 − 1 + µ, x2 ), (x3 , x4 ) >
S : R4 −→ R4
µ ¶
h ◦ Πx (z(tf , z(0))
p0 −→
h0 (Πx (z(tf , z(0))).Πx (z(tf , z(0))
34
4.5.5 Numerical continuation method for the Earth-Moon transfer.
The time transfer is xed to 124 time units of the restricted 3-body problem and
the spacecraft mass remains 350 kg, see [19] and [20]. The extremal trajectory
corresponding to µ = 0 was computed using the simple shooting method and
initializing p0 with the initial costate vector associated to the Earth-L2 transfer.
The step of the variation parameter µ is 10−3 .
The Earth-Moon trajectories in both rotating and xed frames, the rst fo-
cal time and the norm of extremal control from Fig. 14 to Fig.21 for µ = 0 and
µ = 0012153.
35
0.8
0.6
0.4
0.2
−0.2
−0.4
−0.6
−0.8
0.8
0.6
0.4
0.2
−0.2
−0.4
−0.6
−0.8
−1 −0.5 0 0.5 1
36
50
arcsh det(δ x)
0
−50
−200 −180 −160 −140 −120 −100 −80 −60 −40 −20 0
t
0.8
0.6
σn
0.4
0.2
0
−200 −180 −160 −140 −120 −100 −80 −60 −40 −20 0
t
Figure 16: First focal time and norm of extremal control, Earth-Moon transfer,
µ = 0.
37
0.6
0.4
0.2
−0.2
−0.4
−0.6
0.8
0.6
0.4
0.2
−0.2
−0.4
−0.6
−0.8
−1 −0.5 0 0.5 1
38
50
arcsh det(δ x)
0
−50
−250 −200 −150 −100 −50 0
t
0.1
0.08
0.06
n
σ
0.04
0.02
0
−250 −200 −150 −100 −50 0
t
39
References
[1] Allgower, Eugene L.; Georg, Kurt. Numerical continuation methods. An in-
troduction. Springer Series in Computationnal Mathematics, 13. Springer-
Verlag, Berlin, 1990. xiv+388 pp. ISBN: 3-540-12760-7
[2] Bliss, Gilbert A. Lectures on the Calculus of Variations. University of
Chicago Press, Chicago, Ill., 1946. ix+296 pp.
[3] Bombrum, Alex; Chetboun, Jonathan; Pomet, Jean-Baptiste. Transfert
Terre-Lune en pousse faible par contrôle feedback-La mission SMART-1,
Rapport de recherche INRIA (2006), no.5955, 1-27.
[4] Bonnard, Bernard; Caillau, Jean-Baptiste. Riemannian metric of the aver-
aged energy minimization problem in orbital transfer with low thrust Ann.
Inst. H. Poincaré Anal. Non Linéaire 24 (2007), no. 3, 395-411.
[5] Bonnard, Bernard; Sinclair, Robert; Tanaka, Minoru. Conjugate and cut
loci of a two-sphere of revolution with application to optimal control Ann.
Inst. H. Poincaré Anal. Non Linéaire 26 (2009), no. 4, 1081-1098.
[6] Bonnard, Bernard; Caillau, Jean-Baptiste; Trélat, Emmanuel. Second order
optimality conditions in the smooth case and applications in optimal control
ESAIM Control Optim. and Calc. Var. 13 (2007), no. 2, 207-236.
[7] Bonnard, Bernard; Caillau, Jean-Baptiste; Dujol, Romain. Energy mini-
mization of single-input orbit transfer by averaging and continuation Bull.
Sci. Math. 130 (2006), no. 8, 707-719.
[8] Bonnard, Bernard; Shcherbakova, Natalia; Sugny, Dominique. The smooth
continuation method in optimal control with an application to control sys-
tems, submitted to COCV-ESAIM, 2009.
[9] Bonnard, Bernard; Caillau, Jean-Baptiste. Geodesic ow of the averaged
controlled Kepler equation. Forum math., vol 21, pp. 797-814, 2009.
[10] Caillau, Jean-Baptiste. Contribution à l'étude du contrôle en temps mini-
mal des transferts orbitaux PhD thesis, Toulouse Univ., 2000.
[11] Caillau, Jean-Baptiste. http://apo.enseeiht.fr/cotoct/
[12] do Carmo, Manfredo Perdigaão. Riemannian geometry. translated from
the second Portuguese edition by Francis Flaherty. Mathematics: Theory
& Applications, Birkhäuser Boston, Inc., Boston, MA, 1992. xiv+300pp.
[13] Guerra, Manuel; Sarychev, Andrey. Existence and Lipschitzian regularity
for relaxed minimizers. Mathematical control theory and nance, 231-250,
Springer, Berlin, 2008.
[14] Gergaud, Joseph; Haberkorn, Thomas. Homotopy method for minimum
consumption orbit transfer problem. ESAIM Control Optim. Calc. Var. 12
(2006), no. 2, 294310 (electronic).
[15] Meyer, Kenneth R.; Hall, Glen R. Introduction to Hamiltonian dynami-
cal systems and the N -body problem. Applied Mathematical Sciences, 90.
Springer-Verlag, New York, 1992. xii+292 pp.
40
[16] Poincaré, Henri. Oeuvres Complètes, Gauthier-Villars.
[19] Racca, Giuseppe D.; Foing, Bernard H.; Coradini, Marcello. SMART-1 :
the rst time of Europe to the Moon. Earth, Moon and planets 85-86 (2001)
379-390.
[20] Racca ,G.D & al. SMART-1 mission description and development status.
Planetary and space science 50 (2002), 1323-1337.
[21] Sinclair, Robert; Tanaka, Minoru The cut locus of a two-sphere of revolu-
tion and Toponogov's comparison theorem. Tohoku Math. J. (2) 59 (2007),
no. 3, 379399.
[22]
[23] Szebehely, Victor, Theory of orbits : the restricted problem of three bodies,
41