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

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.