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.
This work describes results obtained in the framework of a research study conducted for the European Space Agency (ESA-ESOC) under contract No.14709/00/D/IM.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Bensana, E., Lemaitre, M., Verfaillie, G.: Earth Observation Satellite Management. Constraints: An international Journal 4, 293–299 (1999)
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)
Motwani, S., Raghavan, P.: Randomized Algorithms. Cambrige University Press, New York (1995)
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)
Lenstra, J.K.: Notes from Berkeley, July 11 (1980); Personal Communication (2002)
Tsang, E.: Foundation of Constraint Satisfaction. Academic Press, London (1993)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics 1, 343–362 (1977)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oddi, A., Policella, N., Cesta, A., Cortellessa, G. (2003). Generating High Quality Schedules for a Spacecraft Memory Downlink Problem. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive