Path planning problem, is a challenging topic in robotics. Indeed, a significant amount of
research has been devoted to this problem in recent years. The ant colony optimization …

(PM-ACO for short) is proposed to solve the robot path planning problem. In PM-ACO, ants
deposit pheromone on the nodes but not on the arcs, resulting in that the trails of pheromone …

To solve the problems of convergence speed in the ant colony algorithm, an improved ant
colony optimization algorithm is proposed for path planning of mobile robots in the …

Although traditional ant colony system (ACS) has the ability of fast convergence, it tends to
find local optima. To solve this problem, this paper proposes an improved ant colony system …

In this paper, an improved Ant Colony Optimization (ACO) algorithm is proposed to solve
path planning problems. These problems are to find a collision-free and optimal path from a …

Ant colony optimization and artificial potential field were used respectively as global path
planning and local path planning methods in this paper. Some modifications were made to …

The obstacle avoidance in path planning, a hot topic in mobile robot control, has been
extensively investigated. The existing ant colony algorithms, however, remain as drawbacks …

This paper presents the results of a research that aims to develop an algorithm to solve robot
path planning (RPP) problems in static environments. The problem is to find a global optimal …

Path planning problem, including maze navigation is a challenging topic in robotics. Indeed,
a significant amount of research has been devoted to this problem in recent years. Genetic …

Abstract Currently Mobile Robot has been widely used in examination and navigation
particularly where static and unknown surroundings are involved. Path planning is a crucial …