Abstract
This paper presents some lessons that can be drawn, from the point of view of the constraint reasoning and constraint programming community, from trying to model and to solve as best as possible the mission management problem for the new generation of agile Earth observation satellites, that is the selection and the scheduling of observations performed by the satellite.
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
E. Aarts and J. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, 1997.
R. Bellman. Dynamic Programming. Princeton University Press, 1957.
E. Bensana, M. Lemaître, and G. Verfaillie. Earth Observation Satellite Management. Constraints: An International Journal, 4(3): 293–299, 1999.
E. Bensana, G. Verfaillie, J.C. Agnése, N. Bataille, and D. Blumstein. Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite. In Proc. of SpaceOps-96, Münich, Germany, 1996.
R. Dechter. Bucket Elimination:a Unifying Framework for Reasoning. artificial Intelligence, 113:41–85, 1999.
M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York, 1979.
W. Harvey and M. Ginsberg. Limited Discrepancy Search. In Proc. of IJCAI-95, pages 607–613, Montréal, Canada, 1995.
P. Van Hentenryck. The OPL Optimization Programming Language. MIT Press, 1999.
J. Larrosa. Boosting Search with Variable Elimination. In Proc. of CP-00, Singapore, 2000.
E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys, editors. The Traveling Salesman Problem: A Guided Tour ofCombinatorial Optimization. John Wiley & Sons, 1985.
L. Lobjois, M. Lemaítre, and G. Verfaillie. Large Neighbourhood Search using Constraint Propagation and Greedy Reconstruction for Valued CSP Resolution. In Proc. of the ECAI-00 Workshop on “Modelling and Solving with Constraints“, Berlin, Germany, 2000.
T. Schiex. arc Consistency for Soft Constraints. In Proc. of CP-00, Singapore, 2000.
P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In Proc. of CP-98, pages 417–431, Pisa, Italia, 1998.
M. Vasquez and J.K. Hao. A Logic-constrained Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. To appear in the Journal of Computational Optimization and Applications, 2001.
G. Verfaillie, E. Bensana, C. Michelon-Edery, and N. Bataille. Dealing with Uncertainty when Managing an Earth Observation Satellite. In Proc. of i-SAIRAS-99, pages 205–207, Noordwijk, The Netherlands, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verfaillie, G., Lemaître, M. (2001). Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_55
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive