Path planning is one of the challenging topics of robotics. Meta-heuristics designates a
computational method that optimizes a problem by iteratively trying to improve a candidate …

Recent advances in mobile robot path planning are turns into a prevalence research field.
This paper proffers a metaheuristic approach to optimize the mobile robot path length by …

The involvement of Meta-heuristic algorithms in robot motion planning has attracted the
attention of researchers in the robotics community due to the simplicity of the approaches …

From the time being, there are even instances for application of mobile robots in our life like
in home, schools, hospitals, etc. The goal of this paper is to plan a path and minimizing the …

The primary goal of a mobile robot is to reach the desired goal by traversing an optimized
path defined according to some criteria such as time, distance, and safety of the robot from …

This paper presents a metaheuristic optimization algorithm for mobile robot path planning
problem. A comparative study between particle swarm and ant colony optimization algorithm …

Aiming at disadvantages of particle swarm optimization in the path planning of mobile
robots, such as low convergence accuracy and easy maturity, this paper proposes an …

Path planning is an important component for a mobile robot to be able to do its job in
different types of environments. Furthermore, determining the safest and shortest path from …