Earth Observation Satellite Management

Authors:
E. Bensana;M. Lemaitre;G. Verfaillie
Affiliations:
ONERA, Centre de Toulouse, 12, avenue Idouard Belin, BP 4025, 31055 Toulouse cedex 4, France;ONERA, Centre de Toulouse, 12, avenue Idouard Belin, BP 4025, 31055 Toulouse cedex 4, France;ONERA, Centre de Toulouse, 12, avenue Idouard Belin, BP 4025, 31055 Toulouse cedex 4, France
Venue:
Constraints
Year:
1999

Citing 2
Cited 26

Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Russian doll search for solving constraint optimization problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite

Computational Optimization and Applications
Current Approaches for Solving Over-Constrained Problems

Constraints
Current Approaches for Solving Over-Constrained Problems

Constraints
Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
An earth watching satellite constellation: how to manage a team of watching agents with limited communications

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Bucket elimination for multiobjective optimization problems

Journal of Heuristics
Graph colouring approaches for a satellite range scheduling problem

Journal of Scheduling
Exploiting Decomposition in Constraint Optimization Problems

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Multi-Objective Propagation in Constraint Programming

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A comparison of techniques for scheduling earth observing satellites

IAAI'04 Proceedings of the 16th conference on Innovative applications of artifical intelligence
Memory intensive branch-and-bound search for graphical models

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models

Artificial Intelligence
Memory intensive AND/OR search for combinatorial optimization in graphical models

Artificial Intelligence
Best-first AND/OR search for graphical models

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
On the practical use of variable elimination in constraint optimization problems: 'still-life' as a case study

Journal of Artificial Intelligence Research
Exploiting decomposition on constraint problems with high tree-width

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A genetic algorithm approach for solving the daily photograph selection problem of the SPOT5 satellite

Computers and Industrial Engineering
Estimation of the minimal duration of an attitude change for an autonomous agile earth-observing satellite

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
AND/OR multi-valued decision diagrams for constraint optimization

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Advanced generic neighborhood heuristics for VNS

Engineering Applications of Artificial Intelligence
Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite

Computational Optimization and Applications
Strong formulation for the spot 5 daily photograph scheduling problem

Journal of Combinatorial Optimization
A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation

Computers and Industrial Engineering
Mini-bucket elimination with bucket propagation

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Boolean lexicographic optimization: algorithms & applications

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Thedaily management of anearth observation satellite is a challenging combinatorial optimizationproblem. This problem can be roughly stated as follows: given(1) a set of candidate images for the next day, each one associatedwith a weight reflecting its importance, (2) a set of imperativeconstraints expressing physical limitations (no overlapping images,sufficient transition times, bounded instantaneous data flowand recording capacity), select a subset of candidates whichmeets all the constraints and maximizes the sum of the weightsof the selected candidates. It can be easily cast in variantsof the CSP, ILP or SAT frameworks. As a benchmark, we proposeto the CONSTRAINTS community a set of instances, which havebeen produced from a simulator of the order book of the futuresatellite SPOT5. The fact that only some of them have been optimallysolved should make them very attractive.