DocumentCode
2025452
Title
Maze Solving Algorithms for Micro Mouse
Author
Mishra, Swati ; Bande, Pankaj
Author_Institution
Inderprastha Eng. Coll., Ghaziabad
fYear
2008
fDate
Nov. 30 2008-Dec. 3 2008
Firstpage
86
Lastpage
93
Abstract
The problem of micro-mouse is 30 years old but its importance in the field of robotics is unparalleled, as it requires a complete analysis & proper planning to be solved. This paper covers one of the most important areas of robot, ldquodecision making algorithmrdquo or in lay-manpsilas language, ldquorobot intelligencerdquo. For starting in the field of micro-mouse it is very difficult to begin with highly sophisticated algorithms. This paper begins with very basic wall follower logic to solve the maze. And gradually improves the algorithm to accurately solve the maze in shortest time with some more intelligence. The Algorithm is developed up to some sophisticated level as flood-fill algorithm. The paper would help all the beginners in this fascinating field, as they proceed towards development of the ldquobrain of the systemrdquo, particularly for robots concerned with path planning and navigation.
Keywords
decision making; mobile robots; navigation; path planning; Djikstra algorithm; decision making; flood-fill algorithm; maze solving; micro-mouse; path planning; robot intelligence; robot navigation; wall follower logic; Algorithm design and analysis; Educational robots; Intelligent robots; Logic; Mice; Navigation; Path planning; Robot kinematics; Robotics and automation; Software algorithms; Algorithms; Djikstra; Flood fill; Micromouse; Mobile Robot Navigation;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Image Technology and Internet Based Systems, 2008. SITIS '08. IEEE International Conference on
Conference_Location
Bali
Print_ISBN
978-0-7695-3493-0
Type
conf
DOI
10.1109/SITIS.2008.104
Filename
4725791
Link To Document