基於區域性資訊的路徑規劃與引導機制

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Thesis > Item 987654321/52395

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

Title:	基於區域性資訊的路徑規劃與引導機制
Other Titles:	An itinerary planning scheme based on local information
Authors:	江肇元;Chiang, Chao-yuan
Contributors:	淡江大學資訊工程學系碩士班蔡憶佳;Tsai, Yih-jia
Keywords:	路徑規劃;網路模型;選徑;route planning;network model;routing
Date:	2010
Issue Date:	2010-09-23 17:35:54 (UTC+8)
Abstract:	電子地圖相關的應用在近年來相當受到矚目，其中相當有趣且值得研究的議題是路徑規劃與導引。這個議題牽涉到了在網路模型中尋找最短路徑或最低成本路徑的問題。將各種路徑、道路以及運輸系統已適當的網路模型表達，就可以套用與圖論、網路模型等領域相關的最短路徑或最低成本路徑演算法。本研究提出一套基於區域資訊與網路模型的路徑規劃與引導機制，此機制的優點為運算更具有效率，且可以依照環境變化動態提供引導服務。本研究也提出了此機制的可能應用情境。本論文第一章會對研究內容作初步的介紹，接著介紹相關研究、本研究設計的網路模型、演算法、實驗結果以及結論，最後會附上本研究的參考資料。 The applications of electronic maps have become more and more popular. An interesting field is itinerary or route planning and navigation. This is related to the shortest path or lowest-cost path problem on graph. The roads and public transit systems can represent as a network model. Applying routing algorithms on the network model would find out a shortest path or lowest-cost path on map. We proposed a scheme based on local information of each node to find lowest-cost path on the network model. The advantages of this scheme are computing efficiency and guiding dynamically. We also proposed the possible applications for this scheme. This paper is organized with introduction, related works, network model, algorithms we proposed, simulation, conclusions and references.
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Thesis

Files in This Item:

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

Loading...