Paper Title
Performance Comparison Of Genetic Algorithm And A* In Path Planning For Mobile Robots

This paper explains a path planning of mobile robots based on Genetic Algorithm (GA) and a performance comparison with A* algorithm. The path planning is an important issue in mobile robots. The path planning of mobile robots can be defined as finding a suitable and feasible path given a starting location, a target location, and a set of obstacles in an environment. In this paper, path planning under different environments are carried out, and the comparative studies with GA and A* algorithm are presented. Experimental comparisons are examined in terms of both the solution time and path distance. The results show the effectiveness of the GA, including a comparison with the A* algorithm. Index Terms- A* Algorithm, Genetic Algorithm, Mobile Robots, Path Planning