Kasiman, Abd Rahim (2015) Optimization algorithm of autonomous maze solving robot. Masters thesis, Universiti Tun Hussein Onn Malaysia.

PDF
ABD_RAHIM_BIN_KASIMAN.pdf Download (1MB) 
Abstract
Maze solving has gained increasing attention in the field of Micromouse competition and Intelligent Robot. The first maze solving using mathematical approach is done by Leonhard Euler in 1736 after solving a problem known as the Seven Bridges of Königsberg. Since then, several algorithms which originate from graph theory and nongraph theory were developed. The main objective of this project is to study the efficiency of the famous graph theory based algorithm which is Dijkstra’s Algorithm in term of the shortest distance covered and time taken to solve the maze. A benchmark will be compared to a nongraph theory which is the famous Left Hand Rule Algorithm. To compare the algorithms efficiency, each algorithm are experimented by using a Zumo Pololu mobile robot. The experimental result obtained will lead towards a conclusion about the behavior, nature and efficiency of each algorithm.
Item Type:  Thesis (Masters) 

Subjects:  Q Science > QA Mathematics > QA76 Computer software 
Depositing User:  Normajihan Abd. Rahman 
Date Deposited:  27 Jan 2016 08:14 
Last Modified:  27 Jan 2016 08:14 
URI:  http://eprints.uthm.edu.my/id/eprint/7508 
Statistic Details:  View Download Statistic 
Actions (login required)
View Item 