Mathematical Programming for Earth Observation Satellite Mission Planning
Planning the mission of an Earth observation satellite is choosing the shots to be taken during a given period in order to satisfy some requested images. The difficulty of the underlying combinatorial problem depends on the satellite characteristics and on the planning horizon.
We present several formulations using graph theory and mathematical programming. We show that some special cases can be easily solved since they leads to determine longest paths in acyclic directed graphs. For more realistic cases, integer mathematical programming models are much more complicated but, our formulation contains simple longest paths problems as sub-problems. Consequently some decomposition techniques, like column generation, can favorably be used.
KeywordsEarth observation satellite mission planning graph theory column generation
Unable to display preview. Download preview PDF.
- Bensanna E., Verfaillie G., Agnèse J-C., Bataille N., Blumstein D. Exact and approximate methods for the daily management of an earth observation satellite. In Proceedings of the 4th Int. Symposium on Space Mission Operations and Ground Data Systems, Munich, Germany, 1996.Google Scholar
- Gondran M., Minoux M. Graphes et algorithmes. Paris: Eyrolles, 1985.Google Scholar
- Minoux M., Programmation mathématique: Théorie et Algorithmes. Paris: Dunod, 1983. English translation, New York: Wiley, 1986.Google Scholar