With the development of computer technology and intelligent computing, robot technology
also gets more and more attention, in view of this, the robot path planning problem is also …

In the current research field of mobile robots, optimal path planning is a hot topic. Ant colony
algorithm is diffusely used in mobile robot path planning because of its its positive feedback …

Aiming at the problem that traditional ant colony algorithm has path redundancy in mobile
robots and is easy to fall into local optimal solutions, an improved ant colony algorithm is …

ACO (ant colony algorithm) is a kind of bionic optimization algorithm developed in recent
decades, which has shown its excellent performance and great development potential in …

To solve the problems that the basic ant colony algorithm (ACO) is easy to fall into the local
optimum, the path is too long and there are too many turns when searching the path of the …

Aiming at the problem of global path planning of robots under static and complicated
environment, firstly, the working environment of the robot is modeled by the grid method, and …

Aiming at the problem that the traditional ant colony algorithm (ACO) has poor solution
quality in the dynamic path planning process, this paper proposes an improved ACO. Firstly …

In this paper a global path planning method for mobile robots based on improved ant colony
algorithm was proposed. Which overcome the problem that the traditional ant colony …

Aiming at the problems of ant colony algorithm in robot global path planning, such as slow
convergence speed, large number of iterations, and long search time, an improved path …

In this paper, the path planning problem in known environments was studied. According to
Dijkstra algorithm and ant colony optimization (ACO), we designed a hybrid algorithm to …