碩士 / 國防管理學院 / 國防資訊研究所 / 87 / With the rapid economic growth, the city traffic problems are getting worse and worse. Many developed countries are also figuring out the improvement of traffic by using high technologies. The vehicle navigation system is one of the hot topics studied by information technologic people. In the architecture, besides the positioning, map mapping, and directing system, the route planning system is also one very important part of the navigation system; it is to offer the drivers a path from the beginning to the destination for their reference. The shortest path algorithm in the route planning system could be the major role for this job. In other words, whether the shortest path algorithm is precise or not will directly result in the success of the route planning system. Therefore in this thesis, we explore the shortest path algorithms and implement the Dijkstra and A* algorithm to compare the differences between them.
In addition, the previous studies or systems didn''t solve the problem of avoiding no left-turn intersection, so it would make the drivers feel inconvenient when they follow the shortest path which includes a no left-turn intersection. In the study, a new revised algorithm has been presented and the mentioned problem is solved without increasing too much checking and calculating.
In the end, combining the wireless digital function and real-time traffic information together the purposed pototype system in this thesis provides the drivers the best and the fastest path without any congestion.
| Identifer | oai:union.ndltd.org:TW/087NDMC0654019 |
| Date | January 1999 |
| Creators | Hsu Hsaio-Wen, 徐曉文 |
| Contributors | Wen Wu, 文武 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 108 |
Page generated in 0.0018 seconds