Path planning for the mobile robot is to find a shortest obstacle free path from the starting
position to the target position. Ant colony optimization method is frequently used to obtain …

An improved ant colony algorithm was proposed with the unlimited step length of finding
optimal path. It aims at the shortcomings of the traditional ant colony algorithms such as the …

At present, the problem of global path planning research most concentrated in the known
information conditions. But the path planning of mobile robot is still an important problem to …

The basic ant colony algorithm for mobile robot path planning exists many problems, such
as lack of stability, algorithm premature convergence, more difficult to find optimal solution …

Aiming at the problems of slow convergence, easy to fall into local optimum, and poor
smoothness of traditional ant colony algorithm in mobile robot path planning, an improved …

In this paper, we address the problem that in path planning research, the traditional ant
colony algorithm suffers from slow convergence and is easily trapped in local optimal …

Aiming at the problems of the ant colony algorithm in the path planning of mobile robot, such
as the lack of stability, the slow convergence speed, the poor foresight and the tendency to …

This paper presents an improved ant colony algorithm to plan an optimal collision-free path
for mobile robot in complicated static environment. Based on the work space model with grid …

This paper introduced the basic principles of the ant algorithm. On this basis, the method of
dynamic mobile robot path planning based on ant algorithm is also proposed. Finally, the …

Under the condition of known static environment and dynamic environment, an improved ant
colony optimization is proposed to solve the problem of slow convergence, easily falling into …