English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26999/38800
Visitors : 2398679      Online Users : 91
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/37010

Title: A Method for Searching Optimal Routes with Collision Avoidance on Raster Charts
Authors: Ki-Yin Chang;Gene Eu Jan;Ian Parberry
Contributors: 國立臺灣海洋大學:商船學系
Keywords: Charts;Raster charts;Maze routing;Optimal route
Date: 2003-09
Issue Date: 2015-12-24T01:56:28Z
Publisher: The Journal of Navigation
Abstract: Abstract:Collision avoidance is an intensive discussion issue for navigation safety. This article introduces a new routing algorithm for finding optimal routes with collision detection and avoidance on raster charts or planes. After the required data structure of the raster chart is initialized, the maze routing algorithm is applied to obtain the particular route of each ship. Those ships that have potential to collide will be detected by simulating the particular routes with ship domains. The collision avoidance scheme can be achieved by using the collision-area-marking method with collision avoidance rules at sea. The algorithm has linear time and space complexities, and is sufficiently fast to perform real-time routing on the raster charts.
Relation: 56(3), pp.371-384
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/37010
Appears in Collections:[商船學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML98View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback