跳到主要內容

臺灣博碩士論文加值系統

(34.226.244.254) 您好!臺灣時間:2021/08/03 03:19
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:余相寬
研究生(外文):Siang-KuanYu
論文名稱:應用啟發式演算法於非均勻線性陣列天線之設計
論文名稱(外文):Application of Meta-heuristic Algorithms to Design of Non-uniform Linear Antenna Arrays
指導教授:李坤洲李坤洲引用關係
指導教授(外文):Kun-Chou Lee
學位類別:碩士
校院名稱:國立成功大學
系所名稱:系統及船舶機電工程學系碩博士班
學門:工程學門
學類:機械工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:66
中文關鍵詞:啟發式演算法陣列天線最佳化
外文關鍵詞:meta-heuristicantenna arraysoptimization
相關次數:
  • 被引用被引用:0
  • 點閱點閱:175
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
陣列天線是目前最重要的電磁研究課題之一,也是一個複雜的非線性最佳化問題。本論文為了解決現實工程問題之需要,即降低實驗成本和減少實驗錯誤率的發生,故採用啟發式演算法去執行非均勻線性陣列天線的最佳化。在固定的陣列天線元素數目之下,藉由有效運用啟發式演算法,調整單元天線排列位置和激發權重,進而達到陣列天線最佳化的目的。
本論文主要是對非均勻線性陣列天線輻射場型進行研究,目的是要壓制陣列天線輻射場型的旁波瓣。首先,介紹陣列天線的相關知識和陣列波束函數,以及如何在限制條件內做最佳化處理。接著,利用各式不同的啟發式演算法對本論文提出的例子,透過調整不同參數來做最佳化,最後達到壓制陣列天線輻射場型旁波瓣的目的。本論文使用的啟發式演算法包含野草演算法、人工蜂群演算法、雙種群差分蜂群演算法以及和聲搜尋法。最佳化的目的是在限制一個主波瓣波束寬度的限制條件下,將旁波瓣級的峰值大小抑制到最低。模擬結果顯示,本論文使用的啟發式演算法執行容易且能有效率的達成最佳化目標,並收斂至全域解,能有效處理陣列天線最佳化問題。本研究的最佳化流程,並能應用於其他研究領域,非常適合用於處理工程領域之最佳化問題。

The problem of antenna array is one of the important research topics of electromagnetic waves. It is usually involved in complex nonlinear optimization. In this thesis, we plan to optimize the antenna array design for reducing experimental costs and chances of experimental errors. We studied the non-uniform linear antenna arrays by fixing the number of antenna elements, and adjusting positions and excited weights of antenna elements.
The main goal of this thesis is to reduce the side-lobe level for the radiation pattern of a non-uniform linear antenna array. Initially, fundamentals of antenna arrays and functions of radiation patterns are introduced. Next, detailed procedures for achieving the optimization under constraints are given. Different meta-heuristic algorithms are utilized to adjust array parameters for the purpose of lowest side-lobe level. The meta-heuristic algorithms utilized in this thesis include invasive weed algorithm, artificial bee colony algorithm, bi-group differential artificial bee colony algorithm, and harmony search. The goal is to obtain the lowest side-lobe level of a non-uniform linear antenna array under the constraint of certain beam-width limitation. Simulation results show that optimization of radiation patterns based on meta-heuristic algorithms is very efficient and has good performance. It should be emphasized that the results obtained by meta-heuristic algorithms are nearly globally optimum. The proposed optimization flowchart can also be utilized to treat many other nonlinear optimization problems in engineering.

