Abstract
The Rosetta/Philae mission was launched in 2004 by the European Space Agency (ESA). It is scheduled to reach the comet 67P/Churyumov-Gerasimenko in 2014 after traveling more than six billion kilometers. The Philae module will then be separated from the orbiter (Rosetta) to attempt the first ever landing on the surface of a comet. If it succeeds, it will engage a sequence of scientific exploratory experiments on the comet.
In this paper we describe a constraint programming model for scheduling the different experiments of the mission. A feasible plan must satisfy a number of constraints induced by energetic resources, precedence relations on activities, or incompatibility between instruments. Moreover, a very important aspect is related to the transfer (to the orbiter then to the Earth) of all the data produced by the instruments. The capacity of inboard memories and the limitation of transfers within visibility windows between lander and orbiter, make the transfer policy implemented on the lander’s CPU prone to data loss. We introduce a global constraint to handle data transfers. The goal of this constraint is to ensure that data-producing activities are scheduled in such a way that no data is lost.
Thanks to this constraint and to the filtering rules we propose, mission control is now able to compute feasible plans in a few seconds for scenarios where minutes were previously often required. Moreover, in many cases, data transfers are now much more accurately simulated, thus increasing the reliability of the plans.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling 17(7), 57–73 (1993)
Beaumet, G., Verfaillie, G., Charmeau, M.-C.: Feasibility of autonomous decision making on board an agile earth-observing satellite. Computational Intelligence 27(1), 123–139 (2011)
Beldiceanu, N., Carlsson, M.: Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 377–391. Springer, Heidelberg (2001)
Cesta, A., Cortellessa, G., Denis, M., Donati, A., Fratini, S., Oddi, A., Policella, N., Rabenau, E., Schulster, J.: Mexar2: AI solves mission planner problems. IEEE Intelligent Systems 22, 12–19 (2007)
Morris, R., Frank, J., Jónsson, A., Smith, D.E.: Planning and scheduling for fleets of earth observing satellites. In: 6th i-SAIRAS, pp. 18–22 (2001)
Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artificial Intelligence 143(2), 151–188 (2003)
Mancel, C., Lopez, P.: Complex optimization problems in space systems. In: 13th International Conference on Automated Planning & Scheduling, ICAPS 2003 (2003)
Oddi, A., Policella, N.: Improving robustness of spacecraft downlink schedules. IEEE Transactions on Systems, Man and Cybernetics 37(5), 887–896 (2007)
Nuijten, W., Baptiste, P., Le Pape, C.: Constraint Based Scheduling. Springer (2001)
Righini, G., Tresoldi, E.: A mathematical programming solution to the Mars Express memory dumping problem. IEEE Transactions on Systems, Man and Cybernetics 40(3), 268–277 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simonin, G., Artigues, C., Hebrard, E., Lopez, P. (2012). Scheduling Scientific Experiments on the Rosetta/Philae Mission. In: Milano, M. (eds) Principles and Practice of Constraint Programming. CP 2012. Lecture Notes in Computer Science, vol 7514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33558-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-33558-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33557-0
Online ISBN: 978-3-642-33558-7
eBook Packages: Computer ScienceComputer Science (R0)