Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 7304506, 16 pages
Research Article

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

School of Electronic Science and Engineering, National University of Defense Technology, Hunan, Changsha 410073, China

Correspondence should be addressed to Hao Chen; nc.ude.tdun@nehch

Received 1 October 2017; Revised 19 November 2017; Accepted 27 November 2017; Published 27 December 2017

Academic Editor: Simone Cinquemani

Copyright © 2017 Shuang Peng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.