An Improved Ant Colony Algorithm for Solving the Path Planning Problem of the Omnidirectional Mobile Vehicle

Abstract EN

This paper presents an improved ant colony algorithm for the path planning of the omnidirectional mobile vehicle.

The purpose of the improved ant colony algorithm is to design an appropriate route to connect the starting point and ending point of the environment with obstacles.

Ant colony algorithm, which is used to solve the path planning problem, is improved according to the characteristics of the omnidirectional mobile vehicle.

And in the improved algorithm, the nonuniform distribution of the initial pheromone and the selection strategy with direction play a very positive role in the path search.

The coverage and updating strategy of pheromone is introduced to avoid repeated search reducing the effect of the number of ants on the performance of the algorithm.

In addition, the pheromone evaporation coefficient is segmented and adjusted, which can effectively balance the convergence speed and search ability.

Finally, this paper provides a theoretical basis for the improved ant colony algorithm by strict mathematical derivation, and some numerical simulations are also given to illustrate the effectiveness of the theoretical results.