Algorithms for Micro-mouse

Autor: Manoj Sharma
Rok vydání: 2009
Předmět:
Zdroj: 2009 International Conference on Future Computer and Communication.
DOI: 10.1109/icfcc.2009.38
Popis: Robotics is not a new word. It has attracted people from all phases of life. The failure of a project in any field mostly occurs due to incomplete analysis of problem or improper planning. Such disappointments can be avoided by adapting a proper approach towards solving a given task. 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 solve this problem. This paper covers one of the most important areas of robot, “Decision making Algorithm” or inlay-man’s language, “Intelligence”. The environment around the robot is not known, so it must have decision-making capabilities. 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.
Databáze: OpenAIRE