2018
DOI: 10.1007/s40295-017-0122-8
|View full text |Cite
|
Sign up to set email alerts
|

Low-Thrust Many-Revolution Trajectory Optimization via Differential Dynamic Programming and a Sundman Transformation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(9 citation statements)
references
References 24 publications
0
9
0
Order By: Relevance
“…The sunlight fraction is then a step function between one and zero, and relies only on Eqs. (7) to (9) for the necessary geometry. With the Heaviside definition of a step function, the sunlight fraction is half-valued at the eclipse transition.…”
Section: Smoothed Sunlight Fractionmentioning
confidence: 99%
See 1 more Smart Citation
“…The sunlight fraction is then a step function between one and zero, and relies only on Eqs. (7) to (9) for the necessary geometry. With the Heaviside definition of a step function, the sunlight fraction is half-valued at the eclipse transition.…”
Section: Smoothed Sunlight Fractionmentioning
confidence: 99%
“…Advancements in the application of the second-order gradient-based method, differential dynamic programming [6][7][8][9] (DDP), towards spacecraft trajectory optimization have motivated the development of a twice-differentiable power model. This work proposes a model based on the geometry of overlapping discs 10) that smooths the eclipse transition with a logistic function in the same manner that has seen previous success when applied to the discontinuity in discrete number of thrusters available.…”
Section: Introductionmentioning
confidence: 99%
“…The results indicated that these newly-proposed optimization strategies are effective and can provide feasible solutions for solving the constrained space vehicle trajectory design problems. Interior point method (IP) [41] Interior point sequential quadratic programming (IPSQP) [42] Linear programming (LP) [43] Second order cone programming (SOCP) [44] Semidefinite programming (SDP) [45] Dynamic programming (DP) [46] Differential dynamic programming (DDP) [47] Stochastic differential dynamic programming (SDDP) [48]…”
Section: Optimization Algorithmsmentioning
confidence: 99%
“…In many cases, however, finding an adequate set of tuning parameters for such guidance laws can be as time consuming as the optimization process itself. Along a different line, some efforts have been made to study the impact of different parameterizations of the orbital motion on the computational efficiency of the optimization process, see, e.g., [19,20]. In particular, it is found in [19] that regularizing the orbital dynamics provides an effective way to speed-up the computation.…”
Section: Introductionmentioning
confidence: 99%
“…Along a different line, some efforts have been made to study the impact of different parameterizations of the orbital motion on the computational efficiency of the optimization process, see, e.g., [19,20]. In particular, it is found in [19] that regularizing the orbital dynamics provides an effective way to speed-up the computation. In this paper, we will show that large computational gains are possible by working on the parametrization, while retaining the ability to solve the control problem to full optimality.…”
Section: Introductionmentioning
confidence: 99%