An Oblique Sprint Algorithm with Eight Directions for Micromouse Contests
Chenhu Yuan, Qi Liu, Xiaoming Liu · 2018
According to IEEE micromouse standards, micromouse needs to find the shortest path in the maze that has been searched, and sprint with the fastest velocity, the shortest path and the least number of turns. To ensure the shortest path of micromouse in the maze that has been explored, it is necessary to plan the existing paths. Therefore, an Oblique sprint algorithm with eight directions is proposed in this article. The algorithm divides the maze cell into eight directions, records the running direction of the micromouse in the maze, finds out the shortest path through the contour map, makes the direction map on this path, and then integrates the direction map into the actual running action. Through this algorithm, the optimal design of sprint path and action mode is realized. By comparing with the traditional algorithm, it is demonstrated that the new algorithm solved the problems of the traditional sprint algorithm, such as long distance and many actions, reduced the number of turns, and improved the sprint efficiency of micromouse in the maze.