20.04.2014 Views

design space pruning heuristics and global optimization method for ...

design space pruning heuristics and global optimization method for ...

design space pruning heuristics and global optimization method for ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Figure 35: Low-thrust optima as a function of the normalized sum of the <strong>pruning</strong> metrics<br />

(branch-<strong>and</strong>-bound ranking), <strong>for</strong> the small sample problem ...........................84<br />

Figure 36 Set of asteroids <strong>for</strong> intermediate sample problem............................................94<br />

Figure 37 Asteroid sequences remaining in <strong>design</strong> <strong>space</strong> after 1st <strong>pruning</strong> metric (blue)<br />

<strong>and</strong> 2nd & 3rd <strong>pruning</strong> metrics (pink). ............................................................97<br />

Figure 38 Maximum final mass <strong>for</strong> each asteroid pairing as a function of the angle<br />

between the two angular momentum vectors...................................................98<br />

Figure 39 Maximum final mass <strong>for</strong> each asteroid combination as a function of the<br />

minimum, phase-free, two-impulse ∆V...........................................................98<br />

Figure 40 Branch-<strong>and</strong>-bound tree enumerating all asteroid sequences remaining in the<br />

intermediate sample problem after the <strong>pruning</strong> phase. ..................................100<br />

Figure 41 Branch-<strong>and</strong>-bound tree illustrating asteroid sequences pruned out by the first<br />

iteration of the branch-<strong>and</strong>-bound algorithm on the sample problem............100<br />

Figure 42 Results of the 1st iteration of the branch-<strong>and</strong>-bound algorithm applied to the<br />

intermediate sample problem.........................................................................101<br />

Figure 43 Results of the 2nd iteration of the branch-<strong>and</strong>-bound algorithm applied to the<br />

intermediate sample problem.........................................................................102<br />

Figure 44 Asteroid sequences identified by applying branch-<strong>and</strong>-bound algorithm to<br />

intermediate problem. ....................................................................................103<br />

Figure 45 GTOC3 set of asteroids..................................................................................106<br />

Figure 46 Branch-<strong>and</strong>-bound results, iteration #1 (impulsive multiplier = 1). ..............111<br />

Figure 47 Branch-<strong>and</strong>-bound results, iteration #2 (impulsive multiplier = 1.077). .......112<br />

Figure 48 Branch-<strong>and</strong>-bound results, iteration #3 (impulsive multiplier = 1.096). .......113<br />

Figure 49 Comparison of optimum impulsive final mass (multiplied by 1.096) <strong>and</strong><br />

optimum low-thrust final mass <strong>for</strong> modified GTOC3 problem.....................115<br />

Figure 50 GTOC2 set of asteroids..................................................................................118<br />

Figure 51 Set of asteroids <strong>for</strong> modified GTOC2 problem..............................................120<br />

Figure 52 Optimal impulsive solutions, with <strong>and</strong> without the time of flight restriction,<br />

<strong>for</strong> the modified GTOC2 problem. ................................................................123<br />

Figure 53 Results of branch-<strong>and</strong>-bound algorithm applied to modified GTOC2<br />

problem. .........................................................................................................125<br />

xiii

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!