A Novel Unmanned Ship Route Planning Approach Based on A-Star Algorithm and Artificial Potential Field Method

For the multi-target point path planning of unmanned garbage salvage ships in the environment with dynamic and static obstacles, a global path planning algorithm that combines the A* algorithm and the artificial potential field method is designed. The Euclidean distance between each target point is obtained by traversing all target points through the A* algorithm to obtain the cost function, and then the node order of path planning is obtained through this cost function. At the same time, the gravitational and repulsive force functions of the artificial potential field method are used for obstacle avoidance, and finally the path is planned. The fusion algorithm proposed in this paper solves the problem of low smoothness of the traditional A* algorithm and optimizes its dynamic obstacle avoidance. In the simulation experiment, the planned path can avoid obstacles when there are dynamic obstacles, and the path is relatively smooth.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/cvci63518.2024.10830075
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel Unmanned Ship Route Planning Approach Based on A-Star Algorithm and Artificial Potential Field Method

Lei Rong, Xiaoxue Tian, Fan Li
Robotic Path Planning Algorithms
article

A Novel Unmanned Ship Route Planning Approach Based on A-Star Algorithm and Artificial Potential Field Method

Lei Rong, Xiaoxue Tian, Fan Li
article en

Abstract

For the multi-target point path planning of unmanned garbage salvage ships in the environment with dynamic and static obstacles, a global path planning algorithm that combines the A* algorithm and the artificial potential field method is designed. The Euclidean distance between each target point is obtained by traversing all target points through the A* algorithm to obtain the cost function, and then the node order of path planning is obtained through this cost function. At the same time, the gravitational and repulsive force functions of the artificial potential field method are used for obstacle avoidance, and finally the path is planned. The fusion algorithm proposed in this paper solves the problem of low smoothness of the traditional A* algorithm and optimizes its dynamic obstacle avoidance. In the simulation experiment, the planned path can avoid obstacles when there are dynamic obstacles, and the path is relatively smooth.

Anhui University of Science and Technology (CN)
Openalex Percentile: Top 74%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Novel Unmanned Ship Route Planning Approach Based on A-Star Algorithm and Artificial Potential Field Method — Lei Rong, Xiaoxue Tian, et al. · (2024) | TGRS Research Map | TGRS