|
Georgia Tech's Institutional Repository >
College of Engineering (CoE) >
Daniel Guggenheim School of Aerospace Engineering (AE) >
Space Systems Design Lab (SSDL) >
Space Systems Design Lab Technical Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1853/26718
|
| Title: | Design Space Pruning Techniques for Low-Thrust, Multiple Asteroid Rendezvous Trajectory Design |
| Authors: | Alemany, Kristina Braun, Robert D. Georgia Institute of Technology. School of Aerospace Engineering |
| Subjects : | Asteroids Ephemeris-based metrics Global optimization Phase-free approximations Phasing |
| Issue Date: | Sep-2007 |
| Publisher: | Georgia Institute of Technology |
| Series/Report no.: | SSDL ; AAS-07-348 |
| Abstract: | In 2006, the 2nd Global Trajectory Optimization Competition (GTOC2) posed a
“Grand Asteroid Tour” trajectory optimization problem, where participants were
required to find the best possible low-thrust trajectory that would rendezvous
with one asteroid from each of four defined groups. As a first step, most teams
employed some form of design space pruning, in order to reduce the overall
number of possible asteroid combinations. Because of the large size of the
problem, teams were not able to determine if their pruning technique had
successfully eliminated only bad solutions from the design space. Therefore, a
small subset of the GTOC2 problem was analyzed, and several design space
pruning techniques were applied to determine their effectiveness. The results
indicate that the pruning techniques chosen by the participants likely eliminated
good solutions from the design space, because they either did not accurately
represent the low-thrust problem or could not be considered independently
without the effect of other factors. |
| Description: | AAS/AIAA Astrodynamics Specialist Conference, August 2007, Mackinac Island, MI. |
| Type: | Paper |
| URI: | http://hdl.handle.net/1853/26718 |
| Appears in Collections: | Space Systems Design Lab Technical Papers
|
Items in SMARTech are protected by copyright, with all rights reserved, unless otherwise indicated.
|