Scholay

学术搜索 · AI 审稿 · LaTeX 协作

Ant Colony Optimization algorithm for robot path planning

作者:Michael Brand, Michael Masuda, Nicole Wehner, Xiao-Hua Yu · 年份:2010 · DOI:10.1109/iccda.2010.5541300 · 被引用次数:187 · 研究领域:Robotic Path Planning Algorithms、Robotics and Sensor-Based Localization、Advanced Manufacturing and Logistics Optimization

Path planning is an essential task for the navigation and motion control of autonomous robot manipulators. This NP-complete problem is difficult to solve, especially in a dynamic environment where the optimal path needs to be rerouted in real-time when a new obstacle appears. The ACO (Ant Colony Optimization) algorithm is an optimization technique based on swarm intelligence. This paper investigates the application of ACO to robot path planning in a dynamic environment. Two different pheromone re-initialization schemes are compared and computer simulation results are presented.