2010
DOI: 10.1016/j.actaastro.2010.02.014
|View full text |Cite
|
Sign up to set email alerts
|

Interactive optimization approach for optimal impulsive rendezvous using primer vector and evolutionary algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
18
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 40 publications
(18 citation statements)
references
References 8 publications
0
18
0
Order By: Relevance
“…Many numerical optimization methods are available to solve the linear impulsive trajectory optimization problem scriptP0 (see for the details). This paper does not intended to propose a new numerical optimization method for scriptP0.…”
Section: Primer Vector Analysis and Problem Simplificationmentioning
confidence: 99%
“…Many numerical optimization methods are available to solve the linear impulsive trajectory optimization problem scriptP0 (see for the details). This paper does not intended to propose a new numerical optimization method for scriptP0.…”
Section: Primer Vector Analysis and Problem Simplificationmentioning
confidence: 99%
“…To obtain global fuel‐optimal impulsive reconfiguration trajectories, a hybrid optimization method was proposed in the aforementioned work, in which the genetic algorithm performs a global search to find 2‐impulse trajectories, and then, with the 2‐impulse trajectories as initial guesses, primer vector analysis is utilized to find multiple‐impulse local optimal trajectories. An interactive optimization approach, which combines primer vector theory and evolutionary algorithms, is proposed in the work of Luo et al for fuel‐optimal impulsive rendezvous. A closed‐loop brain storm optimization method was proposed in the work of Sun et al for multiple‐satellite GCO reconfiguration using 2‐impulse control.…”
Section: Introductionmentioning
confidence: 99%
“…This is by no means a new problem and it has been investi gated by numerous authors in the past. However, the previous methods suffer from one or more of the following drawbacks: l. They involve the computationally expensive and sensitive solution of sets of nonlinear equations [1][2][3][4][5][6][7][8][9][10][11][12][13]. 2.…”
mentioning
confidence: 99%
“…2. They assume a circular or near-circular reference orbit [1][2][3][4]6,9,10,[13][14][15][16] 3. They assume a set of impulse times and do not solve for the optimal ones [15][16][17][18][19][20][21].…”
mentioning
confidence: 99%