In mobile robot path planning, the ant colony algorithm has the problem that the historical
paths explored by ants cannot be fully utilized. With this in mind, in this paper an enhanced …

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 …

This paper proposes an improved ant colony algorithm to achieve efficient searching
capabilities of path planning in complicated maps for mobile robot. The improved ant colony …

To realize a fast and efficient path planning for mobile robot in complex environment, an
enhanced heuristic ant colony optimization (EH-ACO) algorithm is proposed. Four strategies …

To solve the problems of local optimum, slow convergence speed and low search efficiency
in ant colony algorithm, an improved ant colony optimization algorithm is proposed. The …

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 …

Ant colony algorithm is an intelligent optimization algorithm that is widely used in path
planning for mobile robot due to its advantages, such as good feedback information, strong …

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 …

A novel method for the real-time globally optimal path planning of mobile robots is proposed
based on the ant colony system (ACS) algorithm. This method includes three steps: the first …

As the key point for auto-navigation of mobile robot, path planning is a research hotspot in
the field of robot. Generally, the ant colony optimization algorithm (ACO) is one of the …