.png){kind=icon}
返回
An improved ant colony algorithm for robot path planning
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-016-2161-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To solve the problems of convergence speed in the ant colony algorithm, an improved ant colony optimization algorithm is proposed for path planning of mobile robots in the environment that is expressed using the grid method. The pheromone diffusion and geometric local optimization are combined in the process of searching for the globally optimal path. The current path pheromone diffuses in the direction of the potential field force during the ant searching process, so ants tend to search for a higher fitness subspace, and the search space of the test pattern becomes smaller. The path that is first optimized using the ant colony algorithm is optimized using the geometric algorithm. The pheromones of the first optimal path and the second optimal path are simultaneously updated. The simulation results show that the improved ant colony optimization algorithm is notably effective.
Keyword:
Mobile robot
Ant colony algorithm
Pheromone diffusion
Local path optimization
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
The origin of the Debye relaxation in liquid water and fitting the high frequency excess response
OAAI
OAAI分享收藏
Energy, exergy, and economic analyses of a novel biomass-based multigeneration system integrated with multi-effect distillation, electrodialysis, and LNG tank.png)
DesalinationOAAI
DesalinationIF0
OAAI分享收藏A computational ecosystem for optimization: review and perspectives for future researchMEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
分享收藏Particle swarm optimization-based planning and scheduling for a laminar-flow operating room with downstream resourcesSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏Bacterial memetic algorithm for offline path planning of mobile robots细菌模因算法在移动机器人离线路径规划中的应用MEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
分享收藏
查看更多内容