跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.181) 您好!臺灣時間:2025/12/16 05:30
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:劉得佑
研究生(外文):Liu,Te-yu
論文名稱:在不可靠網路中應用分散式演算法解決火力分配決策問題之研究
論文名稱(外文):Distributed Heuristic Algorithm for the Weapon Target Assignment Problem in Unreliable Networks
指導教授:袁賢銘袁賢銘引用關係
指導教授(外文):Yuan, Shyan-Ming
口試委員:蔡清欉黃俊龍陳彥霖
口試委員(外文):Cai, Qing-CongHuang Jiun-LongChen, Yen-Lin
口試日期:2017-6-20
學位類別:碩士
校院名稱:國立交通大學
系所名稱:網路工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2017
畢業學年度:105
語文別:中文
論文頁數:53
中文關鍵詞:火力分配決策問題分散式系統啟發式演算法
外文關鍵詞:Weapon Target Assignment ProblemHeuristic AlgorithmDistributed System
相關次數:
  • 被引用被引用:0
  • 點閱點閱:175
  • 評分評分:
  • 下載下載:4
  • 收藏至我的研究室書目清單書目收藏:0
在戰場上,所有的決策都必須非常迅速,為了能在短時間找到最佳決策,
通常都會在火協機構放置cluster加速運算,減少計算的時間。但是當所有電腦統一放在同一個地方,容易遭受到攻擊,為了要避免此種情形,我們將各個運算的電腦,分散到各個火力單位,形成分散式架構,來解決容易遭受攻擊的問題。但當火力單位在移動或通訊設備遭到破壞時,導致各電腦的通訊不穩定,分散式架構在不可靠的環境下,會大大影響了計算的效能,與決策的統一性。在本論文中,我們利用Peer-to-Peer的分散式架構,並結合啟發式演算法來解決不可靠環境下所產生的問題。另外,我們以戰場上常見的火力分配決策問題
,來驗證我們的系統是否可靠。
All the decisions on the battlefield must be very fast. To find the best decision in a short time, usually place cluster architectures in the decision center to reduce the calculation time. However, when we put the computing resources in the same place, it will be attacked easily. In order to solve the problem of being attacked easily, we distribute computing units to various weapon to form a distributed system. But when weapons were moving or communications equipment was destroyed by enemies, the communication will be very unstable. The distributed system is not efficient on division of work and integration in the communication unreliable environment. In this thesis, we use distributed system of Peer-to-Peer Combined with heuristic algorithms to solve problems in the communication unreliable environment. In addition, we use weapon target assignment problem as an example to verify our system is reliable.
Chapter 1. 緒論 1
1.1 研究動機 1
1.3 論文大綱 3
Chapter 2. 背景與文獻探討 4
2.1 火力分配決策問題(Weapon Target Assignment) 4
2.1.1 火力分配決策問題定義 4
2.2 常用解決火力分配決策問題的方法 5
2.2.1 啟發式演算法(Heuristic Algorithm) 5
2.2.2 基因演算法 6
2.2.3 粒子群聚演算法 7
2.2.4 人工蜂群演算法 7
Chapter 3.啟發式演算法在WTA上應用 8
3.1 基因演算法在WTA上應用 8
3.2 粒子群聚演算法在WTA上的應用 11
3.3 人工蜂群演算法在WTA上的應用 13
Chapter 4. 系統設計 15
4.2 各端點架構 19
4.2.1 決策運算模組 21
4.2.2 通訊模組 22
Chapter 5. 實驗結果 23
5.1.1實驗環境與參數設置 23
5.1.2 封包遺失率(Loss rate) 25
5.1.3 最終決策的定義 26
5.1.4 隨機演算法 26
5.2 在 Single Thread 下比較不同演算法 28
5.3 在 Multi-Thread 下比較不同演算法 30
5.4 比較廣播間隔的差別 32
5.5 在雲端上執行分散式運算 35
Chapter 6. 結論與未來展望 51
6.1 結論 51
6.2 未來展望 51
Reference 52
[1] M. Rouse. (2008). DEFINITION master/slave.
[2] Apache™ Hadoop®! Available: http://hadoop.apache.org/
[3] J. Dean and S. Ghemawat, "MapReduce: simplified data processing on large clusters," Communications of the ACM, vol. 51, no. 1, pp. 107-113, 2008.
[4] C. George, J. Dollimore, T. Kindberg, and G. Blair, Distributed System: Concepts and Design (5th Edition). Boston: Addison-Wesley, 2011.
[5] R. Schollmeier, "A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications," in Peer-to-Peer Computing, 2001. Proceedings. First International Conference on, 2001, pp. 101-102: IEEE.
[6] L. Bianchi, M. Dorigo, L. M. Gambardella, and W. J. Gutjahr, "A survey on metaheuristics for stochastic combinatorial optimization," Natural Computing, vol. 8, no. 2, pp. 239-287, 2009.
[7] Wikipedia, "Weapon Target Assignment Problem."
[8] W. A. Metler, F. L. Preston, and J. Hofmann, "A suite of weapon assignment algorithms for a SDI mid-course battle manager," DTIC Document1990.
[9] S. P. Lloyd and H. S. Witsenhausen, "Weapons allocation is NP-complete," in 1986 Summer Computer Simulation Conference, 1986, pp. 1054-1058.
[10] M. Mitchell, An introduction to genetic algorithms. MIT press, 1998.
[11] J. Kennedy and R. Eberhart, "Particle Swarm Optimization," 1995.
[12] D. KARABOGA, "AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION," vol. 10, 2005.
[13] Z. Song, F. Zhu, and D. Zhang, "A heuristic genetic algorithm for solving constrained Weapon-Target Assignment problem," in 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, 2009, vol. 1, pp. 336-341.
[14] Z. J. Lee, S. F. Su, and C. Y. Lee, "A genetic algorithm with domain knowledge for weapon‐target assignment problems," Journal of the Chinese Institute of Engineers, vol. 25, no. 3, pp. 287-295, 2002/04/01 2002.
[15] Z. J. Lee, S. F. Su, and C. Y. Lee, "Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics," IEEE Trans Syst Man Cybern B Cybern, vol. 33, no. 1, pp. 113-21, 2003.
[16] X. Zeng, Y. Zhu, L. Nan, K. Hu, B. Niu, and X. He, "Solving weapon-target assignment problem using discrete particle swarm optimization," in Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on, 2006, vol. 1, pp. 3562-3565: IEEE.
[17] F. Bellifemine, A. Poggi, and G. Rimassa, "JADE–A FIPA-compliant agent framework," in Proceedings of PAAM, 1999, vol. 99, no. 97-108, p. 33: London.
[18] J. Pitt and F. Bellifemine, "A Protocol-Based Semantics for FIPA97 ACL and its Implementation in JADE," in AI* IA, 1999, vol. 99.
[19] D. Karaboga, "An idea based on honey bee swarm for numerical optimization," Technical report-tr06, Erciyes university, engineering faculty, computer engineering department2005.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top