Abstract
Mobile robot path planning is an important task that involves finding an optimal path from an initial location to a goal. This paper presents a novel approach to this problem utilizing a genetic algorithm. The proposed approach formulates the problem as an optimization problem, where the objective is to minimize the total cost of a given path. The genetic algorithm is then used to search for an optimal solution, which is found by evolving a population of paths over multiple generations. The proposed approach is tested and evaluated using a simulated robotic environment, and the results demonstrate its efficacy in finding optimal paths. KEYWORD: Mobile Robots, Path Planning, Genetic Algorithm, Optimization, Simulation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
