IDEAS home Printed from https://ideas.repec.org/p/ete/kbiper/627938.html
   My bibliography  Save this paper

Scheduling multiple agile Earth observation satellites

Author

Listed:
  • Chao Han
  • Xinwei Wang
  • Guopeng Song
  • Roel Leus

Abstract

Earth observation satellites (EOSs) are specially designed to collect images according to user requirements. Agile EOSs (AEOSs), with stronger attitude maneuverability, greatly improve the observation capability, while increasing the complexity of scheduling the observations. We are the first to address multiple AEOSs scheduling with multiple observations where the objective function aims to maximize the entire observation profit over a fixed horizon. The profit attained by multiple observations for each target is nonlinear in the number of observations. Our model is a specific interval scheduling problem, with each satellite orbit represented as a machine. A column-generation-based framework is developed for this problem, in which the pricing problems are solved using a label-setting algorithm. Extensive computational experimtents are conducted on the basis of one of China’s AEOS constellations. The results indicate that our optimality gap is less than 3% on average, which validates our framework. We also evaluate the performance of the framework for conventional EOS scheduling.

Suggested Citation

  • Chao Han & Xinwei Wang & Guopeng Song & Roel Leus, 2018. "Scheduling multiple agile Earth observation satellites," Working Papers of Department of Decision Sciences and Information Management, Leuven 627938, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
  • Handle: RePEc:ete:kbiper:627938
    Note: paper number KBI_1813
    as

    Download full text from publisher

    File URL: https://lirias.kuleuven.be/retrieve/518634
    File Function: Published version
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Agile Earth observation satellites; Integer programming; Column generation heuristic; Interval scheduling;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ete:kbiper:627938. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: library EBIB (email available below). General contact details of provider: https://feb.kuleuven.be/KBI .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.