2019
DOI: 10.1007/s42405-019-00231-z
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective Optimization for Time-Open Lambert Rendezvous Between Non-coplanar Orbits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…Wu et al proposed an adaptive evolutionary strategy to improve the NSGA2 algorithm. For the multi-impulse Lambert problem, the burnup and flight time are used as the optimization objectives for global optimization [16]. However, this kind of multi-objective optimization algorithm based on the Pareto concept increases the complexity of individual sorting and makes the calculation longer.…”
Section: Introductionmentioning
confidence: 99%
“…Wu et al proposed an adaptive evolutionary strategy to improve the NSGA2 algorithm. For the multi-impulse Lambert problem, the burnup and flight time are used as the optimization objectives for global optimization [16]. However, this kind of multi-objective optimization algorithm based on the Pareto concept increases the complexity of individual sorting and makes the calculation longer.…”
Section: Introductionmentioning
confidence: 99%
“…Wu improved the NSGA2 algorithm with an adaptive evolutionary strategy. It enhanced the diversity and convergence of time-fuel consumption optimization for multi-pulse lambert problem [15] .…”
Section: Introductionmentioning
confidence: 99%
“…This algorithm is used to solve an optimal flight-path design for a constrained multi-objective aero-assisted vehicle trajectory optimization problem. An improved NSGA-II algorithm is developed in [5] for solving non-coplanar orbits transfers in multi-impulse Lambert rendezvous problems. The proposed algorithm benefits from a self-adaptive differential evolution technique to increase the efficiency of the algorithm.…”
Section: Introductionmentioning
confidence: 99%