| Summary: | 碩士 === 國立新竹教育大學 === 人資處數學教育碩士班 === 98 === This thesis presents on scheduling of satellite imaging tasks solving. For satellite routing and imaging tasks have different resources combinations and limitations. The imaging scheduling problem is a complicated problem that needs to consider various kinds of parameters, which including the power and thermal constrain of satellite, changeover efforts between two consecutive imaging operations (tasks). The goal of satellite imaging scheduling is based on these limitations to find the maximum image tasks as we can do. As considering various kinds of parameters in the scheduling problem, which belong to the NP-hard in computational complexity, we follow the heuristic algorithm to find the approximation solution. The solution algorithms include Earliest Due Date first rule, Earliest Start Time first rule. Base on these algorithms and considering task distribution, satellite position with angle of len to target images and satellite routing with high speed. The results indicate that the third algorithm,
EST-modifying.
In the EST-modifying algorithm in this research, we found EST-modifying algorithm have 56% improvement to get the approximation solution from the samples in this thesis. EST-modifying algorithm is a significant way to improve satellite imaging tasks solving by approximation solution.
|
|---|
