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.

关键词： the shortest distance routing spatial relations route segment obstacle area

作者: Zhang Li Zhang Lihua Wang Zhu Jia Shuaidong

作者单位: Department of Navigation,Dalian Maritime University,Dalian,Liaoning 116020,PR China Department of Hydrography and Cartography,Dalian Naval Academy,Dalian,Liaoning 116018,PR China

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 142-147

在线出版日期: 2010-03-27（万方平台首次上网日期，不代表论文的发表时间）