Difference between revisions of "Maze"
(→Overview) |
(→Overview) |
||
| Line 3: | Line 3: | ||
'''Authors: ''' Daniel Slenders, Ivan Gavran <BR> | '''Authors: ''' Daniel Slenders, Ivan Gavran <BR> | ||
| − | ''' | + | '''Countries: ''' Belgium, Croatia <BR> |
'''Date: ''' 09.07.2010 <BR> | '''Date: ''' 09.07.2010 <BR> | ||
'''Activity: ''' R.U.R. - Summer School 2010 <BR> | '''Activity: ''' R.U.R. - Summer School 2010 <BR> | ||
Revision as of 12:30, 9 July 2010
Contents
Project: Maze
Overview
Authors: Daniel Slenders, Ivan Gavran
Countries: Belgium, Croatia
Date: 09.07.2010
Activity: R.U.R. - Summer School 2010
Abstract
This robot is capable of following a line and finding its way out of a maze. Our robot consists of two sensors. One to detect a line and one to detect crossroads.
Hardware Design: Our robot is a very simple Lego robot with two lightsensors and two servomotors (for the wheels).
Software Design: We wrote the program in Java. The program consists of three methods.
The first method is the callibration. This one determines which value corresponds to white and which one to black.
The second method is the linefollower. It uses one sensor to detect the line and steers the robot so that it keeps bumping into the line.
The third method is the mazefollower. By turning right at every crossroads it will find the exit. The method detects if there is just a line (then it uses the second method), if there is a crossroad (then it turns right) or if there is a dead end (then it turns 180 degrees.
Improvements
First improvement of this maze-solving robot is finding path with no dead-ends. Robot would once find the way out remembering crossroads (complete algorithm is described in and every other time it would pass the maze ignoring dead-ends[detailed view]) . Further improvememnts are to be made in robot's speed and elegance of movements.
Conclusion:
Project Files
| Description | Download |
| Project sourcecode | Media: SourceCode.txt |
Go back to the List of the projects