摘要 II
Abstract III
誌謝 IV
目錄 V
表目錄 VII
圖目錄 VIII
符號 X
第一章 緒論 1
1-1 研究動機與目的 1
1-2 文獻回顧 2
1-3 研究貢獻 3
1-4 論文架構 3
第二章 線性陣列天線 5
2-1 簡介 5
2-2 陣列波束函數 6
2-3 陣列參數 7
第三章 應用野草演算法於非均勻線性陣列天線 11
3-1 簡介 11
3-2 公式 12
3-3 模擬 13
3-4 結語 14
第四章 應用人工蜂群演算法於非均勻線性陣列天線 24
4-1 簡介 24
4-2 公式 25
4-3 模擬 26
4-4 結語 28
第五章 應用雙種群差分蜂群演算法於非均勻線性陣列天線 36
5-1 簡介 36
5-2 公式 37
5-3 模擬 38
5-4 結語 40
第六章 應用和聲搜尋法於非均勻線性陣列天線 48
6-1 簡介 48
6-2 公式 48
6-3 模擬 50
6-4 結語 51
第七章 結論與未來展望 60
7-1結論 60
7-2未來展望 61
參考文獻 64
[1]R. E. Ziemer, W. H. Tranter, Principles of communications, 5th edition, John Wiley, New Jersey, 2002.
[2]C. L. Dolph, “A current distribution for broadside arrays which optimizes the relationship between beam width and side-lobe level, Proceedings of the IRE, Vol. 34, No. 6, pp. 335-348, 1946.
[3]J. H. Holland, Adaptation in natural and artificial systems, University of Michigan Press, Ann Arbor, 1975.
[4]M. Dorigo, T. Stutzle, Ant colony optimization, Cambridge, Mass, MIT Press, 2004.
[5]M. Clerc, Particle swarm optimization, ISTE, London, United Kingdom, 2006.
[6]R. K. Arora, N. C. V. Krishnamacharyulu, “Synthesis of unequally spaced arrays using dynamic programming, IEEE Trans. on Antennas and Propagation, Vol. 16, No. 5, pp. 593-595, 1968.
[7]P. Jarske, T. Saramaki, S. K. Mitra, Y. Neuvo, “On properties and design of nonuniformly spaced linear arrays, IEEE Trans. Acoust, Speech, Signal Process, Vol. 36, No. 3, pp. 372-380, 1988.
[8]V. Murino, A.Trucco, C. S. Regazzoni, “Synthesis of unequally spaced arrays by simulated annealing, IEEE Trans. Signal Processing, Vol. 40, No. 1, pp. 119-123, 1996.
[9]K. C. Lee, J. Y. Jhang, “Application of particle swarm algorithm to the optimization of unequally spaced antenna arrays, Journal of Electromagnetic Waves and Applications, Vol. 20, No. 14, pp. 2001-2012, 2006.
[10]M. A. Panduro, “Design of coherently radiating structures in a linear array geometry using genetic algorithms, AEU-International Journal of Electronics and Communications, Vol. 61, No. 8, pp. 515-520, 2007.
[11]E. Rajo-Iglesias, O. Quevedo-Teruel, “Linear array synthesis using an ant-colony-optimization-based algorithm, IEEE Antennas and Propagatuon Magazine, Vol. 49, No. 2, pp. 70-79, 2007.
[12]P. J. Bevelacqua, C. A. Balanis, “Minimum sidelobe levels for linear arrays, IEEE Trans on Antennas and Propagation, Vol. 55, No.12, pp. 3442-3449, 2007.
[13]張振晏,“應用最佳化演算法於通訊陣列之分析與設計,博士論文,國立成功大學系統與船舶機電工程研究所,(2009)。
[14]K. Guney, M. Onay, “Bees algorithm for interference suppression of linear antenna arrays by controlling the phase-only and both the amplitude and phase, Expert Systems with Applications, Vol. 37, No. 4, pp. 3129-3135, 2009.
[15]A. Chowdhury, R. Giri, A. Ghosh, S. Das, A. Abraham, V. Snasel, “Linear antenna array synthesis using fitness –adaptive differential evolution alogrithm, Evolution Computation, pp. 1-8, 2010.
[16]W. B. Wang, Q. Y. Feng, D. Liu, “Application of chaotic particle swarm optimization algorithm to pattern synthesis of Antenna Arrays, Progress In Electromagnetics Research, Vol. 115, pp. 173-189, 2011.
[17]湯伊鴻,“應用進化演算法於線性天線陣列之設計,碩士論文,國立成功大學系統與船舶機電工程研究所,(2011)。
[18]Y. T. Lo, “A mathematical theory of antenna arrays with randomly spaced elements, IEEE Trans on Antennas and Propagation, Vol. 12, No. 5, pp. 257–268, 1964.
[19]B. D. Van Veen, K. M. Buckley, “Beamforming: A versatile approach to spatial filtering, IEEE Acoustics Speech Signal Process Magazine, Vol. 5, No. 2, pp. 4-24, 1988.
[20]R. C. Hansen, Phased Array Antennas, 2nd edition, John Wiley, New Jersey, 2009.
[21]C. A. Balanis, Antenna theory: analysis and design, 3rd edition, John Wiley, New Jersey, 2005.
[22]A. R. Mehrabian, C. Lucas, “A novel numerical optimization algorithm inspired from invasive weed colonization, Ecological Informatics, Vol. 1, pp. 355-366, 2006.
[23]D. Karaboga, “An idea based on honey bee swarm for numerical optimization, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005.
[24]L. Bao, J. C. Zeng, “Comparison and analysis of the selection mechanism in the artificial bee colony alogrithm, Ninth International Conference on Hybrid Intelligent Systems, pp. 411-416, 2009.
[25]B. Akay, D. Karaboga, “Parameter tuning for the artificial bee colony algorithm, International Conference on Computer and Computational Intelligence, Vol. 5796, pp. 608-619, 2009.
[26]R. Storn, K. Price, “Differential evolution – A simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, Vol. 11, No. 4, pp. 341-359, 1997.
[27]L. Bao, J. C. Zeng, “A bi-group differential artificial bee colony algorithm, Control Theory & Applications, Vol. 28, No. 2, pp. 266-272, 2011.
[28]R. Mendes, A. S. Mohais, “DynDE : A differential evolution for dynamic optimization problems, IEEE congress on Evolutionary Computation, Vol. 3, pp. 2808-2815, 2005.
[29]Z. W. Geem, J. H. Kim, G. V. Loganathan, “A new heuristic optimization algorithm: harmony search, Simulation, Vol. 76, No. 2, pp. 60-68, 2001.

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