In this paper we propose a meta-heuristic approach to cope with the satellite constellation design for the telecommunication coverage in limited areas (region coverage). A genetic algorithm, supported by a simulation model and a local search optimisation algorithm, generates non-binary chromosomes, each one representing a constellation with a given coverage and a given number of satellites. The algorithm, following a two-objective strategy, attempts to determine Pareto-optimal constellations with respect to minimum number of satellites and region maximal coverage. The algorithm performance has been tested by evaluating optimal satellite configurations both for global coverage and for the regional ones and an extensive series of computational tests has been performed in order to validate the meta-heuristic approach proposed for regional coverage.
CITATION STYLE
Confessore, G., Di Gennaro, M., & Ricciardelli, S. (2001). A Genetic Algorithm to Design Satellite Constellations for Regional Coverage (pp. 35–41). https://doi.org/10.1007/978-3-642-56656-1_6
Mendeley helps you to discover research relevant for your work.