Skip to main content
SpringerLink
Log in

Earth Observation Satellite Management

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

The daily management of an earth observation satellite is a challenging combinatorial optimization problem. This problem can be roughly stated as follows: given (1) a set of candidate images for the next day, each one associated with a weight reflecting its importance, (2) a set of imperative constraints expressing physical limitations (no overlapping images, sufficient transition times, bounded instantaneous data flow and recording capacity), select a subset of candidates which meets all the constraints and maximizes the sum of the weights of the selected candidates. It can be easily cast in variants of the CSP, ILP or SAT frameworks. As a benchmark, we propose to the CONSTRAINTS community a set of instances, which have been produced from a simulator of the order book of the future satellite SPOT5. The fact that only some of them have been optimally solved should make them very attractive.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bensana, E., Verfaillie, G., Agnèse, J. C., Bataille, N., and Blumstein, D. (1996). Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite. Proc. of the 4th International Symposium on Space Mission Operations and Ground Data Systems (SpaceOps-96). Münich, Germany. ftp://ftp.cert.fr/pub/verfaillie/spaceops96.ps.

  2. Lemaître, M. and Verfaillie, G. (1997). Daily management of an earth observation satellite: comparison of ILOG Solver with dedicated algorithms for Valued Constraint Satisfaction Problems. Proc. of the Third ILOG International Users Meeting. Paris, France. ftp://ftp.cert.fr/pub/verfaillie/ilog97.ps.

  3. Schiex, T., Fargier, H., and Verfaillie, G. (1995). Valued Constraint Satisfaction Problems: Hard and Easy Problems. Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95). Montréal,Canada, pp. 631–637. ftp://ftp.cert.fr/pub/verfaillie/ijcai95.ps.

  4. Vasquez, M. and Hao, J. K. (1998). Recherche locale pour la planification journaliére de prises de vue d'un satellite. Actes du 1er Congrès National sur la Recerche Opérationnelle et l'Aide à la Décision (ROAD-98). Paris, France.

  5. Verfaillie, G., Lemaître, M., and Schiex, T. (1996). Russian Doll Search for Solving Constraint Optimization Problems. Proc. of the 13th National Conference on Artificial Intelligence (AAAI-96). Portland, OR, USA, pp. 181–187. ftp://ftp.cert.fr/pub/verfaillie/rds-aaai96.ps.

Download references

Author information

Authors and Affiliations

  1. ONERA, Centre de Toulouse, 12, avenue Idouard Belin, BP 4025, 31055, Toulouse cedex 4, France

    E. Bensana, M. Lemaitre & G. Verfaillie

Authors
  1. E. Bensana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Lemaitre
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Verfaillie
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bensana, E., Lemaitre, M. & Verfaillie, G. Earth Observation Satellite Management. Constraints 4, 293–299 (1999). https://doi.org/10.1023/A:1026488509554

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026488509554

Search

Navigation