A simple and efficient diagonal maze-solver for micromouse contests and intelligent mobile robot education

Abstract

A simple and efficient time-based diagonal maze solver for classic and half-size micromouse contesets is presented in this paper. The algorithm is first developed in the graphical user interface development environment (GUIDE) of MATLAB, and then used as a training and tutorial tool for students who are involved in contests oriented projects about intelligent mobile robots. It is also found that the firmware implementation of the algorithm in a dsPIC 16-bit microcontroller consumes just 4.2ms to finish searching for the best route from the start cell to the goal area in a 16×16 maze of classic micromouse contests.