以SOPC為基礎之蟻群最佳化演算法設計

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Thesis > Item 987654321/88113

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/88113

Title:	以SOPC為基礎之蟻群最佳化演算法設計
Other Titles:	SOPC based ant colony optimization algorithm design
Authors:	楊閔皓;Yang, Min-Hao
Contributors:	淡江大學電機工程學系碩士班李世安;Li, Shih-An
Keywords:	蟻群演算法;路徑規劃;軟硬體共同設計;Ant Colony Algorithm;FPGA;Hardware/Software Codesign;SoPC
Date:	2012
Issue Date:	2013-04-13 12:01:24 (UTC+8)
Abstract:	本論文提出一個以SOPC(System On a Programmable Chip)技術為核心之軟硬體共同設計將蟻群演算法實現於FPGA晶片上。本論文使用SOPC技術進行蟻群演算法之軟硬體電路設計，其設計方法主要分成兩個部分：(1) 選擇路徑，(2) 路徑分析。其中(1)選擇路徑屬於蟻群演算法的前置處理，需要耗費較久的運算處理時間，因此將在FPGA晶片內以設計成硬體電路，以加快處理速度。而(2)路經分析則會在NIOS II 處理器內以C語言的軟體方式實現。在本論文的實驗結果中得到可以用較少的處理時間獲得最佳的路徑資訊。 In this thesis, proposed ant colony algorithm based on a SOPC (System on a Programmable Chip) technique on the FPGA chip. In the design and implementation of ant colony algorithm based on a SOPC (System on a Programmable Chip) technique is applied to design two processing method: (1) Selecting path, (2) Path analysis. Selecting path belongs to the pre-processing of the ant colony algorithm takes a longer computing processing time, so design into a hardware circuit, in order to speed up processing. (2) path analysis will be to the C language software in the NIOS II processor. Experimental results found in this paper to the processing time can be less accurate path information.
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Thesis

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	213	View/Open

Loading...