Dijkstra算法
跳跃
算法
计算机科学
路径(计算)
运动规划
线路规划
北极的
点(几何)
最短路径问题
实时计算
人工智能
数学优化
数学
地质学
理论计算机科学
机器人
图形
量子力学
程序设计语言
海洋学
几何学
物理
作者
Youguo Sun,Jinfen Zhang,Da Wu,Wuliu Tian,Huabing Yin
标识
DOI:10.1109/ictis60134.2023.10243960
摘要
The ship faces the challenge of complex sea ice conditions in the Arctic. To ensure safety and minimize the distance and search path time of the Arctic navigation, we propose an intelligent ship path planning method considering the influence of sea ice in the Arctic using the Jump Point Search (JPS) algorithm. The method dynamically evaluates the navigability from the POLARIS during path planning. The paths planned by JPS are the same length and quality as those planned by Dijkstra and A* algorithms. The number of searched nodes and the running time of the JPS algorithm are 0.03% of those of the Dijkstra algorithm. Furthermore, the JPS algorithm searches 2.68% of nodes searched in the A* algorithm and takes 0.31% of the time spent by the A* algorithm. The JPS algorithm has been justified as a suitable replacement for ship path planning in complex sea ice conditions of the conventional Dijkstra and A* algorithms in the Arctic.
科研通智能强力驱动
Strongly Powered by AbleSci AI