Research on Path Planning Optimization Based on Adaptive Ant Colony Algorithm

Path planning is widely applied in scenarios such as traffic navigation, autonomous driving, and logistics distribution, holding significant theoretical and practical significance. Building upon the traditional ant colony algorithm, this paper proposes an adaptive ant colony algorithm tailored for path planning by adjusting the size of the pheromone evaporation factor. This approach addresses the limitations of the traditional ant colony algorithm, such as its tendency to get stuck in local optima and low search efficiency, and conducts simulation calculations on the algorithm. Simulation results show that the adaptive ant colony algorithm achieves an optimal path length of 29.8 after seven iterations. The traditional ant colony algorithm achieves the same optimal path length after 69 iterations. The comparison demonstrates that the adaptive ant colony algorithm exhibits superior search efficiency and global capabilities.

Authors

Institutions

Publication Details

Published
2025-06-20
DOI
https://doi.org/10.1109/caibda65784.2025.11182740
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

Research on Path Planning Optimization Based on Adaptive Ant Colony Algorithm

Jing Sun, Yan Zhang, Ruonan Liu
Robotic Path Planning Algorithms
article

Research on Path Planning Optimization Based on Adaptive Ant Colony Algorithm

Jing Sun, Yan Zhang, Ruonan Liu
article en

Abstract

Path planning is widely applied in scenarios such as traffic navigation, autonomous driving, and logistics distribution, holding significant theoretical and practical significance. Building upon the traditional ant colony algorithm, this paper proposes an adaptive ant colony algorithm tailored for path planning by adjusting the size of the pheromone evaporation factor. This approach addresses the limitations of the traditional ant colony algorithm, such as its tendency to get stuck in local optima and low search efficiency, and conducts simulation calculations on the algorithm. Simulation results show that the adaptive ant colony algorithm achieves an optimal path length of 29.8 after seven iterations. The traditional ant colony algorithm achieves the same optimal path length after 69 iterations. The comparison demonstrates that the adaptive ant colony algorithm exhibits superior search efficiency and global capabilities.

Asia University (JP)
Openalex Percentile: Top 72%
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.

Research on Path Planning Optimization Based on Adaptive Ant Colony Algorithm — Jing Sun, Yan Zhang, et al. · (2025) | TGRS Research Map | TGRS