The Method Based On Dijkstra Of Multi-directional Ship’s Path Planning
The Method Based On Dijkstra Of Multi-directional Ship’s Path Planning
复制标题
基于Dijkstra的多向船舶路径规划方法
DOI：
10.1109/ccdc49329.2020.9164597
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Qin Zhao
中科院分区：
文献类型：
--
作者：
Z. Cheng;Huajun Zhang;Qin Zhao
针对船舶直航最短路径优化问题，对Dijkstra算法进行了改进。采用光栅化和肿胀的方法对船舶航区环境进行建模。然后对基于Dijkstra算法的四向搜索、八向搜索和任意角度搜索进行了改进，并对三种搜索方法进行了比较。仿真实验和研究结果表明，改进的任意角度搜索法最能满足最短直飞路径的要求。
Aiming at the problem of the shortest path’s optimization for direct navigation of ships, the Dijkstra algorithm search is improved. The environment of the ship’s navigation area was modeled by rasterization and swelling. Then the four-direction search,eight-direction search and arbitrary-angle search based on the Dijkstra algorithm were improved, and the three search methods were compared. Simulation experiments and research results show that the improved arbitrary angle search method can best meet the requirement of the shortest direct flight path.