Design and realization of a maze robot

Abstract

This article gives hardware design concept of a maze robot taking SCM as a core based on research on design of a maze robot' hardware and maze solving algorithm directing at the problem that there are less sensor-based maze algorithm and it is very difficult to find the shortest path. It proposes a deep first search (DFS) algorithm based on left -right hand wall follower rule and in detail analyzes the realizing processes of this algorithm and this algorithm is realized. Experiments show that this system can find a shorter path from the entrance and the exit of a maze which is not too complicated through two times of search and it features smaller spatial complexity.

Modelling and Characterization of a Maze-Solving Mobile Robot Using Wall Follower Algorithm

“…This algorithm is also based on the wall follower algorithm that is to be used in this project. The results of Jiang's paper show that "a shorter path can be found through two searches in a not too complicated maze in this algorithm and it features smaller spatial complexity" [8]. This proves that with modified version of the wall follower algorithm, finding the shorter path in a maze can surely be made by the mobile robot.…”

Maze solving algorithm for line following robot and derivation of linear path distance from nonlinear path

“…Now it will again take the northern direction and find new point ‗D' (14,13). Similarly, it will explore the ‗G' (14,16) point. Here it will search for the points having smaller Explored number than their Type number and come back to ‗D', as it is one of them and the closest one.…”