Multiple Waypoint Path Planning for a Mobile Robot using Genetic Algorithms

This investigation developed a MATLAB program, based on genetic algorithms that generated an optimal (shortest distance) path plan for a mobile robot to visit all of the specified waypoints without colliding with the known obstacles. The designed genetic algorithm path planner was shown to accomplish this task and produce superior results when compared against a full search path planner. Next, it was shown that the choice of search parameters for the genetic algorithm effected the time to execute the search and the quality of the solution (length of the chosen path). Having proven the genetic algorithm path planner in simulation, the genetic algorithm path planner then successfully guided an actual X80 mobile robot to all its waypoints without colliding with any obstacles in a test environment