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 …

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 …

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 …

In this paper, the ant colony optimization (ACO) metaheuristic is proposed to solve the
mobile robot path planning (MRPP) problem. In order to demonstrate the effectiveness of …

Aiming at the problems of traditional ant colony optimization algorithm in path planning, such
as slow convergence, easy to fall into local optima, and too many inflection points, an …

Path planning is a fundamental optimization problem that is crucial for the navigation of a
mobile robot. Among the vast array of optimization approaches, we focus in this paper on …

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 …

Ant colony optimization (ACO) technique is proposed to solve the mobile robot path
planning (MRPP) problem. In order to demonstrate the effectiveness of ACO in solving the …

Mobile robots can be applied to a wide range of problems, and the demand for these
applications has risen in recent years, increasing interest in the study of mobile robotics …