本論文預設衛星在不轉動鏡頭且在繞行同一任務軌道一圈的取像過程中，最多二次取像的情況下，提出一套求最多取像之最佳解演算法。首先，採用「最早開始時間優先規則」( earliest start time first，簡記EST )和「基數排序法」( radix sort )等方法將取像目標之資料依不同任務區段加以統計及排序，最後提出「最佳組合演算法」來求得分次取像之最大值使得衛星取像排程獲得最佳解。最後利用軟體以亂數模擬產生取像目標，設計最佳組合演算法實測程式，求出實測樣本之最佳取像排程。
鑑於衛星取像排程之決策屬於NP-Complete複雜的作業，目前相關之研究皆以取得近似解為主，因此本論文特地加上限制條件，包括固定鏡頭、限制取像次數、取像時間以整數分鐘為單位增減等，雖然未能完全符合衛星實際取像運作之需求，但是對於我國現階段及未來要求較高影像品質，如垂直取像之排程作業能提供輔助決策建議方案之應用價值。

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.

[1] 水晶.台灣軍方衛星影像計畫祕辛.全球防衛雜誌, 2002年12月,第220期,第48-55頁.
[2] 福爾摩沙衛星二號.國家太空中心,太空計畫.
[3] Vasquez, M., and Hao,J. K. Upper Bounds for the SPOT 5 Daily photograph Scheduling Problem, Journal of Combinatorial Optimization, Vol. 7, pp. 2003, Mar, 87-103.
[4] Song, D., Stappen, A. F., and Goldberg, K., An Exact algorithm Optimizing Coverage-Resolution for Automated Satellite Frame Selection. Proceedings of the IEEE International Conference on Robotics and Automation, Orleans, LA, Vol. 1. 2004, MAY, pp. 63-70.
[5] 陳雅淑,林穎裕.衛星科技.科學發展, 2004年2月,第374期,第70~75頁.
[6] 太空遙測中心. 法國史波特衛星（SPOT）.國立中央大學太空及遙測研究中心：
[7] 陳良健. 遙測衛星──國土監測好幫手.科學發展,2003年5月,第365期,第28~33頁.
[8] 李建成.一覽無遺──衛星遙測影像.科學發展,2005年6月,第390期,第14~17頁.
[9] 黃正中.遙測衛星於民生科技的應用.國研科技，2004年1月,第1期，第13~19頁.
[10] 陳良健.遙測衛星──國土監測好幫手.科學發展,2003年5月,第365期,第28~33頁.
[11] 吳究（文字整理／張志玲）.21世紀的千里眼－－遙測科技.科學發展,2008年2月,第422期,第60~65頁.
[12] 黃中.台灣看世界的眼睛－福爾摩沙二號.科學發展, 2007年1月,第409期,第78頁.
[13] Lin, W. C., and Chang, S. C. Hybrid algorithms for satellite imaging scheduling. IEEE International Conference on Systems, Man and Cybernetics, Vol. 3, 2005, Oct. pp. 2518-2523.
[14] 楊淯琮.中華衛星二號取像任務排程問題－考慮天氣之隨機性.碩士論文,國立暨南國際大學資訊管理研究所,2003.
[15] 林偉誠.衛星取像排程之研究.博士論文,台灣大學電機工程學研究所,2005.
[16] 鄭琇璘.最佳化排程理論應用於衛星取像任務規劃之研究.碩士論文,國防大學中正理工學院電子工程研究所,2007.
[17] 李愷倫.皮米衛星姿態判定與控制次系統之設計與測試.碩士論文,國立成功大學航空太空工程研究所, 2004.
[18] 太空科技－福爾摩沙衛星二號.科技年鑑網,專題Ⅲ.
[19] 邱祈榮.森林經營的利器──遙測技術.科學發展,2003年6月,第366期,第24~27頁.
[20] 唐恒永,趙傳立.排序引論.科學出版社,北京, 2002,第234~239頁.
[21] 楊照崑,楊重駿.計算量問題,未來數學家的挑戰,中央研究院數學所, 2002.
[22] Manindra Agrawal, Neeraj Kayal, Nitin Saxena. PRIMES is in P. Annals of Mathematics 160, 2004, no. 2, pp. 781–793.
[23] S.J. Curran, and J.A. Gallian. Hamiltonian cycles and paths in cayley graphs and digraphs – a survey. Discrete Mathematics 156. 1996, pp. 1-18.
[24] S. A. Cook, The complexity of theorem proving procedures, Proceedings, Third Annual ACM Symposium on the Theory of Computing. New York：ACM, 1971, 151-158.
[25] Goodrich, M. T., and Tamassia, R., Algorithm Design: Foundations, Analysis, and Internet Examples, John Wiley, New York, 2001, pp. 592-642.
[26] Mendelson, E., Introduction to Mathematical Logic, Fourth Edition, Chapman & Hall/CRC, New York, 1997, pp. 328-366.
[27] Pinedo, M., Scheduling Theory, Algorithms, and Systems, Prentice Hall, London, 2008, pp. 1-32.
[28] B.J. Lageweg, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan (1981): Computer aided complexity classification of deterministic scheduling problems, Centre for Mathematics and Computer Science. 1981, Report BM 138
[29] Lageweg, B. J., Lenstra, J. K., Lawler, E. L., and Rinnooy Kan, A. H. G,. Computer-Aided complexity classification of combinational problems. Communications of the ACM, Vol. 25, pp. 1982, Nov., 817-822