Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Chapter
  • Get access
    Buy the print book
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian
  • Cited by 3
  • Cited by
    Crossref Citations
    Crossref logo
    This (lowercase (translateProductType product.productType)) has been cited by the following publications. This list is generated based on data provided by CrossRef.
    Landau, Damon 2018. Efficient Maneuver Placement for Automated Trajectory Design. Journal of Guidance, Control, and Dynamics, p. 1.
    Ahn, Jaemyung Bang, Jun and Lee, Sang-Il 2015. Acceleration of Zero-Revolution Lambert’s Algorithms Using Table-Based Initialization. Journal of Guidance, Control, and Dynamics, Vol. 38, Issue. 2, p. 335.
    Abdelkhalik, Ossama and Gad, Ahmed 2012. Dynamic-Size Multiple Populations Genetic Algorithm for Multigravity-Assist Trajectory Optimization. Journal of Guidance, Control, and Dynamics, Vol. 35, Issue. 2, p. 520.
    ×
  • Print publication year: 2010
  • Online publication date: December 2010

8 - Incremental Techniques for Global Space Trajectory Design

Export citation
Summary

Introduction

Multiple gravity assist (MGA) trajectories represent a particular class of space trajectories in which a spacecraft exploits the encounter with one or more celestial bodies to change its velocity vector. If deep space maneuvers (DSM) are inserted between two planetary encounters, the number of alternative paths can grow exponentially with the number of encounters and the number of DSMs. The systematic scan of all possible trajectories in a given range of launch dates quickly becomes computationally intensive even for moderately short sequences of gravity assist maneuvers and small launch windows. Thus finding the best trajectory for a generic transfer can be a challenge. The search for the best transfer trajectory can be formulated as a global optimization problem. An instance of this global optimization problem can be identified through the combination of a particular trajectory model, a particular sequence of planetary encounters, a number of DSMs per arc, a particular range for the parameters defining the trajectory model, and a particular optimality criterion. Thus a different trajectory model would correspond to a different instance of the problem even for the same destination planet and sequence of planetary encounters. Different models as well as different sequences and ranges of the parameters can make the problem easily solvable or NP-hard. However, the physical nature of this class of transfers allows every instance to be decomposed into subproblems of smaller dimension and smaller complexity.

Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Spacecraft Trajectory Optimization
  • Online ISBN: 9780511778025
  • Book DOI: https://doi.org/10.1017/CBO9780511778025
Please enter your name
Please enter a valid email address
Who would you like to send this to *

CAPTCHA *

