LINE MAZE SOLVER

dc.contributor.advisorAl Jabi, Muhannad
dc.contributor.authorBatta, Alaa
dc.contributor.authorZawyani, Loay
dc.date.accessioned2018-02-13T07:01:34Z
dc.date.available2018-02-13T07:01:34Z
dc.date.issued2017
dc.description.abstractOur project “Maze Solver " is a robot that is able to solve a maze by finding its end without knowing any previous information about it .There will be a black line that highlight all paths in the maze, so the robot will use this line to detect the available moves and decide which move is the best by using Left Hand Rule Algorithm. The robot has five infrared sensors that inform the robot about the possible paths according to the black line, then the robot will use LHRA and if it reach a dead end it will correct the path according to a fixed rules that handle wrong decisions so that at the end we will have the correct path. The importance of this project is about implementing problem solving algorithm in a robot and automate the Algorithm. This Robot Should be able to solve any Line Maze without knowing any previous information about it, it will find the path and save it, so that if we start it again the robot will follow the correct path immediately. Our methodology is: 1) Build the wagon with its wheels. 2) Add two motors to be able to control the wagon moving and turning. 3) Add five Infrared Sensors to the front of the wagon to detect the black line. 4) Implement the LHRA Algorithm for the wagon to be able to solve any line maze and store the correct path, so if we put the wagon at the start of the maze it will go to the end directly.en_US
dc.identifier.urihttps://hdl.handle.net/20.500.11888/13141
dc.language.isoenen_US
dc.titleLINE MAZE SOLVERen_US
dc.typeGraduation Projecten_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Presentation.pptx
Size:
1.12 MB
Format:
Microsoft Powerpoint XML
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: