Skip to main content
Log in

Average and Maximum Revisit Time Trade Studies for Satellite Constellations Using a Multiobjective Genetic Algorithm

  • Original Article
  • Published:
The Journal of the Astronautical Sciences Aims and scope Submit manuscript

Abstract

Recently, versions of the Genetic Algorithm (GA) have successfully generated low-Earth orbit sparse coverage satellite constellations that appear to outperform traditionally developed constellations. The objective of these constellations was to minimize the maximum revisit time over a latitude band of interest. However, many constellation designers are also concerned with the average revisit time, and contrary to expectations, these two objectives often compete with each other. This paper presents a multiobjective GA approach to generate numerous constellation designs that show the trade-off between the revisit time objectives. These trade studies are conducted using a single run of the multiobjective GA. The designs generated using this approach are discussed and some trends are examined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. CROSSLEY, W. A. and WILLIAMS, E. A. “Simulated Annealing and Genetic Algorithm Approaches for Discontinuous Coverage Satellite Constellation Design, “ Engineering Optimization, Vol. 32, 2000, pp. 353–371.

    Article  Google Scholar 

  2. GEORGE, E. “Optimization of Satellite Constellations for Discontinuous Global Coverage via Genetic Algorithms, “ Paper No. AAS 97–621, AAS/AIAA Astrodynamics Specialist Conference, Sun Valley, ID, Aug. 1997.

  3. VINCENT, T. L. and GRANTHAM W.J. Optimality in Parametric Systems, John Wiley and Sons, New York, 1981, pp. 71–101.

    MATH  Google Scholar 

  4. GOLDBERG, D. E. Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.

    MATH  Google Scholar 

  5. ELY, T. A., CROSSLEY, W. A., and WILLIAMS, E. A. “Satellite Constellation Design for Zonal Coverage Using Genetic Algorithms, “ AAS Paper 98–128, AAS/AIAA Space Flight Mechanics Meeting, Monterey, CA, Feb. 1998.

  6. FRAYSSINHES, E. “Investigating New Satellite Constellation Geometries with Genetic Algorithms, “ Paper No. AIAA 96–3636, AAS/AIAA Astrodynamics Specialist Conference, San Diego, CA, Aug. 1996.

  7. CROSSLEY, W. A., COOK, A. M., FANJOY, D.W., and VENKAYYA, V. P. “Using the Two-Branch Tournament Genetic Algorithm for Multiobjective Design, “ AIAA Journal, Vol. 37, No. 2, Feb. 1999, pp. 261–267.

    Article  Google Scholar 

  8. WALKER, J. G. “Some Circular Orbit Patterns Providing Continuous Whole-Earth Coverage, “ Journal of the British Interplanetary Society, Vol. 24, 1971, pp. 369–384.

    Google Scholar 

  9. WILLIAMS, E. A. and CROSSLEY, W.A. “Empirically-Derived Population Size and Mutation Rate Guidelines for a Genetic Algorithm with Uniform Crossover, “ Soft Computing in Engineering Design and Manufacturing, P. K. Chawdhry, R. Roy and R. K. Pant (editors), Springer-Verlag, 1998, pp. 163–172.

Download references

Author information

Authors and Affiliations

Authors

Additional information

currently Advanced Engine Performance Engineer, Pratt & Whitney, East Hartford, CT 06108.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Williams, E.A., Crossley, W.A. & Lang, T.J. Average and Maximum Revisit Time Trade Studies for Satellite Constellations Using a Multiobjective Genetic Algorithm. J of Astronaut Sci 49, 385–400 (2001). https://doi.org/10.1007/BF03546229

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03546229

Navigation