臺灣博碩士論文加值系統

本論文目標在於探討一分散式架構之飛彈聯合防禦系統中幾個主要的問題，包括火力分配的問題、動態模擬問題、分散式架構及分散式架構下飛彈間與偵察雷達間必要的通訊問題。火力分配問題，我們提出一目標函式考慮設施保護效益(Facilities Protection Benefit, FPB)、攔截效益(Intercept Benefit, IB)、成本效益(Cost Benefit, CB)等參數作為火力分配要達成的目標，並利用改良式規則法則貪婪演算法迅速完成優質的火力分配結果。動態模擬問題我們利用Google Map作為模擬戰場地理圖資，並以動態模擬的方式，推演真實戰況可能會遭遇的狀況。我們在此模擬的數位戰場中建立飛彈聯合防禦系統的分散式架構，在模擬真實戰場上部署在各地的作戰單位。而各作戰單位透過本系統所構建的通訊方式，進行資料的傳遞，來模擬實際戰況。透過網頁等相關技術所建立的數位戰場可動態模擬實際接戰過程與呈現接戰結果，能更加直觀地使決策者瞭解火力分配品質的好壞。
在模擬實驗部份，我們自行設計一個分散式戰場模擬情境，並根據模擬結果紀錄我方設施遭受敵方目標攻擊後的存活數量、火力分配平均執行時間、平均總耗火力成本、擊毀目標的平均殲敵率，可以證明本論文提出的改良式規則法則貪婪演算法能夠獲得較優質的分配結果。另外，統計在不同演算法的運算下各種火力的平均使用率，可以證明改良式規則法則貪婪演算法能提升我方部署火力的使用率，而非讓某命中率高但成本昂貴的火力單元專美於前，讓其他種類的火力單元也能發揮其功用。
最後，可以利用模擬的結果來研擬火力佈署的策略（例如火力單元的位置、數量與種類等），找出最佳的空中防衛戰略，捍衛我國空防安全。

This thesis aims to address the several problems in a distributed Joint Missile Defense System (JMDS) which includes weapon-target-assignment (WTA), dynamic simulation, distributed architecture, and the communication between firepowers and radars. We propose an objective function which pursues Facilities Protection Benefit (FPB), Intercept Benefit (IB) and Cost Benefit (CB). Also, we utilize improved rule-based greedy algorithm to complete WTA. For dynamic simulation, we apply Google Map to be a simulated battlefield and simulate some scenarios which could encounter in the real situations. We build a distributed architecture of the JFDS to simulate military operation units located at different place in battleground. These operation units can communicate each other. Through the technique of web-page, we can watch the process of engagement and review the result visually and intuitively so that commander can understand the quality of weapon-target-assignment result.
At the simulation experiment, we design a scenario and record the result which includes the average quantity of our facility, the average execution time of the weapon-target-assignment, the average cost of firepower consumption, and the average percentage of target devastation. Regard to the experiment result, we can prove that it is better solution to solve WTA problem through the improved algorithm which we propose. At the same time, we also record the average utilization rate of firepower under the different algorithms. We can prove that it is better to enhance the utilization rate of all our deployed firepowers under the improved rule-based greedy algorithm. The better but high-cost firepower won’t be the first choice; instead, the others which equip middle-or-low level can also be exploited well.
Finally, we can utilize the simulated result for deploying firepowers and adjusting position and quantity to find the best airspace defense management strategy.

誌謝 ii
摘要 iii
Abstract v
目錄 vii
表目錄 ix
圖目錄 x
1. 緒論 1
1.1 研究背景及動機 1
1.2 研究目的 2
1.3 論文架構 2
1.4 研究範圍與限制 2
2. 文獻探討 4
2.1 目標函式 5
2.2 火力分配演算法 6
2.3 分散式架構 10
3. 系統架構 18
3.1 目標函式 18
3.1.1 設施保護效益(Facilities Protection Benefit, FPB) 19
3.1.2 攔截效益(Intercept Benefit, IB) 20
3.1.3 成本效益(Cost Benefit, CB) 20
3.1.4 限制條件 21
3.1.5 目標函式 22
3.1.6 VQP函式 22
3.2 改良式規則法則貪婪演算法 24
3.3 分散式系統架構 30
4. 模擬實驗與分析 36
4.1 戰場想定 36
4.2 戰場物件參數 37
4.2.1 火力單元參數 37
4.2.2 敵方目標參數 38
4.2.3 我方設施參數 38
4.3 戰場推演模擬分析 39
4.4 模擬結果與討論 45
5. 結論與未來研究方向 46
6. 參考文獻 47
自傳 50

