Generating High Quality Schedules for a Spacecraft Memory Downlink Problem

  • Angelo Oddi
  • Nicola Policella
  • Amedeo Cesta
  • Gabriella Cortellessa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2833)

Abstract

This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It concerns the generation of high quality schedules for the spacecraft memory downlink problem. Mex-Mdp is an NP-hard combinatorial problem characterized by several kinds of constraints, such as on-board memory capacity, limited communication windows over the downlink channel, deadlines and ready times on the observation activities. The contribution of this paper is twofold: on one hand it provides a CSP model of a real problem, and on the other it presents a set of metaheuristic strategies based on local and randomized search which are built around the constraint-based model of the problem. The algorithms are evaluated on a benchmark set distilled from ESA documentation and the results are compared against a lower bound of the objective function.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cesta, A., Oddi, A., Cortellessa, G., Policella, N.: Automating the Generation of Spacecraft Downlink Operations in Mars Express: Analysis, Algorithms and an Interactive Solution Aid. Technical Report MEXAR-TR-02-10 (Project Final Report), ISTC-CNR [PST], Italian National Research Council (2002)Google Scholar
  2. 2.
    Verfaillie, G., Lemaitre, M.: Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, p. 670. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Bensana, E., Lemaitre, M., Verfaillie, G.: Earth Observation Satellite Management. Constraints: An international Journal 4, 293–299 (1999)MATHCrossRefGoogle Scholar
  4. 4.
    Resende, M., Ribeiro, C.: Greedy Randomized Adaptive Search Procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219–249. Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
  5. 5.
    Motwani, S., Raghavan, P.: Randomized Algorithms. Cambrige University Press, New York (1995)MATHGoogle Scholar
  6. 6.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. Annals of Discrete Mathematics 4, 287–326 (1979)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Lenstra, J.K.: Notes from Berkeley, July 11 (1980); Personal Communication (2002)Google Scholar
  8. 8.
    Tsang, E.: Foundation of Constraint Satisfaction. Academic Press, London (1993)Google Scholar
  9. 9.
    Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)MATHGoogle Scholar
  10. 10.
    Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics 1, 343–362 (1977)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Cesta, A., Cortellessa, G., Oddi, A., Policella, N.: A CSP-based Interactive Decision Aid for Space Mission Planning. In: Proceedings of AI*IA 2003. LNCS (LNAI), Springer, Heidelberg (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Angelo Oddi
    • 1
  • Nicola Policella
    • 1
  • Amedeo Cesta
    • 1
  • Gabriella Cortellessa
    • 1
  1. 1.Planning & Scheduling Team, Institute for Cognitive Science and TechnologyNational Research Council of ItalyRomeItaly

Personalised recommendations