RECORD DETAIL


Back To Previous

UPA Perpustakaan Universitas Jember

An improved ant colony algorithm for robot path planning

No image available for this title
t 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.

No copy data
Detail Information

Series Title

-

Call Number

-

Publisher

: ,

Collation

-

Language

ISBN/ISSN

-

Classification

NONE

Detail Information

Content Type

-

Media Type

-

Carrier Type

-

Edition

-

Specific Detail Info

-

Statement of Responsibility

No other version available
File Attachment