[1] 102年中華民國國防報告書，國防部，台北，第62頁，2013。
[2] 林晏如，“飛彈聯合防禦系統之目標資源分配機制”，碩士論文，國防大學理工學院資訊工程研究所，桃園，2012。
[3] 錢柏志，“飛彈聯合防禦系統之數位戰場”，碩士論文，國防大學理工學院資訊工程研究所，桃園，2013
[4] Xin Bin, Chen Jie, Zhang Juan, Dou Lihua, and Peng Zhihong, “Efficient Decision Makings for Dynamic Weapon-Target Assignment by Virtual Permutation and Tabu Search Heuristics,” IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART C: APPLICATIONS AND REVIEWS, Vol. 40, No. 6, pp. 649-662, 2010.
[5] Peng Chen, Liu Xing, Mu Xiaomin, Du Yang, and Wu Sentang, “Cooperative Dynamic Weapon-target Assignment Algorithm of Multiple Missiles Based on Networks,” 2009 Chinese Control and Decision Conference, Guilin, China, pp.126-130, 2009.
[6] Xin Bin, Chen Jie, Peng Zhihong, Dou Lihua, and Zhang Juan, “An Efficient Rule-Based Constructive Heuristic to Solve Dynamic Weapon-Target Assignment Problem,” IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART A: SYSTEMS AND HUMANS, Vol. 41, No. 3, pp. 598-606, 2011.
[7] Xin Bin, Chen Jie, “An Estimation of Distribution Algorithm with Efficient Constructive Repair/Improvement Operator for the Dynamic Weapon-Target Assignment,” Control Conference, Hefei, China, pp. 2346-2351, 2012.
[8] Lloyd, Stuart P., and Hans S. Witsenhausen. “Weapons allocation is NP-complete,” Summer Computer Simulation Conference, Reno, NV, pp. 1054–1058, 1986.
[9] Hosein, Patrick Ahamad, and Michael Athans, “Preferential defense strategies Part I: The static case,” Massachusetts Institute of Technology, Laboratory for Information and Decision Systems, Cambridge, MA, 1990.
[10] Hosein, Patrick Ahamad, and Michael Athans, “Preferential defense strategies. Part II: The dynamic case,” Massachusetts Institute of Technology, Laboratory for Information and Decision Systems, Cambridge, MA, 1990.
[11] Wacholder E., “A neural network-based optimization algorithm for the static weapon-target assignment problem,” ORSA Journal on Computing, Vol. 1, No. 4, pp. 232–246, 1989.
[12] A. Malhotra and R. K. Jain, “Genetic algorithm for optimal weapon allocation in multilayer defence scenario,” Defence Science Journal, Vol. 51, No. 3, pp. 285–293, 2001.
[13] Cullenbine, C. A., “A taboo search approach to the weapon assignment model,” Master thesis, Department of Operational Sciences, Air Force Institute of Technology, Hobson Way, WPAFB, OH, 2000.
[14] Li, H. R. and Miao, Y., “WTA with the maximum kill probability based on simulated annealing algorithms,” in Proc. Conf. Spec. Committee C2 Comput. Electron. Technol. Acad. Committee China, pp. 436–440, 2000.
[15] Lee, Z. J., Lee, C. Y., and Su, S. F., “An immunity-based ant colony optimization algorithm for solvingweapon-target assignment problem,” Applied Soft Computing, Vol. 2, No. 1, pp. 39–47, 2002.
[16] Zeng X., Zhu Y., Nan L., Hu K., Niu B., and He X., “Solving weapon-target assignment problem using discrete particle swarm optimization,” in Proc 6th World Congress Intelligent Control and Automation, Dalian, China, pp. 3562–3565, 2006.
[17] Gao, S., “Solving Weapon-Target Assignment Problems by a New Ant Colony Algorithm,” International Symposium on Computational Intelligence and Design, Wuhan, China, pp. 221-224, 2008.
[18] Cho Byunggyu, Kim Dae Young, Kim Sae Hwan, Youn Cheong, “Real-Time Distributed Simulation Environment For Air Defense System Using A Software Framework”, The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology, Vol. 4, No. 2, pp. 64-79, 2007.
[19] “Modeling & Simulation Coordination Office” Available from: http://www.msco.mil/(2014.1.29)
[20] “Manager’s Guide to the High Level Architecture for Modelling and Simulation (HLA)” Available from: http://www.msco.mil/documents/_2_ITEC09%20-%20HLA%20Tutorial.pdf(2014.1.29)
[21] Anthony W. Potts, Fames W. Kelton, “The Need for Dynamic Airspace Management in Coalition Operation”, The International C2 Journal, Vol. 5, No. 3, 2011.
[22] Michael Howard, David Payton, “SYSTEM AND METHOD FOR DISTRIBUTED ENGAGEMENT”, United States Patent: US7912631B2 U.S.A., 2007.
[23] Kuhl.F., Weatherly,R., Dahmann,J. 著，付正軍，王永红譯，計算機仿真中的HLA技術，國防工業出版社，中國，第2-3頁，2003。