Selecting and scheduling observations for agile satellites: Some lessons from the constraint reasoning community point of view

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2239, Issue , 2001, Pages 670-684

  Verfaillie, Gérard ^a   Lemaître, Michel ^a  

^a ONERA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; SATELLITES;

AGILE SATELLITES; CONSTRAINT PROGRAMMING COMMUNITY; CONSTRAINT REASONING; EARTH OBSERVATION SATELLITES; MISSION MANAGEMENT;

SCHEDULING;

EID: 84947921676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_55     Document Type: Conference Paper

References (15)

1. E. Aarts and J. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, 1997.
2. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
3. E. Bensana, M. Lemaˆitre, and G. Verfaillie. Earth Observation Satellite Management. Constraints: An International Journal, 4(3):293–299, 1999.
4. E. Bensana, G. Verfaillie, J.C. Agnese, N. Bataille, and D. Blumstein. Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite. In Proc. Of Sp aceOps-96, Munich, Germany, 1996.
5. R. Dechter. Bucket Elimination: a Unifying Framework for Reasoning. Artificial Intelligence, 113:41–85, 1999.
6. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory ofNP-completeness. W.H. Freeman and Company, New York, 1979.
7. W. Harvey and M. Ginsberg. Limited Discrepancy Search. In Proc. ofIJCAI-95, pages 607–613, Montreal, Canada, 1995.
8. P. Van Hentenryck. The OPL Optimization Programming Language. MIT Press, 1999.
9. J. Larrosa. Boosting Search with Variable Elimination. In Proc. ofCP-00, Singapore, 2000.
10. E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys, editors. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, 1985.
11. L. Lobjois, M. Lemaˆıtre, and G. Verfaillie. Large Neighbourhood Search using Constraint Propagation and Greedy Reconstruction for Valued CSP Resolution. In Proc. ofthe ECAI-00 Workshop on”Modelling and Solving with Constraints”, Berlin, Germany, 2000.
12. T. Schiex. Arc Consistency for Soft Constraints. In Proc. ofCP-00, Singapore, 2000.
13. P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In Proc. ofCP-98, pages 417–431, Pisa, Italia, 1998.
14. 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 ofComputational Optimization and Applications, 2001.
15. G. Verfaillie, E. Bensana, C. Michelon-Edery, and N. Bataille. Dealing with Uncertainty when Managing an Earth Observation Satellite. In Proc. ofi-SAIRAS-99, pages 205–207, Noordwijk, The Netherlands, 1999.