Papers by Keyword: Flood-Fill

Abstract: Micromouse is a small autonomous electronic-mechanical robot, which is able to navigate through an unknown maze from the start to the destination. The main challenge for micromouse is to work out the maze after searching, find the optimum path for the shortest fast-run time and control the robot to win. Flood-fill algorithm is used in this project to develop a solver which is able to help the robot for finding the ‘best’ route from the starting position to the ‘goal’, maze solving result shows the correctness.

Abstract: Micromouse is a small autonomous robot, which must navigate itself through an unknown maze from the start to the destination. The main challenge for micromouse is to solve the maze information after searching and find the optimum path. In order to ensure the correctness of maze information, software for micromouse navigation in some special position was designed.

Abstract: The problem of micromouse is 30 years old but its importance in the field of robotics is unparalleled, as it requires a complete analysis & proper planning to solve the problem. This paper proposes two computationally efficient algorithms for maze solving. Most of the reported algorithms explore complete maze before finding the shortest path to the center of the maze, thereby taking large exploration time. Our proposed algorithms take less time in maze exploration by exploring the maze partially and by traversing less number of cells to reach the center of the maze. An optimal method for maze solving with partial exploration of the maze can hardly be found applicable to all type of mazes, but our algorithms are found to be efficient in most of the cases. Simulation of our proposed algorithms on the some standard mazes show that one of the two algorithms described in this paper gives the better solution by only partially exploring the maze and the other algorithm also gives the comparative results when compared with the algorithms reported in the literature.