Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An improved ant colony algorithm for robot path planning

An improved ant colony algorithm for robot path planning 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Soft Computing Springer Journals

An improved ant colony algorithm for robot path planning

Loading next page...
 
/lp/springer-journals/an-improved-ant-colony-algorithm-for-robot-path-planning-yaT0gporTW

References (29)

Publisher
Springer Journals
Copyright
Copyright © 2016 by Springer-Verlag Berlin Heidelberg
Subject
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations; Control, Robotics, Mechatronics
ISSN
1432-7643
eISSN
1433-7479
DOI
10.1007/s00500-016-2161-7
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Soft ComputingSpringer Journals

Published: May 30, 2016

There are no references for this article.