Optimal Algorithms for the Single Satellite Imaging Scheduling Problem

• Main Author: 楊福源
• Other Authors: 游素珍
• Format: Others
• Language: zh-TW
• Online Access: http://ndltd.ncl.edu.tw/handle/47605156760111958199

碩士 === 國立新竹教育大學 === 人資處數學教育碩士班 === 97 === This thesis assumes the imaging process of the satellite with unturned lens and one-circle rotating around the same mission orbit, the two-time imaging at most. We propose the optional Algorithm of the maximum imaging. First, we apply EST (earliest start time first) and radix sort to compile statistics and sort the data of imaging objects with different mission sections. Then, we propose “the optional composing Algorithm” to get the maximum of frequency imaging and enable to get the optional Algorithm for Single satellite imaging scheduling problem. Finally, we apply software of random practice to get imaging objects and design the optional Algorithm program to get the optional scheduling of test samples. As the strategy decision of satellite imaging scheduling is a NP-Complete complicate operation, at present the related researches focus on the approximate mode. Therefore, this thesis put on the condition of fixed lens, imaging frequency, imaging time by integral minute plus or minus, etc. Although it can not completely match the practical demand of satellite imaging operation, it still can offer the proposal for strategy making, such as vertical imaging scheduling operation for the present and future demand of high quality image.