The Satellite Downlink Scheduling Problem: A Case Study of RADARSAT-2
Mission planning operations of Earth observing satellites involve acquisition of images and downlinking (downloading) the acquired images of prescribed areas of the Earth to one or more ground stations. Efficient scheduling of image acquisition and image downlinking plays a vital role in successful satellite mission planning. The image acquisition and downlinking operations are often interlinked and solved using heuristic algorithms that take advantage of the flexibility allowed within such integrated systems. In this chapter, we study the mission planning operations of Canada’s Earth observing synthetic aperture radar (SAR) satellite, RADARSAT-2.
KeywordsPlanning Horizon Synthetic Aperture Radar Visibility Mask Construction Heuristic Satellite Antenna
This work was partially supported by an NSERC CRD grant awarded to Abraham P. Punnen and supported by MacDonald, Dettwiler and Associates Ltd. (MDA). We are thankful to MDA R&D managers Harold Zwick and Christian Nadeau, and RADARSAT-2 flight operation manager Philippe Rolland for their support in various aspects of this work. Extensive comments of Katta G. Murty on an earlier version of this chapter improved the presentation.
- 2.Ahuja, R. K., Ergun, O., Orlin, J. B., & Punnen, A. P. (2007). Very large scale neighborhood search: Theory, algorithms and applications. In T. Gonzalez (ed.), Approximation algorithms and metaheuristics. Boca Raton: CRC.Google Scholar
- 4.Barbulescu, L., Whitley, L. D., & Howe, A. E. (2004). Leap before you look: An effective strategy in an oversubscribed scheduling problem. In Proceedings of the nineteenth national conference on artificial intelligence, San Jose, USA.Google Scholar
- 10.Canada Space Agency. http://www.asc-csa.gc.ca/eng/satellites/radarsat2/applications.asp. Accessed on 1 July 2014; last modified on 28 Nov 2007.
- 12.Gabrel, V., & Murat, C. (2003). Mathematical programming for Earth observation satellite mission planning. In T. A. Ciriani, et al. (Eds.), Operations research in space and air. Boston: Kluwer Academic.Google Scholar
- 13.Gamboa, D., Osterman, C., Rego, C., & Glover, F. (2006). An experimental evaluation of ejection chain algorithms for the traveling salesman problem. Technical report, School of Business Administation, University of Missisippi.Google Scholar
- 14.Globus, A., Crawford, J., Lohn, J., & Pryor, A. (2004). A comparison of techniques for scheduling earth observing satellites, In Proceedings of the sixteenth innovative applications of artificial intelligence conference (IAAA-04), San Jose, USA.Google Scholar
- 17.Marinelli, F., Rossi, F., Nocella, S., & Smriglio, S. (2006). A Lagrangian heuristic for satellite range scheduling with resource constraints. Optimization Online.Google Scholar
- 20.Vasquez, M., & Hao, J.-K. (2003). A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. Computational Optimization and Applications, 7, 87–103.Google Scholar