Comparative study of algorithms for search in mazes
Xiang Liu · Jisuanji yingyong yanjiu · 2011
This paper mainly concentrated on studying the application of robotic searching.In this case,the accident environment was Abstracted as a maze,and this paper compared the depth-first search algorithm and three A-star algorithms in application of Perfect maze by simulation experiment.Furthermore,it also implemented the depth-first search algorithm and the 3 heuristic functions of A-star algorithms in real maze application and compared the results.In the experiment,the environment of maze was unknown by the robot.Because an unknown maze had few collision-free path to a destination,it increased the difficulty to search the right path.By comparing the performances of different types of A-star algorithms and the depth-first search algorithm in simulation,experiments validate the usefulness of heuristic function with the results that the A-star algorithms outperform the depth-first search algorithm in most cases,meanwhile,has implemented the use of the depth-first search algorithm and A-star algorithmin real maze searching.