Simulated annealing and genetic algorithm approaches for discontinuous coverage satellite constellation design

Engineering Optimization

Volumn 32, Issue 3, 2000, Pages 353-371

  Crossley, William A ^a   Williams, Edwin A ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; SATELLITES; SIMULATED ANNEALING; SPACE FLIGHT; SYSTEMS ANALYSIS;

DISCONTINUOUS SATELLITE COVERAGE; NON GRADIENT BASED OPTIMIZATION; SATELLITE CONSTELLATIONS;

OPTIMIZATION;

EID: 0033903921     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052150008941304     Document Type: Article

References (12)

1. Teledesic Corp. (1998). Technical overview of the Teledesic network, [www http:// www.teledesic.com/tech/details.html].
2. Walker, J. G. (1971). Some circular orbits patterns providing continuous whole earth coverage. Journal of the British Interplanetary Society, 24, 369-384.
3. Luders, R. (1961). Satellite networks for continuous zonal coverage. American Rocket Society Journal, 31, 179-184.
4. Rider, L. (1986). Analytic design of satellite constellations for zonal earth coverage using inclined circular orbits. Journal of the Astronautical Sciences, 34(1), 31-64.
5. George, E. (1997). Optimization of satellite constellations for discontinuous global coverage via genetic algorithms. AAS/AIAA Astrodynamics Specialist Conference, Sun Valley, Idaho, Paper No. AAS 97-621.
6. Frayssinhes, E. (1996). Investigating new satellite constellation geometries with genetic algorithms. AAS/AIAA Astrodynamics Specialist Conference, San Diego, California, Paper No. AIAA 96-3636.
7. Ely, T. A., Crossley, W. A. and Williams, E. A. (1998). Satellite constellation design for zonal coverage using genetic algorithms. AAS/AIAA Astrodynamics Specialist Conference, Monterey, California, Paper No. AAS 98-128.
8. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Massachusetts.
9. Corana, A., Marchesi, M., Martini, C. and Ridella, S. (1987). Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Transactions on Mathematical Software, 13(3), 262-280.
10. Press, W. H., Teukolsky, S. A., Vetterling, W. T. and Flannery, B. P. (1992). Simulated annealing methods. Numerical Recipes in Fortran 77: The Art of Scientific Computing. Cambridge University Press, Cambridge, pp. 436-437.
11. Williams, E. A. and Crossley, W. A. (1998). Empirically-derived population size and mutation rate guidelines for a genetic algorithm with uniform crossover. Soft Computing in Engineering Design and Manufacturing, Chawdhry, P. K., Roy, R. and Pant, R. K. (Eds.), Springer-Verlag, pp. 163-172.
12. Crossley, W. A. and Williams, E. A. (1997). Simulated Annealing and Genetic Algorithm for Satellite Constellation Design. Technical report to The Aerospace Corporation, El Segundo, CA.