Advertisement

The Satellite Downlink Scheduling Problem: A Case Study of RADARSAT-2

  • Daniel KarapetyanEmail author
  • Snezana Mitrovic-Minic
  • Krishna T. Malladi
  • Abraham P. Punnen
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 212)

Abstract

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.

Keywords

Planning Horizon Synthetic Aperture Radar Visibility Mask Construction Heuristic Satellite Antenna 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgement

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.

Supplementary material

273578_1_En_21_MOESM1_ESM.pdf (115 kb)
(pdf 115 KB)

References

  1. 1.
    Ahuja, R. K., Ergun, O., Orlin, J. B., & Punnen, A. P. (2002). A survey of very large scale neighborhood search techniques. Discrete Applied Mathematics, 123, 75–102.CrossRefGoogle Scholar
  2. 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
  3. 3.
    Barbulescu, L., Watson, J. P., Whitley, L. D., & Howe, A. E. (2004). Scheduling space-ground communications for the Air Force Satellite Control Network. Journal of Scheduling, 7, 7–34.CrossRefGoogle Scholar
  4. 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
  5. 5.
    Bard, J. F., & Rojanasoonthon, S. (2006). A branch and bound algorithm for parallel machine scheduling with time windows and job priorities. Naval Research Logistics, 53, 24–44.CrossRefGoogle Scholar
  6. 6.
    Beaumet, G., Verfaillie, G., & Charmeau, M.-C. (2011). Feasibility of autonomous decision making on board an agile Earth-observing satellite. Computational Intelligence, 27, 123–139.CrossRefGoogle Scholar
  7. 7.
    Benoist, T., & Rottembourg, B. (2004). Upper bounds for revenue maximization in a satellite scheduling problem, 4OR, 2, 235–249.CrossRefGoogle Scholar
  8. 8.
    Bianchessi, N., & Righini, G. (2008). Planning and scheduling algorithms for the COSMO-SkyMed constellation. Aerospace Science and Technology, 12, 535–544.CrossRefGoogle Scholar
  9. 9.
    Bianchessi, N., Cordeau, J.-F., Desrosiers, J., Laporte, G., & Raymond, V. (2007). A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites. European Journal of Operational Research, 177, 750–762.CrossRefGoogle Scholar
  10. 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.
  11. 11.
    Cordeau, J.-F., & Laporte, G. (2005). Maximizing the value of an earth observation satellite orbit. Journal of the Operational Research Society, 56, 962–968.CrossRefGoogle Scholar
  12. 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. 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. 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
  15. 15.
    Glover, F. (1996). Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics, 65, 223–253.CrossRefGoogle Scholar
  16. 16.
    Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207, 1–14.CrossRefGoogle Scholar
  17. 17.
    Marinelli, F., Rossi, F., Nocella, S., & Smriglio, S. (2006). A Lagrangian heuristic for satellite range scheduling with resource constraints. Optimization Online.Google Scholar
  18. 18.
    Rojanasoonthon, S., & Bard, J. (2005). A GRASP for parallel machine scheduling with time windows. INFORMS Journal on Computing, 17, 32–51.CrossRefGoogle Scholar
  19. 19.
    Sun, B., Wang, W., Xie, X., & Qin, Q. (2010). Satellite mission scheduling based on genetic algorithm. Kybernetes, 39, 1255–1261.CrossRefGoogle Scholar
  20. 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
  21. 21.
    Verfaillie, G., Pralet, C., & Lemaitre, M. (2010). How to model planning and scheduling problems using constraint networks on timelines. Knowledge Engineering Review, 25, 319–336.CrossRefGoogle Scholar
  22. 22.
    Wang, P., Reinelt, G., Gao, P., & Tan, Y. (2011). A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation. Computers & Industrial Engineering, 61, 322–335.CrossRefGoogle Scholar
  23. 23.
    Zufferey, N., Amstutz, P., & Giaccari, P. (2008). Graph colouring approaches for a satellite range scheduling problem. Journal of Scheduling, 11, 263–277.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Daniel Karapetyan
    • 1
    Email author
  • Snezana Mitrovic-Minic
    • 2
  • Krishna T. Malladi
    • 3
  • Abraham P. Punnen
    • 3
  1. 1.ASAP Research Group, School of Computer ScienceUniversity of NottinghamNottinghamUK
  2. 2.MDA Systems Ltd.RichmondCanada
  3. 3.Department of MathematicsSimon Fraser UniversitySurreyCanada

Personalised recommendations