测绘学报
• 学术论文 • 上一篇 下一篇
张立华1,苏奋振2,彭认灿1,暴景阳1
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
, , ,
Received:
Revised:
Online:
Published:
摘要: 优化的海图航线设计是舰船安全、经济航行的先导和基础。本文提出了一种基于瞬时水深模型的最短时间航线自动生成算法。基于海图静态水深和海域潮位模型,构建瞬时水深模型,动态提取碍航区,并进行航线可行性分析;利用动态规划思想,进行最短时间路径搜索;采用矩形包络分析、相近节点搜索和冗余点删除等策略,进行航线优化。实验表明:本文所提算法,能动态分析航线可行性,搜索最短时间航线; 与传统的最短时间航线算法相比,所提算法可提取航行时间更短的航线;所提取的最短时间航线,与舰船航行的起始时间和舰船航速相关。
Abstract: An optimal planned route is a foundation of safe and economical navigation. This paper proposes a method for the shortest time routing based on an instantaneous depth model. Firstly, an instantaneous model is constructed based static depths in a chart and a tidal model in a sea area, then obstacles are acquired and the navigability of a route is analyzed. Secondly, the shortest time path is searched using a dynamic programming method. Finally, the path is optimized by the strategies including excluding obstacles outside the rectangle border of all nodes, searching close nodes in next stage and deleting redundant nodes for a more direct navigation. Experimental results demonstrate: (1) the proposed method can analyze the navigability of the routes dynamically and acquire the shortest time route; (2) the route acquired by the proposed method has the shortest time than that by the traditional methods; (3) the shortest route depends on the start time of navigation and the ship speed.
张立华,苏奋振,彭认灿,暴景阳. 基于瞬时水深模型的最短时间航线自动生成算法[J]. 测绘学报.
, , ,. A method for the shortest time routing based on an instantaneous depth model[J]. Acta Geodaetica et Cartographica Sinica.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: http://xb.chinasmp.com/CN/
http://xb.chinasmp.com/CN/Y2010/V39/I5/516