Research And Implementation Of Algorithm For Micro-Mouse Based On Ring-Gird Model

With the deepening of research in the field of artificial intelligence and the continuous development of robotics,the research work of intelligent robots has been increasingly sought after by people.The Micro-Mouse has undergone a long period of development.Nowadays,the Micro-Mouse has developed into a kind of micro-intelligent moving robot controlled by the MCU and integrating sensor technology and motion control,which can complete the independent path finding and sprint in the maze.With regard to the research work of computer mice,the characteristics of cross-integration of multidisciplinary knowledge are also of great significance for the development,innovation and integration of these disciplines.This topic is based on the Micro-Mouse competition established by IEEE.In-depth study of how the Micro-Mouse can use the detected information more effectively in the process of searching the maze,quickly and efficiently reach the end of the maze;how to use numerous robot paths the planning method finds the shortest path between the start and end points of the maze;how to eliminate the redundant path according to the exploration of the maze information,saving the exploration time.This article combines the rules of the IEEE Micro-Mouse competition,ingenuity,circular modeling of the rectangular maze,the process of exploring the end point of the Micro-Mouse in the maze,as the process of going deep into the center of the circle.In this paper,the maze search stage and the maze return stage of the Micro-Mouse are studied in detail.In the maze search stage,this paper proposes the priority ring algorithm with reference to the idea of probability distance,which changes the search algorithm commonly used in the current game.In the labyrinth return phase,this paper proposes an intersection value evaluation algorithm,introduces abandonment mechanism,eliminates some intersections that do not have the value of re-exploration when returning,effectively helping computer mice find shorter and faster.The return path.Finally,this paper uses five labyrinth examples to test the new algorithm and improved method,analyzes the test results in detail,and demonstrates the superiority of the priority loop algorithm and the intersection value algorithm in the maze search and maze return stages respectively.In summary,this paper proposes a priority ring search algorithm and intersection value return algorithm for IEEE standard Micro-Mouse labyrinth,which verifies its feasibility and demonstrates its efficiency in application.