Research progress on algorithms for micromouse maze navigation

Micromouse maze walking is a product of artificial intelligence and an important branch of path planning research. It has high practical value in fields such as exploring unknown areas. Micromouse can use different algorithms to plan different search paths, resulting in different times spent solving mazes. The shorter the time spent solving mazes, the higher the search efficiency. However, the existing maze solving algorithms all have their shortcomings. A single algorithm can no longer meet the needs of efficient maze solving, and finding more efficient maze solving algorithms remains a difficult and hot topic in research. This article focuses on the research of maze search algorithm, reviews the research progress of micromouse maze search from unknown areas, known area path planning, and fork selection, and emphasizes the principles and methods of improving the efficiency of micromouse maze search, reducing CPU computing and storage burden, and planning the optimal path reasonably, it also looks forward to future research directions.