Hostname: page-component-89b8bd64d-sd5qd Total loading time: 0 Render date: 2026-05-07T07:18:39.010Z Has data issue: false hasContentIssue false

Ship path planning based on multi-factor and multi-scale A* algorithm

Published online by Cambridge University Press:  02 March 2026

Zhengge Cao
Affiliation:
Navigation College, Dalian Maritime University, Dalian, Liaoning, China, zhangxk@dlmu.edu.cn, czg@dlmu.edu.cn
Xianku Zhang*
Affiliation:
Navigation College, Dalian Maritime University, Dalian, Liaoning, China, zhangxk@dlmu.edu.cn, czg@dlmu.edu.cn
*
Corresponding author: Xianku Zhang; Email: zhangxk@dlmu.edu.cn

Abstract

Ship path planning represents a fundamental challenge in intelligent navigation, requiring careful balance between route optimality, safety in complex marine environments. To address the limitations of conventional A* algorithms, this paper proposes an improved multi-factor and multi-scale A* algorithm. The methodology begins with processing ENC data, where canny edge detection combined with adaptive thresholding constructs obstacle maps. A novel dual-layer multi-scale grid framework is established: They are used to rapid global path searching, and precise collision avoidance. The algorithm innovatively integrates a multi-factor function that simultaneously considers obstacle distribution, environment effects, navigation rules, and ship dynamic constraints, with adaptive weight adjustment optimizing the search process. Path refinement employs smoothing algorithms to significantly reduce waypoint numbers. Simulation experiments conducted in Dalian port demonstrate the algorithm’s superior performance: maintaining safe clearance even in obstacle-dense areas and using the shorter length. Experimental results confirm that generated paths better satisfy practical navigation requirements.

Information

Type
Research Article
Copyright
© The Author(s), 2026. Published by Cambridge University Press on behalf of The Royal Institute of Navigation

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable