SavedAdd your journal

Journals / Havacılık ve Uzay Teknolojileri Dergisi / 2019 / Cilt: 12 - Sayı: 1

An Optimization Approach for the Daily Photograph Selection of Earth Observation Satellites

Yer Gözlem Uydularının Günlük Fotoğraf Seçimi İçin Optimizasyon Yaklaşımı

Sezgin KILIÇ
Pages
41–50
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Computational results demonstrate that the proposed algorithm is capable of generating competitive and promising solutions.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The mission of an earth observation satellite (EOS) is to acquire images of specified areas of the Earth surface related to observation requests from customers.
📊
Key Findings & Data:Each photograph related to a customer order generates a profit but not all of the requests can be satisfied due to some physical and technological constraints.
💡
Conclusion & Impact:Computational results demonstrate that the proposed algorithm is capable of generating competitive and promising solutions.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

The mission of an earth observation satellite (EOS) is to acquire images of specified areas of the Earth surface related to observation requests from customers. This paper proposes an optimization approach for the daily photograph selection problem (DPSP) of EOSs. DPSP is related to operational management of EOSs and about the scheduling of observations for an EOS. Each photograph related to a customer order generates a profit but not all of the requests can be satisfied due to some physical and technological constraints. Then the problem is to select a subset of requests of maximal profit. The proposed algorithm inherits the hyper-cube framework of ant colony optimization (ACO) metaheuristic. Realistic instances are used as benchmark problems. Computational results demonstrate that the proposed algorithm is capable of generating competitive and promising solutions.

Özet

Yer gözlem uydusunun (EOS) görevi müşterilerden gelen istekler doğrultusunda Dünya yüzeyinin belirli alanlarına ilişkin görüntü elde etmektir. Bu çalışmada yer gözlem uydularının günlük fotoğraf seçimi problemi (DPSP) için bir optimizasyon yaklaşımı önerilmiştir. DPSP, yer gözlem uydularının operasyonel yönetimi kapsamında, uydu için gözlem yapılacak alanların çizelgelenmesi ile ilgilidir. Müşteri siparişlerine göre çekilmesi gereken her fotoğraf için kazanç elde edilebilmektedir ancak bazı fiziki ve teknolojik kısıtlar nedeniyle tüm fotoğrafların çekilebilmesi mümkün olmamaktadır. Bu durumda, maksimum toplam kazancı sağlayacak fotoğrafların seçimi problemi ortaya çıkmaktadır. Söz konusu problem için hiperküp temelli karınca kolonisi optimizasyonu (ACO) algoritması önerilmiştir. Gerçek problemlere ait verilerle oluşturulmuş deney problemleri kullanılmıştır. Gerçekleştirilen deneyler önerilen algoritmanın rekabet edebilir ve umut verici sonuçlar verdiğini göstermektedir.

🔖

Cite This Article

KILIÇ, S. (2022). An Optimization Approach for the Daily Photograph Selection of Earth Observation Satellites. Havacılık ve Uzay Teknolojileri Dergisi, Cilt: 12 - Sayı: 1, 41–50. https://ajindex.com/articles/535207

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (13)

  1. H. Riebeek, “Catalog of Earth Satellite Orbits,” earthobservatory.nasa.gov, 2009. [Online]. Available: https://earthobservatory.nasa.gov/Features/ OrbitsCatalog/. [Accessed: 12-Sep-2017]
  2. V. Gabrel, A. Moulet, C. Murat, and V. T. Paschos, “A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts,” Ann. Oper. Res., vol. 69, pp. 115–134, 1997
  3. M. A. A. Mansour and M. M. Dessouky, “A genetic algorithm approach for solving the daily photograph selection problem of the SPOT5 satellite,” Comput. Ind. Eng., vol. 58, no. 3, pp. 509–520, 2010
  4. Centre National d’Etudes Spatiales, “Spot satellite technical data,” Centre National d’Etudes Spatiales (CNES). [Online]. Available: http://spot5.cnes.fr/gb/programme/111.htm. [Accessed: 02-Sep-2017]
  5. M. Lemaître, G. Verfaillie, F. Jouhaud, J. M. Lachiver, and N. Bataille, “Selecting and scheduling observations of agile satellites,” Aerosp. Sci. Technol., vol. 6, no. 5, pp. 367–381, 2002
  6. 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,” Comput. Optim. Appl., vol. 20, no. 2, pp. 137–157, 2001
  7. T. A. Ciriani, G. Fasano, S. Gliozzi, and R. Tadei, Operations Research in Space and Air. Springer US, 2003
  8. A. Arias-Montaño, C. A. C. Coello, and E. Mezura-Montes, “Multiobjective evolutionary algorithms in aeronautical and aerospace engineering,” IEEE Trans. Evol. Comput., vol. 16, no. 5, pp. 662–694, 2012
  9. G. Verfaillie, M. Lemaitre, and T. Schiex, “Russian Doll Search for Solving Constraint Optimization Problems,” in 13th National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 181–187
  10. E. Bensana, G. Verfaillie, J. C. Agnèse, N. Bataille, and D. Blumstein, “Exact and inexact methods for the daily management of an earth observation satellite,” in 4th International Symposium on Space Mission Operations and Ground Data Systems (SpaceOps-96), 1996
  11. M. Lemaı̂tre and G. Verfaillie, “Daily management of an earth observation satellite: comparison of ILOG solver with dedicated algorithms for valued constraint satisfaction problems,” in Third ILOG International Users Meeting, 1997
  12. V. Gabrel, “Improved linear programming bounds via column generation procedure for the daily scheduling problem of earth observation satellite,” LIPN, Paris XIII University, Research Report 99-01, 1999
  13. E. Bensana, M. Lemaître, and G.