NAPF-A*: A nonlinear APF fused A* algorithm for smooth path planning of port AGVs

Automated Guided Vehicles (AGVs) serve as key equipment for horizontal cargo handling at container terminals, and their path planning performance is of great significance for achieving smart and efficient port operations. To address the issues of unreachable targets and path oscillations in the traditional Artificial Potential Field (APF) algorithm, as well as the excessive polylines and poor adaptability to dynamic environments in the A* algorithm when applied to port AGVs, this paper proposes a NAPF-A* fusion path planning method for port AGVs. By constructing a nonlinear potential field function, a novel Nonlinear Artificial Potential Field (NAPF) algorithm is developed to overcome the inherent limitations of the conventional APF approach. This NAPF algorithm is then integrated with an A* algorithm enhanced by eight-direction neighborhood search and cubic Bézier curves, forming the NAPF-A* hybrid algorithm that achieves an effective combination of global optimal planning and real-time dynamic obstacle avoidance. Simulation experiments under static and dynamic environments as well as physical tests on the TurtleBot3 platform verify the superiority of the proposed algorithm, which can reduce the peak acceleration and path length of AGVs.

Authors

Institutions

Publication Details

Journal
Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science
Published
2026-08-26
DOI
https://doi.org/10.1177/09544062261476740
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

NAPF-A*: A nonlinear APF fused A* algorithm for smooth path planning of port AGVs

Zhou He, Yilin Mei, Liang Li
Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science
Robotic Path Planning Algorithms
article

NAPF-A*: A nonlinear APF fused A* algorithm for smooth path planning of port AGVs

Zhou He, Yilin Mei, Liang Li
article en

Abstract

Automated Guided Vehicles (AGVs) serve as key equipment for horizontal cargo handling at container terminals, and their path planning performance is of great significance for achieving smart and efficient port operations. To address the issues of unreachable targets and path oscillations in the traditional Artificial Potential Field (APF) algorithm, as well as the excessive polylines and poor adaptability to dynamic environments in the A* algorithm when applied to port AGVs, this paper proposes a NAPF-A* fusion path planning method for port AGVs. By constructing a nonlinear potential field function, a novel Nonlinear Artificial Potential Field (NAPF) algorithm is developed to overcome the inherent limitations of the conventional APF approach. This NAPF algorithm is then integrated with an A* algorithm enhanced by eight-direction neighborhood search and cubic Bézier curves, forming the NAPF-A* hybrid algorithm that achieves an effective combination of global optimal planning and real-time dynamic obstacle avoidance. Simulation experiments under static and dynamic environments as well as physical tests on the TurtleBot3 platform verify the superiority of the proposed algorithm, which can reduce the peak acceleration and path length of AGVs.

Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science
Wuhan University of Science and Technology (CN), Shaanxi University of Science and Technology (CN)
National Natural Science Foundation of China, Natural Science Basic Research Program of Shaanxi Province
Openalex Percentile: Top 12%
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.