A method for the shortest distance routing in a chart based on testing a spatial relation of a route segment and an obstacle area

Author

Li, Zhang ; Zhang Lihua ; Zhu, Wang ; Shuaidong, Jia

Author_Institution

Dept. of Navig., Dalian Maritime Univ., Dalian, China

Volume

5

fYear

2010

fDate

27-29 March 2010

Firstpage

142

Lastpage

147

Abstract

An optimal planned route is a foundation of safe and economical navigation. This paper proposes a method for the shortest distance routing in a chart based on testing a spatial relation of a linear route segment and an obstacle area. Firstly, safety contour traces are traced and obstacle areas are acquired automatically. Then possible optimum paths circumambulating an obstacle are searched automatically by comparing the spatial relation of the linear route segment and the nearest obstacle area. Finally a route binary tree is constructed and the shortest route is obtained. Experimental results demonstrate that the proposed method has more advantageous over traditional methods in efficiency, accuracy and reliability.

Keywords

charts; computational geometry; navigation; optimisation; ships; trees (mathematics); chart; economical navigation; linear route segment; network optimization method; obstacle area; optimal planned route; route binary tree; safety contour traces; shortest distance routing method; spatial relation testing; Binary trees; Disaster management; Energy consumption; Marine vehicles; Navigation; Optimization methods; Power generation economics; Routing; Safety; Testing; obstacle area; route segment; spatial relations; the shortest distance routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Computer Control (ICACC), 2010 2nd International Conference on

Conference_Location

Shenyang

Print_ISBN

978-1-4244-5845-5

Type

conf

DOI

10.1109/ICACC.2010.5487275

Filename

5487275