基于A~*算法的迷宫搜索向心法法则

Maze searching centripetal rule which based on A~* algorithm

针对IEEE标准的电脑鼠走迷宫中向心搜索算法在某些情况下搜索效率不高的问题,采用了一种基于A~*算法的改进型向心法法则对传统向心法进行了改进。通过两种算法的对比试验验证,改进型算法转弯46次共74步,传统算法转弯65次共174步,得出改进型向心法较传统向心发搜索效率大为提高的结论。

Aiming at the problem that the centripetal search rule forcomputer mouse maze walking which based on the IEEE standard is notefficient in some cases,an improved centripetal law based on the A^* algorithm is used to improve the traditional centripetal method.Through the comparison experiments of the two algorithms,the improvedalgorithm turns 46 times for a total of 74 steps,and the traditionalalgorithm turns 65 times for a total of 174 steps. It is concludedthat the improved centripetal method is much more efficient than thetraditional centripetal search.