Abstract
In this paper, we consider a problem involved in the management of Earth observation satellites. The input of the problem is a time-stamped observation plan and the output is a schedule of transitions between running modes of instruments available on board. These transitions must be scheduled so as to effectively realize the acquisitions requested, while satisfying several constraints, including duration constraints, non-overlapping constraints, and resource constraints over the thermal consumption of instruments. Criteria such as the minimization of the number of times instruments are switched off are also considered, for long-term reliability issues. The scheduling problem obtained needs to be solved several times per day, and the requirement is to produce good quality solutions in a few seconds. To produce such solutions, we propose a specific constraint-based local search procedure. Experiments are performed on realistic scenarios involving hundreds of observations, and the approach is compared with other techniques.
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
Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers (2001)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Springer (2012)
Erol, K., Hendler, J., Nau, D.S.: HTN Planning: Complexity and Expressivity. In: Proc. of the 12th National Conference on Artificial Intelligence (AAAI 1994), pp. 1123–1128 (1994)
Laborie, P., Rogerie, J.: Reasoning with Conditional Time-Intervals. In: FLAIRS Conference, pp. 555–560 (2008)
Pesant, G.: A Regular Language Membership Constraint for Finite Sequences of Variables. In: Proc. of the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), pp. 482–495 (2004)
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons (1988)
Hentenryck, P.V., Michel, L.: Constraint-Based Local Search. The MIT Press (2005)
Pralet, C., Verfaillie, G.: Dynamic Online Planning and Scheduling Using a Static Invariant-based Evaluation Model. In: Proc. of the 23th International Conference on Automated Planning and Scheduling (ICAPS 2013) (2013)
Pralet, C., Verfaillie, G.: Time-dependent Simple Temporal Networks: Properties and Algorithms. RAIRO Operations Research (2013)
Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Networks. Artificial Intelligence 49, 61–95 (1991)
Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Proc. of the 4th International Conference on Principles and Practice of Constraint Programming (CP 1998), 417–431 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Pralet, C., Lemai-Chenevier, S., Jaubert, J. (2015). Scheduling Running Modes of Satellite Instruments Using Constraint-Based Local Search. In: Pesant, G. (eds) Principles and Practice of Constraint Programming. CP 2015. Lecture Notes in Computer Science(), vol 9255. Springer, Cham. https://doi.org/10.1007/978-3-319-23219-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-23219-5_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23218-8
Online ISBN: 978-3-319-23219-5
eBook Packages: Computer ScienceComputer Science (R0)