Skip to the audio challenge
×
REFERENCES
[1] Myatt, D. R., Becerra, V. M., Nasuto, S. J., and Bishop, J. M. (2004) Advanced Global Optimisation for Mission Analysis and Design, European Space Agency, Advanced Concepts Team, Ariadna Final Report 03-4101a.
[2] De Pascale, P., Vasile, M., and Casotto, S. (2004) Preliminary Analysis of Low-Thrust Gravity Assist Trajectories by an Inverse Method and a Global Optimization Technique, Proceedings of the 18th International Symposium on Space Flight Dynamics, European Space Agency, Noordwijk, 2200 AG, Netherlands, Munich, Germany, 493–498.
[3] Petropoulos, A. E., Longuski, J. M., and Bonfiglio, E. P. (2000) Trajectories to Jupiter Via Gravity Assists from Venus, Earth, and Mars, Journal of Spacecraft and Rockets, 37, No. 6, 776–783.
[4] Sims, J. A., Staugler, A. J., and Longuski, J. M. (1997) Trajectory Options to Pluto Via Gravity Assists from Venus, Mars, and Jupiter, Journal of Spacecraft and Rockets, 34, No. 3, 347–353.
[5] Strange, N. J., and Longuski, J. M. (2002) Graphical Method for Gravity-Assist Trajectory Design, Journal of Spacecraft and Rockets, 39, No. 1, 9–16.
[6] Longuski, J. M., and Williams, S. N. (1991) Automated Design of Gravity-Assist Trajectories to Mars and Outer Planets, Celestial Mechanics and Dynamical Astronomy, 52, No. 3, 207–220.
[7] Pessina, S. M., Campagnola, S., and Vasile, M. (2003) Preliminary Analysis of Interplanetary Trajectories with Aerogravity and Gravity Assist Manoeuvres, Proceedings of the 54th International Astronautical Congress, 1, International Astronautical Federation, IAF, Paris, 75015, France, Bremen, Germany, 671–681.
[8] Labunsky, A. V., Papkov, O. V., and Sukhanov, K. G. (1998) Multiple Gravity Assist Interplanetary Trajectories, Earth Space Institute Book Series, Gordon and Breach Science Publishers.
[9] Vasile, M., and De Pascale, P. (2006) Preliminary Design of Multiple Gravity-Assist Trajectories, Journal of Spacecraft and Rockets, 43, No. 4, 794–805.
[10] Vasile, M., and Locatelli, M. (2008) A Hybrid Multiagent Approach for Global Trajectory Optimization, Journal of Global Optimization.
[11] Olds, A. D., Kluever, C. A., and Cupples, M. L. (2007) Interplanetary Mission Design Using Differential Evolution, Journal of Spacecraft and Rockets, 44, No. 5, 1060–1070.
[12] Sentinella, M. R. (2007) Comparison and Integrated Use of Differential Evolution and Genetic Algorithms for Space Trajectory Optimisation, Proceedings of the IEEE Congress on Evolutionary Computation, Institute of Electronics and Electric Engineering Computer Society, Singapore, 973–978.
[13] Pisarevskya, D. M., and Gurfil, P. (2009) A Memetic Algorithm for Optimizing High-Inclination Multiple Gravity-Assist Orbits, Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2009, Trondheim, Norway.
[14] Vasile, M., Minisci, E. A., and Locatelli, M. (2009) A Dynamical System Perspective on Evolutionary Heuristics Applied to Space Trajectory Optimization Problems, Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2009, Trondheim, Norway.
[15] Price, K. V., Storn, R. M., and Lampinen, J. A. (2005) Differential Evolution: A Practical Approach to Global Optimization, Natural Computing Series, Springer, Berlin.
[16] Leary, R. H. (2000) Global Optimization on Funneling Landscapes, Journal of Global Optimization, 18, No. 4, 367–383.
[17] Battin, R. H. (1999) An Introduction to the Mathematics and Methods of Astrodynamics, Revised edition, Aiaa Education Series, AIAA, New York.
[18] Weisstein, E. W. (2007) MathWorld – A Wolfram Web Resource Sphere Point Picking, http://mathworld.wolfram.com/SpherePointPicking.html
[19] Van Dam, E. R., Husslage, B., Den Hertog, D., and Melissen, H. (2007) Maximin Latin Hypercube Designs in Two Dimensions, Operations Research, 55, No. 1, 158–169.
[20] Wales, D. J., and Doye, J. P. K. (1997) Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms, The Journal of Physical Chemistry A, 101, No. 28, 5111–5116.
[21] Addis, B., Locatelli, M., and Schoen, F. (2005) Local Optima Smoothing for Global Optimization, Optimization Methods and Software, 20, No. 4–5, 417–437.
[22] Powell, M. J. D. (1978) A Fast Algorithm for Nonlinearly Constrained Optimization Calculations, in Numerical Analysis, edited by G.A., Watson, Lecture Notes in Mathematics, Springer, Berlin, 144–157.
[23] Storn, R., and Price, K. (1997) Differential Evolution – a Simple and Efficient Heuristic for Global Optimization over Continuous Spaces, Journal of Global Optimization, 11, 341–359.
[24] Rudolph, G. (1996) Convergence of Evolutionary Algorithms in General Search Spaces, Proceedings of the IEEE International Conference on Evolutionary Computation, ICEC'96, IEEE, Nagoya, Japan, 50–54.
[25] Minisci, E. A., and Avanzini, G. (2009) Orbit Transfer Manoeuvres as a Test Benchmark for Comparison Metrics of Evolutionary Algorithms, Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2009, Trondheim, Norway.
[26] Adcock, C. J. (1997) Sample Size Determination: A Review, The Statistician, 46, No. 2, 261–283.
[27] Jones, D. R., Perttunen, C. D., and Stuckman, B. E. (1993) Lipschitzian Optimization without the Lipschitz Constant, Journal of Optimization Theory and Applications, 79, No. 1, 157–181.
[28] Huyer, W., and Neumaier, A. (1999) Global Optimization by Multilevel Coordinate Search, Journal of Global Optimization, 14, No. 4, 331–355.
[29] Vasile, M., Minisci, E., and Locatelli, M. (2008) On Testing Global Optimization Algorithms for Space Trajectory Design, Proceedings of the AIAA/AAS Astrodynamics Specialist Conference and Exhibit, Honolulu, Hawaii.
[30] Garcia Yárnoz, D., De Pascale, P., Jehn, R., Campagnola, S., Corral, C., et al. (2006) Bepicolombo Mercury Cornerstone Consolidated Report on Mission Analysis, ESA-ESOC Mission Analysis Office, MAO Working Paper No. 466.
Cancel
Confirm
×