IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7304506.html
   My bibliography  Save this article

Approximate Path Searching Method for Single-Satellite Observation and Transmission Task Planning Problem

Author

Listed:
  • Shuang Peng
  • Hao Chen
  • Jun Li
  • Ning Jing

Abstract

Satellite task planning not only plans the observation tasks to collect images of the earth surface, but also schedules the transmission tasks to download images to the ground station for users’ using, which plays an important role in improving the efficiency of the satellite observation system. However, most of the work to our knowledge, scheduling the observation and transmission tasks separately, ignores the correlation between them in resource (e.g., energy and memory) consumption and acquisition. In this paper, we study the single-satellite observation and transmission task planning problem under a more accurate resource usage model. Two preprocessing strategies including graph partition and nondominated subpaths selection are used to decompose the problem, and an improved label-setting algorithm with the lower bound cutting strategy is proposed to maximize the total benefit. Finally, we compare the proposed method with other three algorithms based on three data sets, and the experimental result shows that our method can find the near-optimal solution in much less time.

Suggested Citation

  • Shuang Peng & Hao Chen & Jun Li & Ning Jing, 2017. "Approximate Path Searching Method for Single-Satellite Observation and Transmission Task Planning Problem," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-16, December.
  • Handle: RePEc:hin:jnlmpe:7304506
    DOI: 10.1155/2017/7304506
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2017/7304506.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2017/7304506.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2017/7304506?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    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:hin:jnlmpe:7304506. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.