碩士 / 國立海洋大學 / 電機工程學系 / 87 / Recently, Jan, Lin and Chen proposed a planar shortest path searching algorithm on raster electronic charts based on the radiation scheme. Their algorithm has the time complexity of O(N2) which have been reduced to O(N) furthermore in this thesis by using ripples scheme and extra data structure, where the term of N is the number of cells on the raster electronic chart. This algorithm can also be extended to find the shortest paths for q ships with a time complexity of O(qN).
The multiple-ship shortest paths searching algorithm can be applied to collision avoidance, and Search and Rescue(SAR) and Interceptions by using two additional schemes called collision-area-marking and time-matching and their time complexities are O(qN) and O(N), respectively.
| Identifer | oai:union.ndltd.org:TW/087NTOU0442046 |
| Date | January 1999 |
| Creators | 許俊彥 |
| Contributors | , 詹景裕, 黃玄煒 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 71 |
Page generated in 0.0014 seconds