2015
DOI: 10.1016/j.ast.2015.02.003
|View full text |Cite
|
Sign up to set email alerts
|

Design and optimization of low-thrust orbital phasing maneuver

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…In cislunar setting, the design of this maneuver requires the non-negligible gravitational effects of Earth and Moon. Examples can be found in Bucchioni and Innocenti (2021b), Bucci et al (2017), Shang et al (2015), Blazquez et al (2018b), Blazquez et al (2018a), andGomez et al (2001). For the present analysis, the boundary conditions for the phasing trajectory were taken as follows:…”
Section: Phasingmentioning
confidence: 99%
“…In cislunar setting, the design of this maneuver requires the non-negligible gravitational effects of Earth and Moon. Examples can be found in Bucchioni and Innocenti (2021b), Bucci et al (2017), Shang et al (2015), Blazquez et al (2018b), Blazquez et al (2018a), andGomez et al (2001). For the present analysis, the boundary conditions for the phasing trajectory were taken as follows:…”
Section: Phasingmentioning
confidence: 99%
“…By using the normalization of the initial costate vector [32], the upper and lower bounds of the costate variables can be normalized to be [−1,1]. As to the terminal time variable t f , the upper and lower bound can be estimated from the analytical phasing maneuver time ∆t 1 [19] and the plane change time ∆t 2 [24], and is obtained as follows:…”
Section: Trajectory Optimization With the Averaged Orbital Dynamicsmentioning
confidence: 99%
“…Hall et al [18] solved the time-optimal coplanar LORP using indirect optimization method. Shang et al [19] extended the phasing problem on circular orbits to that on general elliptical orbits using the direct optimization method. Zhao et al [20] proposed an analytical costate approximate method for the minimum-time station-change problem in GEOs.…”
Section: Introductionmentioning
confidence: 99%
“…Direct methods, on the other hand, discretize the control and state variables, transforming the continuous optimal control problem into a constrained finite-dimensional parameter optimization problem. Nonlinear programming methods are then used to solve it [6][7][8]. Direct methods have some advantages such as not requiring an initial guess for the co-state variable, having simple operations, wide convergence domains, and the ability to handle complex constraints.…”
Section: Introductionmentioning
confidence: 99%