Abstract
A variety of aerospace trajectory optimization problems are subject to either discontinuities or constraints at intermediate times, which define multiple arcs with distinctive governing equations. This work addresses multi-arc optimal control problems, with special interest regarding aerospace trajectories, and specifically focuses on the multipoint corner conditions that belong to the complete set of necessary conditions for an extremal, in the context of a general formulation. This includes intermediate times and states in the objective functional, together with unknown time-independent parameters. This study shows that 16 cases can occur for the multipoint corner conditions and groups them into three classes. Explicit, closed-form solutions of the multipoint corner relations are identified in each class, if certain conditions are met. In an indirect solution approach, these explicit expressions can be employed sequentially, thus reducing the number of unknowns of multi-arc problems to the same number of single-arc optimal control problems. This is extremely useful in the presence of a large number of arcs. Two challenging aerospace trajectory optimization problems are analyzed as illustrative examples, i.e., (i) the minimum-fuel ascent path of a multistage launch vehicle and (ii) minimum-time low-thrust orbit transfers with eclipse constraints on the available thrust.
1. Introduction
Multi-arc optimal control problems regard dynamical systems governed by differential equations and subject to either discontinuities or constraints at several intermediate times. These discontinuities and constraints can involve the state variables, the control variables, and some time-independent unknown parameters.
The existence of interior points, termed corners, at which discontinuities occur leads to obtaining broken extremals as the optimal solutions for a variety of optimal control problems. The Weierstrass-Erdmann conditions, arising in the calculus of variations, must hold at corners of an optimal solution, in conjunction with all the remaining necessary conditions for optimality [1,2,3,4,5,6,7]. A classic example is represented by the minimum-time light path through two different media, which fulfills Snell’s refraction law [8,9]. In fact, the latter can be obtained as the optimal solution of a minimization problem, in agreement with the Fermat’s principle of least time. In general, broken extremals represent a subject of current research in optimal control theory [10], with focus on the related second-order sufficient conditions as well [11,12,13]. Problems that involve multiple arcs are also referred to as either hybrid optimal control problems, by Garavello and Piccoli [14], or multiprocesses, by Vinter and Clarke [15]. The latter contribution presents a theory of necessary conditions for optimal multiprocesses, including an extended Pontryagin principle. Closely related to this, Dmitruk and Kaganovich [16] derived the necessary conditions that generalize the Pontryagin principle for hybrid systems with a specified number of arcs, whereas Bressan and Hong [17] addressed the rather general class of optimal control problems defined on a stratified domain, composed of finitely many submanifolds of different dimensions, with different dynamics in each manifold.
The usefulness and relevance of the Weierstrass–Erdmann conditions in aerospace applications was recognized by a number of researchers. Bhattacacharya and Bhattacharjee [18] worked on the corner conditions to adapt them to a space navigation problem. For trajectories of powered rockets, Miele [19] identified three types of arcs along extremal solutions, i.e., (i) zero-thrust arcs, (ii) maximum-thrust arcs, and (iii) variable-thrust arcs. He analyzed discontinuous solutions, while considering the Weierstrass–Erdmann corner conditions. In their contributions, Clarke and Vinter [15,20] also describe some applications of the theory of multiprocesses, with special focus on the Fermat’s principle (leading to Snell’s law of refraction), motion of a robotic arm, and a problem on renewable resources. They also mention [15] the identification of the optimal ascent path of a multistage launch vehicle as an application of the theory of optimal multiprocesses.
In a general formulation of multi-arc optimal control problems, the derivation of the first-order necessary conditions for optimality leads to identifying a set of corner relations to enforce at the junction times between two subsequent subarcs. In their general form, these additional conditions do not lead to a closed-form solution for the jump relations of the costate variables at the junction times [21]. However, the author showed that distinct (and coexisting) representations for the state can be profitably used, in conjunction with implicit costate transformation, for the purpose of obtaining an explicit, closed-form sequential solution of the jump relations for the costate [22,23]. In the context of indirect solution approaches, this allows for identifying a parameter set that retains the reduced size of the typical set associated with a single-arc optimization problem.
Building up on prior formulations [15], this work is intended to revisit multi-arc optimal control problems. A general form of corner conditions, which applies to a variety of dynamical systems, are being addressed, using the basic principles of the calculus of variations. This research aims at formulating transitions between different arcs in a rather general way, with the inclusion of time-independent parameters and intermediate times in the objective functional, which reflects in the corner conditions being derived. Moreover, this research aims at investigating and classifying the latter relations, while identifying some sufficient conditions that allow for their explicit sequential solution, which can simplify the implementation of an indirect-type numerical solution methodology, especially if the number of arcs is large. This represents a significant extension and generalization of the preceding analysis by the same author, more focused on specific applications [22,23]. In short, the study that follows has the following major objectives:
- (a)
- derive the complete set of multipoint conditions at corners, in the context of a general formulation of multi-arc optimal control problems, with implicit-form relations for the state at corners and unknown time-independent parameters, accompanied by the inclusion of state and intermediate times in the objective functional to minimize;
- (b)
- provide a systematic classification of the multipoint corner conditions;
- (c)
- analyze all classes of corner conditions, to identify explicit solutions for each class;
- (d)
- show that explicit solutions of the multipoint corner conditions are achievable for two important and challenging aerospace trajectory optimization problems;
- (e)
- illustrate numerical results regarding the challenging minimum-time orbit transfer problem with eclipse arcs.
This paper is organized as follows. Section 2 presents the general formulation of multi-arc optimal control problems, while Section 3 addresses the derivation of the complete set of necessary conditions for optimality, including multipoint corner conditions. These are classified, and their closed-form solution is obtained, if certain conditions are met. Section 4 and Section 5 are focused on two trajectory optimization problems that take advantage from the closed-form, explicit solution of the multipoint corner conditions, i.e., (i) the minimum-fuel ascent path of a multistage launch vehicle and (ii) minimum-time low-thrust orbit transfers with eclipse constraints on the available thrust. Section 6 summarizes the main achievements of this research and contains concluding considerations.
2. Formulation of the Multi-Arc Optimal Control Problem
Multi-arc optimal control problems regard dynamical systems governed by differential equations and subject to either discontinuities or constraints at several intermediate times , with N denoting the number of arcs.
The time-varying -state-vector and -control-vector are defined over each arc k and respectively identify the instantaneous dynamical behavior of the system and the control action; is an absolute continuous vector function, while each component of , denoted with belongs to , which is a Borel measurable set . In each arc k, the time evolution is governed by a set of n ordinary differential equations, written in vector form as
where t is the actual time, which plays the role of independent variable, whereas p represents a -vector of time-independent unknown parameters. Each component of p also belongs to a measurable Borel set, denoted with . The preceding equations are assumed to hold almost everywhere in the respective closed interval of ,
. Moreover, the additional hypotheses introduced by Clarke and Vinter [15] to state and prove the Pontryagin principle for optimal multiprocesses are also assumed to hold. It is worth noting that in the aerospace applications of interest the control variables are piecewise continuous, bounded functions of time, which is a property subsumed by the previously mentioned measurability assumption.
In each arc k, the initial and final state vector are denoted with and , respectively. Some (problem-dependent) boundary conditions hold, in the general form.
- (a)
- is specified, or
- (b)
- is unspecified and no additional condition at exists, or
- (c)
- is unspecified and the following scalar equality constraint holds:
However, case (a) can be reduced to case (c), letting , where
denotes a specified value, while case (b) is equivalent to case (c) if is identically set to 0. This means that case (c) includes the remaining ones and Equation (4) represents a general form for the additional junction condition.
The solution of the multi-arc optimal control problem consists in identifying the optimal parameter set p, the control vector time histories
, the state vector time histories and all the remaining unknown quantities (among
), which minimize the objective functional (in the Bolza form)
where one can recognize the Mayer term, corresponding to , and the remaining part, written as summation of Lagrange terms.
3. First-Order Necessary Conditions for Optimality
This work is specifically focused on the derivation of the extended necessary conditions for optimality, accompanied by a thorough analysis and classification of the different types of corner relations that can occur, with the final intent of identifying some conditions that allow for considerable simplifications in the numerical solution process.
As a first step, the necessary conditions for optimality are derived, leveraging well-consolidated techniques that arise from the calculus of variations. With regard to the dynamical system governed by Equations (1)–(3), with objective functional (5), a set of Hamiltonian functions and an auxiliary function are introduced as
where denotes a set of time-varying adjoint
-vectors conjugate to the governing Equation (1), whereas
,
and represent time-independent adjoint vectors associated with Equations (2), (3), and (4), respectively, with the dimension corresponding to the respective equality constraint. Using Equations (5) and (6), the extended objective functional is defined as
The first differential of function is
where the terms , , and vanish due to Equations (2) and (3). The preceding and following relations refer to weak extremals, under the assumption that the number of arcs N does not change. Then, the differential of the remaining terms of Equation (7) is derived, using the general relation for the differential of an integral [5],
where the symbol denotes the variation, i.e., the time-fixed differential [5]. In Equation (9), the following term is integrated by parts:
The relation (where represents a generic variable) [5] is used in Equation (10), and then the resulting expression is inserted into Equation (9), to yield
However, the last term in the second row of Equation (9) vanishes, because, due to Equation (1),
Combination of Equations (8) and (11) leads to
The first differential must vanish at an optimal solution, regardless of the first differentials and variations, namely ,
,
,
,
,
, and
. This leads to the complete set of first-order necessary conditions for optimality,
accompanied by the multipoint corner conditions
where subscripts ini and fin refer to the initial and final value of the respective variable in each arc. Equation (17), which implies stationarity of with respect to , can be replaced by the Pontryagin minimum principle [7],
where subscript * denotes the optimal value of the corresponding variable. The latter relation is more general than Equation (17) as it is also applicable to the class of measurable (essentially bounded) controls contained in a compact set, unlike Equation (17). Equation (16) is the adjoint equation for the costate variables, accompanied by the related boundary conditions (15) and by the multipoint conditions (20) and (21). Moreover, Equations (14) and (19) hold for the Hamiltonian functions, evaluated at times . It is worth remarking that Equations (14)–(18) are formally identical to the necessary conditions that hold for ordinary (single-arc) optimization problems (with minor adjustments due to the presence of multiple arcs), while Equations (19)–(21) represent additional relations, i.e., the multipoint corner conditions. They are thoroughly investigated in the following subsection.
3.1. Classification of Multipoint Corner Conditions
Multi-arc optimal control problems can be formulated for a variety of dynamical systems, and aerospace trajectories are a remarkable example. The related necessary conditions include a large number of further relations—other than the ordinary necessary conditions of single-arc optimal control problems [5]—i.e., the multipoint corner conditions (19)–(21). They correspond to additional scalar equality constraints. These must be enforced in an indirect numerical solution process, usually needed for problems of practical interest, not amenable to an analytical solution. However, some general simplifying conditions can be identified that allow for the sequential solution of the multipoint corner conditions. This implies that the unknowns of an indirect technique reduce to the same quantities to be found for a single-arc optimal control problem. To identify these simplifying conditions, a preliminary classification of the multipoint corner relations is introduced.
In general, vectors and scalars () are associated with each intermediate (transition) time and are problem-dependent. Omitting superscripts (j) hence forward, the Jacobian matrices and are nonsingular (in specific open sets), as previously remarked. Instead, the following 4 quantities can vanish at time : (i) , (ii) , (iii) , and (iv) . However, the case can be reduced to the case using the implicit function theorem [24], as shown in Appendix A, and this leads to some simplification (cf. Section 3.2). Overall, 16 cases can occur, in relation to points (i) through (iv). They can be divided into three distinct classes: class A, class B, and class C (cf. Table 1).
Table 1.
Classes of multipoint corner conditions.
A simple algorithm can be introduced, for the purpose of classifying the multipoint corner conditions, in relation to each specific problem.
- Step 1. If and class C, otherwise jump to step 2.
- Step 2. If and class B, otherwise jump to step 3.
- Step 3. Two cases can occur:
- (a)
- if use the steps in Appendix A to obtain class A.
- (b)
- if class A.
For some problems, the equality can be obtained, and this case reduces to that of Step 1, i.e., the multipoint condition is of class C. Similarly, if is identically zero, the multipoint condition is of class C.
3.2. Corner Conditions of Class A
Class A corresponds to the occurrence of two conditions, i.e., . Because is nonsingular and
, from Equation (21),
is found in terms of
Then, this expression is inserted into Equation (19), and is obtained:
and becomes
Insertion of Equations (24) and (25) into Equation (20) leads to
The preceding relation (26) can be used to obtain from . However, in the indirect solution process, the Pontryagin principle (22) is used to express the control variables in terms of state and costate vectors. This circumstance implies that, in general, the term in Equation (26) is nonlinear in , and this prevents one from obtaining a closed-form sequential solution for in terms of . Conversely, if linearly depends on , then the latter can be obtained as a function of in closed form. However, a less restrictive condition is desirable, which leads to a closed-form solution for in terms of .
Proposition 1
(Class A. Closed-form solution for ). Let be written as , where the two partitions and are such that , with denoting a general nonlinear function in its arguments. Let be written as , with and associated with and , respectively. If , then a closed-form solution for exists, and it is
where subscripts L and NL denote the two partitions of a column vector corresponding to partitions and of vector , respectively, I represents the identity matrix (with proper dimension), while the scalar is nonzero for class A and is given by
whereas the column vectors are defined as
i.e., represent the partitions of g corresponding to and .
Proof.
Using the expression of in terms of and , together with the definitions of , , Equation (26) can be rewritten as
The preceding relation can be pre-multiplied by the nonzero quantity ,
Then, the following vector quantities in Equation (32) are rewritten in terms of their respective partitions,
where the last step uses the assumed condition . The insertion of Equations (33) and (34) Into Equation (32) leads to obtaining two separate relations associated with the two partitions of . In particular, the lower partition, associated with , reduces to Equation (27), while the upper partition yields Equation (28).
Proposition 1 establishes the condition for the closed-form sequential solution of the multipoint conditions for class A, which allows calculating from . In fact, at time , as a first step is obtained through Equation (27). Second, is found by means of Equation (28). In short, Equations (27) and (28) represent the closed- form jump relations for the costate at time . Finally, and are obtained using Equations (24) and (25), respectively. It is worth remarking that and , are - and -vectors, respectively (as well as the corresponding vectors and ), with and dimensions ( and ) depending on the specific application.
3.3. Corner Conditions of Class B
Class B is investigated in this subsection, with the intent of properly combining the multipoint corner conditions, starting from their general form of Equations (19)–(21). Because and for class B, Equation (19) reduces to
Moreover, in light of Proposition A1 (cf. Appendix A), the additional condition is assumed, with no loss of generality. Existence of a closed-form solution for is addressed in the following
Proposition 2
(Class B. Closed-form solution for ). Let be written as , where the two partitions and are such that , with denoting a general nonlinear function in its arguments. Let be written as , with and associated with and , respectively. If , then a closed-form solution for exists, and it is
where subscripts L and NL denote the two partitions of a column vector corresponding to partitions and of vector , respectively, whereas I represents the identity matrix (with proper dimension).
Proof.
As a first step, from Equation (20), is obtained,
The preceding expression is inserted into Equation (21) to yield
Then, the partitions introduced in Equations (33) and (34) are useful again, together with
and they are inserted into Equation (39), leading to Equation (36) and the following relations for :
Equation (41) is combined with Equation (35), ith , and is obtained,
Insertion of the latter expression into Equation (41) leads to Equation (37).
Proposition 2 establishes the condition for the closed-form sequential solution of the multipoint conditions for class B, which allows calculating from . In fact, at time , as a first step is obtained through Equation (36). Second, is found by means of Equation (37). In short, Equations (36) and (37) represent closed-form jump relations for the costate at time . Finally, and are obtained using Equations (42) and (38), respectively.
3.4. Corner Conditions of Class C
Class C is investigated in this subsection, with the intent of properly combining the multipoint corner conditions, starting from their general form of Equations (19)–(21). Because and for class C, Equations (20) and (21) reduce to
Proposition 3
(Class C. Closed-form solution for ). A closed-form solution for exists, and is
Proof.
Vector is obtained from both Equations (43) and (44), and the related expressions must be equal, which yields
Equation (45) follows from Equation (46) and represents the closed-form jump relation for the costate at time .
Proposition 3 establishes that the corner conditions of class C are always amenable to a closed-form solution for in terms of . The remaining unknowns, i.e., and , can be found using Equation (43) (or, equivalently, Equation (44)) for , followed by Equation (19) for .
It is worth remarking that Equation (46) includes implicit costate transformation [23] as a special case, which occurs if also and (in addition to and ). This allows relating the adjoint variables associated with two distinct representations for the state, at any arbitrary time , at which identically. The latter identity makes the value of irrelevant, thus useless in the numerical solution process. Another special case that belongs to class C is encountered if time is a specified time at which the state vector transitions from to . In this case, in Equation (19) (cf. Section 3).
4. Application 1: Ascent Trajectory of a Multistage Launch Vehicle
Multistage launch vehicles are used to inject spacecraft and probes into their operational orbits, because staging allows for a considerable increase in the final mass at orbit insertion [25]. Different subrockets are defined in relation to the release of the stages that compose the launch vehicle. In particular, subrocket i coincides with the rocket configuration after release of stage and until the separation of stage i takes place.
In this section, the aerospace vehicle is modeled as a point mass, and the ascent path is three-dimensional. As a result, the state is identified by the spacecraft position and velocity vectors r and v, where r is taken from the center of the planet, while .
After liftoff and in early phases, the ascent path crosses the planetary atmosphere, whereas the last arcs leading to orbit injection are exoatmospheric. Under the assumption that the launch vehicle includes three stages, the ascent trajectory is conveniently split into four arcs:
- (1)
- atmospheric powered arc of subrocket 1, in ,
- (2)
- atmospheric powered arc of subrocket 2, in ,
- (3)
- exoatmospheric coast arc of subrocket 3, in and
- (4)
- exoatmospheric powered arc of subrocket 3, in .
These four arcs are associated with the typical ascent path of a launch vehicle. Time corresponds to the end of an initial, short, vertical ascent arc, which is mandatory immediately after liftoff, for safety reasons, i.e., to avoid collisions with the launch tower while vertically directing exhaust gas (from the propulsion system). Arc 2 starts well inside the atmosphere and ends at altitudes where the atmospheric density is negligible, and the ascent path becomes exoatmospheric as a result. Propulsion is off in the coast arc 3, while it is ignited in arc 4. Thrust implies propellant ejection, and the vehicle mass in arc k, , decreases as a result, with rate , with and denoting the thrust magnitude and the effective exhaust velocity of the propulsion system in arc k, respectively. If the maximum (constant) thrust magnitude is used (in all powered arcs), then the mass time history is
where is the rocket mass at , while because arc 3 is unpowered. Other than , times and are also specified, and correspond to complete depletion of the propellant mass for stages 1 and 2. Instead, time is unspecified, and is found as an outcome of trajectory optimization.
4.1. Equations of Motion
Atmospheric flight is conveniently described in spherical coordinates, making reference to the vehicle position and relative velocity vectors, r and . If denotes the angular velocity vector of the planet and v the inertial velocity, then is defined as , and represents the vehicle velocity relative to the atmosphere, under the assumption that this rotates together with the planet. The instantaneous position r is identified by three variables, i.e., (a) radius r , (b) geographical longitude
, and (c) latitude . The relative velocity is associated with (a) its magnitude , (b) the relative flight path angle , and (c) the relative heading angle . The latter quantities identify the direction of in the local horizontal plane, which is orthogonal to r and contains the local East and North unit vectors, denoted with in Figure 1
Figure 1.
Relative velocity and related angles in the local horizontal frame.
The kinematics equations govern the time evolution of r, , and [26,27],
The aerospace vehicle is subject both to external actions (i.e., the gravitational force G and the aerodynamics force A) and to propulsive thrust T. Due to the relatively short time of flight, only the main harmonic of geopotential is considered, and the gravitational acceleration obeys the inverse square law as a result. Moreover, in general, the aerodynamic interaction includes three terms, i.e., (i) lift L, (ii) drag D, and (iii) side force Q. However, usually the latter is modest if compared to lift and drag; thus, it is neglected hence forward. The magnitudes of the aerodynamics accelerations, and , depend on and r,
where and are respectively the dimensionless lift and drag coefficients, which depend on the Mach number M and the angle of attack [26,27], whereas S is the aerodynamic surface and denotes the atmospheric density, which is a function of the instantaneous radius r. Let denote the gravitational parameter of the planet. The dynamics equations of atmospheric flight are written under the assumption that the thrust is always aligned with the rocket longitudinal axis, and are given by
where denotes the bank angle, , , and are given by Equations (47) and (49), and . Angle , together with the angle of attack, identifies the thrust direction needed to properly steer the launch vehicle during ascent. In short, the state and control vectors, x and u, are given by and .
Exoatmospheric flight is also conveniently described in spherical coordinates, making reference to the vehicle position and inertial velocity vectors, r and v. The instantaneous position r is identified by three variables, i.e., (a) radius r , (b) absolute longitude , and (c) latitude . Velocity v is associated with (a) its magnitude , (b) the flight path angle
, and (c) the heading angle . The latter quantities identify the direction of v in the local horizontal plane, in the same way as the direction of
is identified by and (cf. Figure 1). In spaceflight, the thrust direction can be expressed through two angles, and , and the equations of motion are
In short, the state and control vectors, x and u, are given by and .
These two distinct sets of state and control variables are useful in different arcs. In fact, the governing Equations (48) and (50)–(52) and the respective state and control vectors can be employed for arcs 1 and 2, while Equations (53)–(56) and the respective state and control vectors are conveniently used in arcs 3 and 4, which precede orbit injection.
4.2. Formulation of the Problem
At time , which is specified and is set to 0 without any loss of generality, the launch vehicle ends its initial vertical path, immediately after liftoff, and arc 1 begins. The initial conditions are all specified, i.e.,
where subscript sp denotes a specified value. The final orbit is assumed to have prescribed semimajor axis , eccentricity , and inclination . The desired right ascension of the ascending node can be achieved by choosing the initial Greenwich sidereal time at , as shown in Ref. [28]
At time , the first stage is released, and the second stage is ignited. If denotes the burnout time of stage 1 (starting from time ), then
Moreover, all the state variables are continuous across , and this means that the matching relation (3) is
At time , the second stage is released, and subrocket 3 starts traveling a ballistic (unpowered) arc. If
denotes the burnout time of stage 2, then
Two different sets of state and control variables are used in arcs 2 and 3, therefore matching relations must be identified that relate to . First, both radius and latitude have the same definition in arcs 2 and 3, and this means that
The geographical and absolute longitude are related through the Greenwich sidereal time at ,
where denotes the Earth rotation rate, while represents the Greenwich sidereal time at . To obtain the remaining relations involving and
, the definition of is projected onto the local horizontal plane, to yield
where ,
,
,
,
,
,
, and . The preceding relations (61)–(65) are written as implicit state transformation, in the form . This mapping establishes a bijective relation between the two state representations, in the open set defined by the following inequalities: (a) , (b) , (c) , (d) . Inequality (a) means that the launch vehicle does not reach the center of the main attracting body, (b) implies that the rocket must not fly over the North Pole or South Pole, whereas (c) and (d) mean that the magnitude of both the relative and the inertial velocity must not vanish. It is apparent that the open set at hand, in which the governing Equations (48) and (50)–(56) are nonsingular, virtually includes all the ascent paths of practical interest.
At time , the third stage is ignited. All the state variables are continuous across , and this means that the matching relation (3) is
Because is unspecified and no further condition holds at , is identically zero (cf. Section 2).
At time , the upper stage must reach proper final conditions that correspond to insertion into the desired orbit. The vis viva equation for energy [25] leads to obtaining the semimajor axis a in terms of final position and velocity,
Moreover, the relation on the specific angular momentum [25], combined with Equation (67), provides the second final condition,
Finally, the orbit inclination is directly related to the latitude and heading angle; therefore, the following relation must hold [25]:
Equations (57) and (67)–(69) are all incorporated as components of (cf. Equation (2)).
The optimal ascent path of the multistage launch vehicle minimizes propellant consumption of the upper stage, through selection of time and of the thrust direction time history, associated with either angles (in arcs 1 and 2) or angles (in arcs 3 and 4). Because stage 3 employs maximum thrust during its powered phase (i.e., arc 4), minimizing propellant consumption is equivalent to minimizing the ignition time. This circumstance implies that the objective function to minimize is
4.3. Necessary Conditions
The minimum-fuel ascent path obeys the governing (state) equations in their respective arcs (cf. Section 4.1) and must satisfy
- (a)
- the boundary conditions at and , collected in vector (cf. Equation (2)),
- (b)
- the junction conditions (58)–(66), and
- (c)
- the necessary conditions (14)–(16) and (19)–(22) (while Equation (18) is unnecessary for the case at hand, because no parameter vector p is introduced).
This subsection only focuses on the multipoint conditions (19)–(21), for the purpose of showing that they can be solved sequentially. At all intermediate times , , , is independent of , thus the multipoint conditions are of class C. Moreover, because is independent of as well, the implicit costate transformation (45) reduces to
More specifically, at time , Equation (59), combined with Equation (71), leads to , i.e., the costate is continuous across . The remaining unknowns, i.e., and , can be found using Equation (43) for , followed by Equation (19) for
Because of Equation (58), at Equation (19) yields
At time , Equation (71) provides the jump relation for the costate, which is not continuous because of the form of , which incorporates Equations (61)–(65). The remaining unknown, i.e.,
can be found using Equation (43) for , followed by Equation (19) for . Because of Equation (60), at , Equation (19) yields
At time , Equation (66), combined with Equation (71) leads to , i.e., the costate is continuous across . The remaining unknown, i.e., can be found using Equation (43), whereas is irrelevant because . Because of Equation (70), at , Equation (19) yields
The preceding steps show that the multipoint corner conditions can be solved sequentially for the problem at hand, while the remaining necessary conditions coincide with those associated with single-arc optimal control problems.
5. Application 2: Low-Thrust Orbit Transfer with Eclipsing
This section focuses on low-thrust orbit transfers about a single attracting body, under the assumption that the latter has spherical mass distribution. This implies that the gravitational acceleration obeys the inverse square law. If compared to chemical propulsion, low-thrust systems allow for considerable reduction in the propellant mass needed to complete orbit transfers, at the price of considerably increasing the time of flight. Moreover, low-thrust technology relies on the availability of electrical power to operate. Consequently, low-thrust systems are switched off along eclipse arcs, in which the celestial body of interest shadows the spacecraft. Because low-thrust transfers are usually very long, minimum-time solutions are sought, under the assumption that thrusting is available only in illuminated (light) arcs. The underlying trajectory optimization problem is very challenging, because the control authority (i.e., thrusting) is state-dependent.
Extensive literature exists on low-thrust orbit transfers with eclipsing, using regularization or averaging [29,30,31,32,33]. Recently, the author formulated the problem at hand as a multi-arc trajectory optimization problem [21], composed of an unspecified number of thrust and coast arcs, separated by light-shadow transitions. In this section, the general approach presented in Section 2 and Section 3 is applied to formulating a low-thrust Earth orbit transfer with eclipse constraints, for the purpose of demonstrating that the multipoint corner conditions are solvable sequentially.
Based on the analysis—relying on the Pontryagin minimum principle—contained in previous work [21], thrust is maximum along light arcs, while it is switched off along eclipse arcs, as already remarked. This allows for writing the thrust acceleration in arc k as a function of time, under the assumption that the effective exhaust velocity is constant,
where symbols and denote thrust and mass, with (in light arcs) or (in eclipse arcs), whereas is the (constant) effective exhaust velocity of the propulsion system and t represents the actual time.
5.1. State Representations
The spacecraft is modeled as a point mass, and its state is identified through two distinct representations, i.e., (a) spherical coordinates and (b) modified equinoctial elements (MEE). The use of the latter variables is related to two favorable circumstances [21]: (i) using MEE, 9 out of 14 components of state and costate are constant along coast arcs, and (ii) the initial values of the adjoint variables associated with MEE exhibit reduced sensitivity with respect to the corresponding variables associated with spherical coordinates [21,34,35]. However, the latter remain very useful in the derivation of closed-form jump relations at light–shadow transitions.
Spherical coordinates are closely related to the spacecraft position r and velocity v. Three variables identify position, i.e., (a) radius r , (b) absolute longitude , and (c) latitude . Velocity is conveniently described in terms of its radial, East, and North components (in the local horizontal plane), denoted with , , and , respectively. The preceding six variables are collected in . The related state equations are reported in Ref. [23] and omitted in this work, for the sake of conciseness. They also involve two control variables, i.e., the thrust angles, which identify the instantaneous thrust direction in the local horizontal frame (cf. Figure 1).
Low-thrust transfers can also be described using osculating orbit elements, i.e., semimajor axis a, eccentricity e, inclination i, right ascension of the ascending node , argument of perigee , and true anomaly f [25]. However, because some orbit elements are not defined for circular or equatorial orbit (and also when an elliptic orbit transitions to a hyperbola), MEE were introduced [36,37] and are defined as
These components form the state vector z. Their governing equations [26,36] are omitted for the sake of brevity. They also involve two control variables, i.e., the two thrust angles in the local vertical local horizontal (LVLH) frame. This reference system is associated with the right-hand sequence of unit vectors , with aligned with the spacecraft position (taken from the center of mass of the attracting body) and pointing toward the angular momentum.
MEE and spherical coordinates are related through the following six relations [23], which define the left-hand sides of the implicit state transformation
The transformation at hand is defined over the open subset identified by the following inequalities:
The first inequality rules out rectilinear trajectories, the second one corresponds to finite distance from the attracting body [26], implies that the spacecraft does not reach the center of the attracting body, and the last inequality is related to the definition of latitude (and implies that the spacecraft does not travel over the poles). It is apparent that Equation (83) defines two open sets (for z and y), which virtually include all the space trajectories of practical interest. The implicit state transformation at hand represents an isomorphic mapping between spherical coordinates and MEE in the open set defined by Equation (83). The Jacobian matrices and are straightforward to obtain from Equations (77)–(82) and are nonsingular, due to the isomorphic (bijective) nature of the state transformation in the open sets identified by Equation (83).
5.2. Spacecraft Eclipsing
The main attracting body, i.e., Earth hence forward, shadows the spacecraft multiple times during the orbit transfer. The eclipse condition can be derived in terms of either spherical coordinates or MEE, under two very reasonable simplifying assumptions: (i) the Earth describes a circular orbit about the Sun, and (ii) the shadow is cylindrical. Assumption (i) represents a very good approximation because of the modest eccentricity of the Earth orbit. Approximation (ii) is very frequently used due to the large distance that separates Earth and the Sun. In this subsection, several analytical developments are omitted for the sake of brevity and can be found in Ref. [23].
Using spherical coordinates, the spacecraft is eclipsed if
where is the Earth radius, is the ecliptic obliquity, whereas is the ecliptic longitude, which identifies the instantaneous position of the Sun. If denotes the value of at the initial time (set to 0) and is the (constant) angular rate of the Sun in its motion relative to Earth, then . The lleft-hand side of Equation (84) is incorporated into the e equality , which identifies light–shadow transitions.
Using MEE, the spacecraft is eclipsed if
where and ( denotes a generic angle). The left-hand side of Equation (85) is incorporated into the equality , which identifies light/shadow transitions. It is worth noting that depends on all the components of z, unlike , which is a function of only 3 components of y.
5.3. Formulation of the Problem
The initial and final orbits are identified through the specified values of some MEE. In transfer problems, the true anomaly is not prescribed at the initial and final time, whereas the remaining elements can be either specified or not. Regardless of the specific case, the boundary conditions are expressed in the form of Equation (2), where x coincides with z.
Because thrust is available only when the spacecraft is illuminated, the entire transfer path is composed of an unspecified number of light and eclipse arcs. The problem is formulated as a multi-arc trajectory optimization problem, with the thrust acceleration magnitude given by Equation (75). In arc k, thrust is conveniently projected onto the LVLH-frame, through angles , which form the control vector u ,
Light–shadow transitions correspond to vanishing of the left-hand side of Equation (85). However, in the following, the use of Equation (84) in place of Equation (85) will be shown to be advantageous.
The minimum-time orbit transfer is sought, through selection of the unknown values of MEE of the initial and final orbit and the identification of the optimal thrust direction time history. Hence, the objective function to minimize is
5.4. Necessary Conditions
The minimum-time transfer path obeys the governing (state) equations in their respective arcs and must satisfy
- (a)
- the boundary conditions at and , collected in vector (cf. Equation (2)),
- (b)
- the junction conditions (58)–(66), and
- (c)
- the necessary conditions (14)–(16) and (19)–(22) (while Equation (18) is unnecessary for the case at hand, because no parameter vector p is introduced).
As a preliminary step, the minimum principle (22) is applied, with reference to both state representations, associated with y (spherical coordinates) and z (MEE). The respective adjoint variables are denoted with and , respectively. Then, the expressions of the control variables written in terms of state (y or z) and costate ( or ) are inserted into the Hamiltonian function, thus identifying the partitions of and , i.e., and .
If spherical coordinates are employed, then the Hamiltonian function assumes the form [23]
where represents component i of the adjoint vector , whereas symbol
denotes a function independent of . Therefore, it is apparent that
Moreover, Equation (88) can be evaluated at , letting and , and one recognizes
If MEE are used, then the Hamiltonian function assumes the form [23]
where denotes a function independent of , while represent three nonlinear functions in through . Therefore, it is apparent that
Moreover, Equation (91) can be evaluated at , letting and , and one recognizes
This subsection is especially focused on the multipoint conditions (19)–(21), with the final aim of showing that they can be solved sequentially. This requires the combined use of spherical coordinates and MEE (cf. next subsection).
The shadow condition in terms of MEE (cf. Equation (85)) can be reduced to the form of Equation (4) by letting . Because and , the corner condition is of class A. However, from inspection of Equation (93), it is apparent that ; therefore, the conditions of Proposition 2 do not hold, and the multipoint corner conditions are not amenable to a closed-form solution. This conclusion is also consistent with the analysis contained in Refs. [22,23].
The shadow condition in terms of spherical coordinates (cf. Equation (84)) can be reduced to the form of Equation (4) by letting Because and , the corner condition is again of class A. Moreover, from the inspection of Equation (90), it is apparent that ; therefore, the conditions of Proposition 2 hold, and the multipoint corner conditions are amenable to a closed-form solution, unlike what occurred with MEE.
5.5. Sequential Solution of the Multipoint Corner Conditions
Due to the latter favorable property of spherical coordinates, they can be employed for the purpose of deriving the closed-form jump relations of the costate at light–shadow transitions. This methodology was already successfully used [22,23] and requires a sequence of transformations at a light–shadow transition. Let denote a generic time at which light–shadow transitions occur. In the minimum-time problem at hand, is unknown a priori. However, in an iterative method, is guessed (and does not change in a given iteration) and the sequential solution of all corner conditions is leveraged. If all the boundary conditions (for both the state and the costate) are not met to a satisfying accuracy, then is adjusted and updated at the succeeding iteration.
With reference to a single iteration, the following steps allow obtaining closed-form jump relations at for the adjoint variables associated with the state equations.
Step 1. A light-shadow transition is detected at , using MEE.
Step 2. Three subsequent times are defined in relation to , i.e., (i) , (ii) , and (iii) , where and denote two positive, arbitrarily small constants.
Step 3. At , the initial costate along arc , associated with spherical coordinates and denoted with , is obtained from the final costate associated with MEE in arc j, denoted with , by means of Proposition 3.
Step 4. At , the initial costate along arc , associated with spherical coordinates and denoted with , is obtained from the final costate associated with spherical coordinates in arc , denoted with , through the use of Proposition 1.
Step 5. At , the initial costate along arc , associated with MEE and denoted with , is obtained from the final costate associated with spherical coordinates in arc , denoted with , by means of Proposition 3.
In particular, Steps 3 and 5 employ the implicit costate transformation, which is a special case belonging to class C. In fact, at any arbitrary time (not necessarily associated with light–shadow transitions), the two state representations can be regarded as coexisting, and the respective costate vectors can be obtained using Equation (46). Moreover, because and are arbitrarily small, Steps 3 and 5 can be completed at and in the limit as and . It is worth noticing that light-shadow transitions correspond to times .
The preceding steps show that the multipoint corner conditions can be solved sequentially for the problem at hand, while the remaining necessary conditions coincide with those associated with single-arc optimal control problems. In conclusion, thanks to the sequential (closed-form) solution of all the multipoint corner conditions, an indirect solution approach can manage the same unknown quantities associated with a single-arc optimal control problem. This remarkable fact is extremely useful in the numerical solution of minimum-time problems with an unknown number of arcs, such as that addressed in this section. For similar problems, alternative options exist, such as regularization [38], which does not use multiple arcs. While the two approaches are shown to yield near-identical numerical results [23], compared to regularization, the multi-arc formulation is shown to yield simpler adjoint equations and turns out to be unequivocally superior in terms of computational efficiency, thanks to the sequential solution of corner conditions.
5.6. Numerical Example: Low-Thrust Transfer from Geo-Transfer-Orbit to Geostationary Orbit
In Earth orbit transfers, the terminal (initial and final) orbits are defined by prescribing the values of some MEE, particularly those independent of the true anomaly, which instead is not specified. Specifically, this work considers a typical geo-transfer-orbit (GTO) as the initial orbit, associated with the following elements:
whereas the final orbit is geostationary, i.e.,
where subscripts i and f refer to the initial and final time. These boundary conditions can be rewritten in terms of MEE (cf. Equation (76)) as
The left-hand sides of Equations (96) and (97) form vector (cf. Equation (2)). Low-thrust propulsion is used, with initial thrust acceleration and effective exhaust velocity equal to and , respectively. The reference epoch is 22 March 2000. The preceding boundary conditions, propulsion parameters, and epoch coincide with those reported in Ref. [39].
The numerical solution to this problem is obtained with the use of the indirect heuristic method [23], which assumes the initial values of the adjoint variables and the time of flight as the unknowns, before enforcing the analytical conditions for optimality. No additional unknown referring to intermediate times is introduced, and the sequential solution of corner conditions implies their fulfillment. Further details on this are provided in Ref. [23].
The minimum-time orbit transfer takes 120.82 days, a value close to that found by Kluever through averaging [39], while the final mass ratio is 0.921. Figure 2, Figure 3, Figure 4, Figure 5 and Figure 6 portray the time histories of the osculating semilatus rectum p, eccentricity e, inclination i, and thrust angles. It is worth noting that p, e, and i are constant during eclipses, because the corresponding arcs are Keplerian. Moreover, thrust angles are meaningful only in light arcs, and in fact, blank intervals appear in Figure 5 and Figure 6, associated with eclipse arcs. Finally, Figure 7 illustrates the minimum-time transfer path, with eclipse arcs highlighted in blue.
Figure 2.
Time history of the semilatus rectum (with zoom in the inset).
Figure 3.
Time history of eccentricity (with zoom in the inset).
Figure 4.
Time history of inclination (with zoom in the inset).
Figure 5.
Time history of the in-plane thrust angle (with zoom in the inset).
Figure 6.
Time history of the out-of-plane thrust angle (with zoom in the inset).
Figure 7.
Minimum-time transfer from GTO to GEO (with eclipse arcs in blue).
6. Concluding Remarks
This study addresses multi-arc optimal control problems by considering a very general formulation that also includes intermediate times and states in the objective functional to minimize. This type of problem admits an extended set of necessary conditions, which include multipoint corner relations, to enforce at the junction times between two subsequent arcs. In their general form, these additional conditions do not lead to a closed-form solution for the jump relations of the costate variables at the junction times (with the remarkable exception of class C). Yet, this work shows that 16 cases can occur for the multipoint corner conditions and groups them into three classes. For each of them, closed-form, explicit solutions of the multipoint corner relations are identified, if certain conditions are met. This allows for the sequential solution of multi-arc optimal control problems, which is very advantageous, especially in the presence of a large number of arcs. In fact, in the context of indirect solution approaches, if corner conditions are solvable sequentially, then a parameter set can be identified that retains the reduced size of the typical set associated with a single-arc optimization problem. As a result, the exact fulfillment of the multipoint corner conditions is accompanied by an additional advantage of a computational nature.
Two challenging aerospace trajectory optimization problems are analyzed as illustrative cases of practical interest, i.e., (i) the minimum-fuel ascent path of a multistage launch vehicle and (ii) minimum-time low-thrust orbit transfers with eclipse constraints on the available thrust. In both applications, two different sets of state variables are profitably used, and a closed-form sequential solution of the costate jump equations is proven to exist, also leveraging implicit costate transformation. Application (ii) is particularly challenging due to the presence of a large number of arcs, and its numerical solution testifies to the effectiveness of the multi-arc formulation, accompanied by the explicit solution of all necessary conditions at corners.
Funding
This research received no external funding.
Data Availability Statement
The data needed to reproduce the results are contained in the paper.
Acknowledgments
The author wishes to express his gratitude to Francesco Corallo for his contribution to this research, particularly for Application 2.
Conflicts of Interest
The author declares no conflict of interest.
Nomenclature
| drag force | |
| lift force | |
| Lagrange term in arc k | |
| Hamiltonian function in arc k | |
| Hamiltonian function using spherical coordinates | |
| Hamiltonian function using MEE | |
| objective functional | |
| Mach number | |
| number of light and eclipse arcs | |
| Earth radius | |
| radius of the geostationary orbit | |
| shadow function, using spherical coordinates | |
| shadow function, using MEE | |
| thrust magnitude in arc k | |
| -vector with the right-hand side of the state equations in arc k | |
| -vector of unknown time-independent parameters | |
| control vector in arc k, with components | |
| position vector, taken from the center of the Earth | |
| velocity vector, with magnitude v | |
| relative velocity vector, with magnitude | |
| -state vector in arc k, with components | |
| state vector associated with spherical coordinates | |
| state vector associated with MEE | |
| semimajor axis | |
| drag coefficient | |
| effective exhaust velocity of the propulsive system in arc k | |
| lift coefficient | |
| eccentricity | |
| true anomaly | |
| inclination | |
| spacecraft mass | |
| radius | |
| time | |
| intermediate time | |
| burnout time of stage i | |
| East component of the spacecraft velocity | |
| North component of the spacecraft velocity | |
| radial component of the spacecraft velocity | |
| scalar function associated with | |
| adjoint vector conjugate to the boundary conditions | |
| adjoint vector conjugate to the multipoint conditions at | |
| -vector associated with boundary conditions | |
| -vector of state matching equations | |
| adjoint vector conjugate to the dynamics equations in arc k | |
| adjoint vector associated with spherical coordinates | |
| adjoint vector associated with MEE | |
| -vector function that relates spherical coordinates to MEE | |
| angle of attack | |
| first thrust angle in exoatmospheric flight | |
| second thrust angle in exoatmospheric flight | |
| heading angle | |
| relative heading angle | |
| ecliptic obliquity | |
| arbitrarily small positive constant | |
| Mayer term | |
| auxiliary function that incorporates boundary conditions | |
| latitude | |
| ecliptic longitude | |
| absolute longitude | |
| geographical longitude | |
| Earth gravitational parameter | |
| atmospheric density | |
| bank angle | |
| heading angle | |
| relative heading angle | |
| adjoint variable conjugate to scalar condition at | |
| right ascension of the ascending node (RAAN) | |
| argument of perigee | |
| Earth rotation rate about the Sun | |
| Earth rotation rate |
Appendix A
This appendix focuses on the case , to show that it can be reduced to the case , using the implicit function theorem [24].
Proposition A1.
The case
is reducible to while holding .
Proof.
In general, depends on both and , while and fulfill the implicit-form relation (3). Thanks to the implicit function theorem [24], because in nonsingular (in an open set), an explicit representation of in terms of exists at , i.e., . Letting , equality can be written as
and the related first differential equals
because . Moreover, due to Equation (3), the first differential of is given by
whereas the first differential of the explicit-form relation is
Comparison of Equations (A3) and (A4) leads to recognizing the following identity:
The preceding relation (A2), in conjunction with Equation (A5), proves that
i.e., is reducible to while holding .
References
- Berkovitz, L.D.; Medhin, N.G. Nonlinear Optimal Control Theory; CRC Press: Boca Raton, FL, USA, 2013; pp. 177–182. [Google Scholar]
- Bliss, G.A. Lectures on the Calculus of Variations; University of Chicago Press: Chicago, IL, USA, 1946; pp. 187–228. [Google Scholar]
- Bryson, A.E.; Ho, Y.-C. Applied Optimal Control; Ginn and Company: Waltham, MA, USA, 1969; pp. 125–127. [Google Scholar]
- Clarke, F. Functional Analysis, Calculus of Variations and Optimal Control; Springer: London, UK, 2013; pp. 307–318. [Google Scholar]
- Hull, D.G. Optimal Control Theory for Applications; Springer: New York, NY, USA, 2003; pp. 88–102+221–223+275–283. [Google Scholar]
- Leitmann, G. The Calculus of Variations and Optimal Control; Springer Science & Business Media LLC: New York, NY, USA, 1983; pp. 67–70. [Google Scholar]
- Longuski, J.M.; Guzman, J.J.; Prussing, J.E. Optimal Control with Aerospace Applications; Springer: New York, NY, USA, 2014; pp. 105–111+167–174. [Google Scholar]
- Garfinkel, B. Discontinuities in a Variational Problem. Math. Sci. Eng. 1967, 31, 27–62. [Google Scholar]
- Shaikh, M.S.; Caines, P.E. On relationships between Weierstrass-Erdmannn corner condition, Snell’s law and the hybrid minimum principle. In Proceedings of the International Bhurban Conference on Applied Sciences and Technology, IBCAST, Islamabad, Pakistan, 8–11 January 2007; pp. 117–122. [Google Scholar]
- Noble, J.; Schättler, H. Sufficient conditions for relative minima of broken extremals in optimal control theory. J. Math. Anal. Appl. 2002, 269, 98–128. [Google Scholar] [CrossRef] [Scilit]
- Agrachev, A.A.; Biolo, C. Optimality of Broken Extremals. J. Dyn. Control. Syst. 2019, 25, 289–307. [Google Scholar] [CrossRef] [Scilit]
- Osmolovskii, N.P. On Second-Order Necessary Conditions for Broken Extremals. J. Optim. Theory Appl. 2015, 164, 379–406. [Google Scholar] [CrossRef] [Scilit]
- Osmolovskii, N.P.; Maurer, H. Second-order optimality conditions for broken extremals and bang-bang controls: Theory and applications. Springer Optim. Its Appl. 2016, 109, 147–201. [Google Scholar]
- Garavello, M.; Piccoli, B. Hybrid Necessary Principle. SIAM J. Control. Optim. 2005, 43, 1867–1887. [Google Scholar] [CrossRef] [Scilit]
- Clarke, F.H.; Vinter, R.B. Optimal Multiprocesses. SIAM J. Control Optim. 1989, 27, 1072–1091. [Google Scholar] [CrossRef] [Scilit]
- Dmitruk, A.V.; Kaganovitch, A.M. Maximum Principle for Optimal Control Problems with Intermediate Constraints. Comput. Math. Model. 2011, 22, 180–215. [Google Scholar] [CrossRef] [Scilit]
- Bressan, A.; Hong, Y. Optimal Control problems on Stratified Domains. Netw. Heterog. Media 2007, 2, 313–331. [Google Scholar] [CrossRef] [Scilit]
- Bhattacacharya, R.N.; Bhattacharjee, M. Modification of Weierstrass-Erdmann corner conditions in space navigations. AIAA J. 1964, 2, 1145–1147. [Google Scholar] [CrossRef] [Scilit]
- Miele, A. General variational theory of the flight paths of rocket-powered aircraft, missiles and satellite carriers. Astronautica Acta 1959, 4, 264–288. [Google Scholar]
- Clarke, F.H.; Vinter, R.B. Applications of Optimal Multiprocesses. SIAM J. Control Optim. 1989, 27, 1048–1071. [Google Scholar] [CrossRef] [Scilit]
- Pontani, M. Optimal Space Trajectories with Multiple Coast Arcs Using Modified Equinoctial Elements. J. Optim. Theory Appl. 2021, 191, 545–574. [Google Scholar] [CrossRef] [Scilit]
- Pontani, M.; Corallo, F. Optimal low-thrust lunar orbit transfers with shadowing effect using a multiple-arc formulation. Acta Astronaut. 2022, 200, 549–561. [Google Scholar] [CrossRef] [Scilit]
- Pontani, M.; Corallo, F. Optimal Low-Thrust Earth Orbit Transfers with Eclipses Using Indirect Heuristic Approaches. J. Guid. Control. Dyn. 2024, 47, 857–873. [Google Scholar] [CrossRef] [Scilit]
- Krantz, S.G.; Parks, H.R. The Implicit Function Theorem. History, Theory, and Applications; Springer: New York, NY, USA, 2013; pp. 41–48. [Google Scholar]
- Prussing, J.E.; Conway, B.A. Orbital Mechanics; Oxford University Press: New York, NY, USA, 2013; pp. 13–19+46–53+101–117. [Google Scholar]
- Pontani, M. Advanced Spacecraft Dynamics; Efesto: Rome, Italy, 2023; pp. 251–268. [Google Scholar]
- Vinh, N.H.; Busemann, A.; Culp, R.D. Hypersonic and Planetary Entry Flight Mechanics; The University of Michigan Press: Ann Arbor, MI, USA, 1980; pp. 19–28. [Google Scholar]
- Pontani, M. Particle swarm optimization of ascent trajectories of multistage launch vehicles. Acta Astronaut. 2014, 94, 852–864. [Google Scholar] [CrossRef] [Scilit]
- Aziz, J.; Scheeres, D.; Parker, J.; Englander, J. A Smoothed Eclipse Model for Solar Electric Propulsion Trajectory Optimization. Trans. Jpn. Soc. Aeronaut. Space Sci. 2019, 17, 181–188. [Google Scholar] [CrossRef] [Scilit]
- Bastante, J.C.; Letizia, F.; De Bruijn Bastante, F.J.C.; Letizia, F.; De Bruijn, F.; Lubke-Ossenbeck, B. Application of the Sequential Gradient Restoration Algorithm to the Solution of the Low Thrust Transfer Problem. Aerotec. Missili Spaz. 2017, 96, 228–236. [Google Scholar] [CrossRef] [Scilit]
- Ferrier, C.; Epenoy, R. Optimal Control for Engines with Eletro-Ionic Propulsion Under Constraint of Eclipse. Acta Astronaut. 2001, 48, 181–192. [Google Scholar] [CrossRef] [Scilit]
- Graham, K.F.; Rao, A.V. Minimum-Time Trajectory Optimization of Low-Thrust Earth-Orbit Transfers with Eclipsing. J. Guid. Control Dyn. 2016, 53, 289–303. [Google Scholar] [CrossRef] [Scilit]
- Mazzini, L. Finite Thrust Orbital Transfers. Acta Astronaut. 2014, 100, 107–128. [Google Scholar] [CrossRef] [Scilit]
- Pontani, M. Optimal Low-Thrust Trajectories Using Nonsingular Equinoctial Orbit Elements. Adv. Astronaut. Sci. 2020, 170, 443–462. [Google Scholar]
- Singh, S.K.; Taheri, E.; Woollands, R.; Junkins, J. Mission Design for Close-Range Lunar Mapping by Quasi-Frozen Orbits. In Proceedings of the 70th International Astronautical Congress, Washington, DC, USA, 21–25 October 2019. paper IAC-19-C1.1.11. [Google Scholar]
- Battin, R.H. An Introduction to the Mathematics and Methods of Astrodynamics; AIAA Education Series; AIAA: New York, NY, USA, 1987; pp. 448–450+490–494. [Google Scholar]
- Broucke, R.A.; Cefola, P.J. On the Equinoctial Orbit Elements. Celest. Mech. 1972, 5, 303–310. [Google Scholar] [CrossRef] [Scilit]
- Haberkorn, T.; Trélat, E. Convergence Results for Smooth Regularizations of Hybrid Nonlinear Optimal Control Problems. SIAM J. Control Optim. 2011, 49, 1498–1522. [Google Scholar] [CrossRef] [Scilit]
- Kluever, C.A. Low-Thrust Trajectory Optimization Using Orbital Averaging and Control Parameterization. In Spacecraft Trajectory Optimization; Cambridge University Press: New York, NY, USA, 2010; pp. 112–138. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).






