Skip to main content

Scheduling Scientific Experiments on the Rosetta/Philae Mission

  • Conference paper
Principles and Practice of Constraint Programming (CP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7514))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling 17(7), 57–73 (1993)

    Article  MathSciNet  Google Scholar 

  2. 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)

    Article  MathSciNet  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. 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)

    Google Scholar 

  6. Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artificial Intelligence 143(2), 151–188 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mancel, C., Lopez, P.: Complex optimization problems in space systems. In: 13th International Conference on Automated Planning & Scheduling, ICAPS 2003 (2003)

    Google Scholar 

  8. Oddi, A., Policella, N.: Improving robustness of spacecraft downlink schedules. IEEE Transactions on Systems, Man and Cybernetics 37(5), 887–896 (2007)

    Article  Google Scholar 

  9. Nuijten, W., Baptiste, P., Le Pape, C.: Constraint Based Scheduling. Springer (2001)

    Google Scholar 

  10. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics