Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-10T20:04:56.794Z Has data issue: false hasContentIssue false
  • English
  • Français

A Method for Searching Optimal Routes with Collision Avoidance on Raster Charts

Published online by Cambridge University Press:  26 August 2003

Ki-Yin Chang ,
Gene Eu Jan  and
Ian Parberry
Ki-Yin Chang
Affiliation:
National Taiwan Ocean University, Taiwan
Gene Eu Jan
Affiliation:
National Taiwan Ocean University, Taiwan
Ian Parberry
Affiliation:
University of North Texas, USA
Get access Rights & Permissions [Opens in a new window]

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.

Keywords

ChartsRaster chartsMaze routingOptimal route
Type
Research Article
Information
The Journal of Navigation , Volume 56 , Issue 3 , September 2003 , pp. 371 - 384
Copyright
© 2003 The Royal Institute of Navigation

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)