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

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.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Elisabeth M. Goodwin,et al.  A Statistical Study of Ship Domains , 1973, Journal of Navigation.

[3]  F. Rubin,et al.  The Lee Path Connection Algorithm , 1974, IEEE Transactions on Computers.

[4]  Jeffrey H. Hoel.  Some Variations of Lee's Algorithm , 1976, IEEE Transactions on Computers.

[5]  A. N. Cockcroft,et al.  A guide to the collision avoidance rules: International Regulations for Preventing Collisions at Sea 1972, in force 1977 , 1976 .

[6]  C. T. Stockel,et al.  A Computer Simulation of Multi-Ship Encounters , 1982, Journal of Navigation.

[7]  T. Coldwell.  Marine Traffic Behaviour in Restricted Waters , 1983, Journal of Navigation.

[8]  C. T. Stockel,et al.  A Marine Traffic Flow and Collision Avoidance Computer Simulation , 1984 .

[9]  Pierre Hansen,et al.  Finding shortest paths in the plane in the presence of barriers to travel (for any lp - norm) , 1985 .

[10]  F. Coenen,et al.  Knowledge-based Collision Avoidance , 1989, Journal of Navigation.

[11]  Yu-Chin Hsu,et al.  Hybrid routing , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[13]  Wu Zhao-lin,et al.  Comments on Ship Domains , 1993, Journal of Navigation.

[14]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[15]  Alfred M. Bruckstein,et al.  Finding Shortest Paths on Surfaces Using Level Sets Propagation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Fikret Erçal,et al.  Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..

[17]  John Dawson.  Digital charting, now and in the future , 1997 .

[18]  A. P. Norris.  THE STATUS AND FUTURE OF THE ELECTRONIC CHART , 1998 .

[19]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[20]  Kjetil Fagerholt,et al.  Shortest path in the presence of obstacles: An application to ocean shipping , 2000, J. Oper. Res. Soc..

[21]  Peter Robinson,et al.  Adaptive routing for road traffic , 2000 .

[22]  Russell Kao,et al.  Shortest path search using tiles and piecewise linear costpropagation , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..