Research on path planning based on improved artificial potential field method

Aiming at the unreachable target and local minimum problems existing in the traditional artificial potential field method in the path planning of mobile robots, an improved artificial potential field method is proposed. Firstly, when there are obstacles near the target point, the robot is difficult to reach the target point due to the large repulsive force. A safety distance factor is introduced in the potential field, and the parameter is optimized, so that the robot can maintain a suitable distance from the obstacle and reach the target point smoothly. Secondly, in order to solve the local minimum problem, the local minimum judgment condition is introduced, and when the condition is triggered, the local minimum area is bypassed, so that the robot can reach the target point smoothly. The simulation results show that the improved algorithm runs in the environment of different numbers of obstacles and has strong robustness. The proposed algorithm can enable the robot to bypass the local minimum area in the U-shaped obstacle environment, and successfully solves the local minimum problem in the path planning of mobile robots.

Authors

Publication Details

Journal
Scientific insights and discoveries review
Published
2024-10-11
DOI
https://doi.org/10.59782/sidr.v3i1.74
Citations
4
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on path planning based on improved artificial potential field method

Chun-li Xie, Jiahao Li, Tao Tianyi
4 citations
Scientific insights and discoveries review
Robotic Path Planning Algorithms
1.00
article

Research on path planning based on improved artificial potential field method

Chun-li Xie, Jiahao Li, Tao Tianyi
article en
4 citations

Abstract

Aiming at the unreachable target and local minimum problems existing in the traditional artificial potential field method in the path planning of mobile robots, an improved artificial potential field method is proposed. Firstly, when there are obstacles near the target point, the robot is difficult to reach the target point due to the large repulsive force. A safety distance factor is introduced in the potential field, and the parameter is optimized, so that the robot can maintain a suitable distance from the obstacle and reach the target point smoothly. Secondly, in order to solve the local minimum problem, the local minimum judgment condition is introduced, and when the condition is triggered, the local minimum area is bypassed, so that the robot can reach the target point smoothly. The simulation results show that the improved algorithm runs in the environment of different numbers of obstacles and has strong robustness. The proposed algorithm can enable the robot to bypass the local minimum area in the U-shaped obstacle environment, and successfully solves the local minimum problem in the path planning of mobile robots.

Scientific insights and discoveries reviewVol. 3
Sustainable cities and communities
Openalex Percentile: Top 22%
Robotic Path Planning Algorithms
1.00
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.