舰船电子工程2025，Vol.45Issue(3)：43-49,7.DOI:10.3969/j.issn.1672-9730.2025.03.010
一种严密的舰艇最短距离航线高效规划方法
Automatic Route Planning for Ship with High Tightness and Efficiency
摘要
Abstract
Due to the limitations of the existing methods that with weak tightness and efficiency when using multiple charts fused obstacle data,a method for automatically route planning for ship based on adaptive and constrained Delaunay triangulation is proposed.First,from the perspective of free space theory,the spatial filling points and the boundary of obstacles is extracted from charts,and the adaptive and constrained Delaunay triangulation is constructed to reduce the complexity of space.Next,the network map is constructed,and an improved Bidirectional A*algorithm is proposed to reduce the impact of data volume on the route plan-ning algorithm.Finally,considering the possible precision error of the method above in route distance,an"inflection point"algo-rithm is proposed to smoothing and optimizing the route.The experimental results demonstrate that the proposed method absorb the advantages of the existing methods,and can generate the route between two arbitrary points at sea based on high-precision geograph-ic information.Besides,with a controllable error,the proposed method with more efficiency than that for the existing methods,ex-panding the applicability of this method.关键词
自适应三角网/航线规划/自由空间/改进A*算法/拐点算法Key words
adaptive triangulation/route planning/free space/improved A*algorithm/inflection point algorithm分类
交通工程引用本文复制引用
戴泽源,周寅飞,张立华,贾帅东,吴迪..一种严密的舰艇最短距离航线高效规划方法[J].舰船电子工程,2025,45(3):43-49,7.基金项目
国家自然科学基金项目(编号:41871369,41901320,41774014)资助. （编号:41871369,41901320,41774014）
