Repository logo
 

Mobile Robot Path Planning Using Genetic Algorithm Global Path PLANNING and Potential Field Path Adjusting

dc.contributor.authorEliwa, AbdelRahman
dc.contributor.copyright-releaseNot Applicableen_US
dc.contributor.degreeMaster of Applied Scienceen_US
dc.contributor.departmentDepartment of Electrical & Computer Engineeringen_US
dc.contributor.ethics-approvalNot Applicableen_US
dc.contributor.external-examinerDr. William Phillipsen_US
dc.contributor.graduate-coordinatorDr. Jason Guen_US
dc.contributor.manuscriptsNot Applicableen_US
dc.contributor.thesis-readerDr. Kamal El-Sankaryen_US
dc.contributor.thesis-supervisorDr. Jason Guen_US
dc.date.accessioned2017-05-08T18:23:30Z
dc.date.available2017-05-08T18:23:30Z
dc.date.defence2017-04-12
dc.date.issued2017-05-08T18:23:30Z
dc.description.abstractThe purpose of this thesis was to develop an algorithm which solves the path planning problem for a two-wheeled mobile robot. The algorithm included multiple robots within it. The algorithm was developed by first identifying the problem at hand, expanding on it and then designing features which solved each part of the problem. The motivation behind this study is that the path planning algorithm could be applied to real world applications once perfected to a certain degree. The algorithm was composed of two main sub-algorithms: an off-line component and an on-line one. The off-line component was a global path planner which used a genetic algorithm to find the optimal path between the source point and the goal point while only accounting for static obstacles. The second component was a local path planner utilizing artificial potential fields in order to adjust the path at hand to account for any dynamic objects. Multiple configurations were tested and evaluated. The algorithm was compared to an Ant Colony Optimization algorithm and it proved to be more efficient with respect to the maps used in the study. The algorithm was evaluated for advantages and limitations and future study aspects were identified. Future works included: expanding the algorithm to allow for more robots, implementing the algorithm to a real life application and recreating miscellaneous situations to test the flexibility of the algorithm.en_US
dc.identifier.urihttp://hdl.handle.net/10222/72891
dc.language.isoen_USen_US
dc.subjectMobile Roboticsen_US
dc.subjectGenetic Algorithmsen_US
dc.subjectMobile robots
dc.titleMobile Robot Path Planning Using Genetic Algorithm Global Path PLANNING and Potential Field Path Adjustingen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Eliwa-AbdelRahman-MASc-ENG-April-2017.pdf
Size:
6.12 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: