中文摘要：

目前国际电脑鼠走迷宫竞赛中常采用的FLOODFill迷宫搜索算法存在硬件系统资源消耗较多和无法实现最短路径求解及判定等问题。根据FLOODFill算法和FLOODFill迷宫搜索算法的工作原理，提出修正的FLOODFill迷宫搜索算法及相应的最短路径求解算法。通过判断更新必要迷宫格编码值提高迷宫搜索算法的执行效率，建立“有墙迷宫”和“无墙迷宫”完成迷宫搜索后最短路径的最优性判定和迷宫搜索次数的决策。MATLAB平台的仿真分析和IEEE标准迷官的实际测试结果表明，相对于FLOODFill迷宫搜索算法，该方法不仅减少了97％的冗余编码值更新，而且能够准确地求解出搜索后的迷宫最短路径。

英文摘要：

As being commonly used in international Micromouse competitions, the FLOOD Fill maze search algorithm has the problems of more consumption in hardware system resource and unable to achieve the solution and discriminant of shortest path. According to the working principle of FLOOD Fill algorithm and FLOOD Fill maze search algorithm, the paper proposed a modified FLOOD Fill maze search algorithm and the corresponding shortest path solving algorithm. It improves the execution efficiency of maze search algorithm by estimating and updating the necessary coding values of maze grid. The optimality discriminant of the shortest path and the decision of maze search numbers after searching the maze were accomplished by establishing ＂maze with walls＂ and ＂ maze without walls＂. Simulation analysis on MATLAB platform and actual test results of IEEE standard maze show that the method reduces 97% update of redundant coding values and can solve accurately the shortest path of maze after search compared with the FLOOD Fill maze search algorithm.