Research on Path Planning Based on the Integrated Artificial Potential Field-Ant Colony Algorithm

With the development of artificial intelligence technology, automatic guided vehicle (AGV) path planning is widely used in many fields. Aiming at the problems of low convergence efficiency and easy to fall into local optimization of the traditional ant colony algorithm, this paper proposes an AGV path-planning method based on the artificial potential field-ant colony algorithm. The performance of the algorithm is improved by incorporating the artificial potential field attraction to construct the potential field heuristic function, dynamically adjusting the pheromone volatility coefficient, introducing multiple parameters to dynamically adjust the pheromone increment, and optimizing the path by using the pruning method and other improvement measures. The simulation experiments in 20 × 20 and 30 × 30 grid environments show that the improved algorithm already has significant advantages over the traditional algorithm and other improved ACO algorithms in terms of path length, convergence speed and the number of path inflection points, verifying its high efficiency and stability, and providing a better solution for AGV path planning.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2025-04-19
DOI
https://doi.org/10.3390/app15084522
Citations
6
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
7.66

Funders

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

Research on Path Planning Based on the Integrated Artificial Potential Field-Ant Colony Algorithm

Yuanhua Liu, Yuhua Li
6 citations
Applied Sciences
Robotic Path Planning Algorithms
7.66
article

Research on Path Planning Based on the Integrated Artificial Potential Field-Ant Colony Algorithm

Yuanhua Liu, Yuhua Li
article en
6 citations

Abstract

With the development of artificial intelligence technology, automatic guided vehicle (AGV) path planning is widely used in many fields. Aiming at the problems of low convergence efficiency and easy to fall into local optimization of the traditional ant colony algorithm, this paper proposes an AGV path-planning method based on the artificial potential field-ant colony algorithm. The performance of the algorithm is improved by incorporating the artificial potential field attraction to construct the potential field heuristic function, dynamically adjusting the pheromone volatility coefficient, introducing multiple parameters to dynamically adjust the pheromone increment, and optimizing the path by using the pruning method and other improvement measures. The simulation experiments in 20 × 20 and 30 × 30 grid environments show that the improved algorithm already has significant advantages over the traditional algorithm and other improved ACO algorithms in terms of path length, convergence speed and the number of path inflection points, verifying its high efficiency and stability, and providing a better solution for AGV path planning.

Applied SciencesVol. 15(8)
University of Shanghai for Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 3%
Robotic Path Planning Algorithms
7.66
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.