By Topic

Multiple Waypoint Path Planning for a Mobile Robot using Genetic Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Davies, T. ; Dept. of Mech. Eng., R. Mil. Coll. of Canada, Kingston, Ont. ; Jnifene, A.

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

Published in:

Computational Intelligence for Measurement Systems and Applications, Proceedings of 2006 IEEE International Conference on

Date of Conference:

12-14 July 2006