A Comparison Between A * & RRT in Maze Solving Problem

The performance analysis of different algorithms in a specific environment is an important topic of path planning research. This study focuses on the performance analysis and pros and cons of the A * algorithm and RRT algorithm in two-dimensional maze solving problems. Matlab software was used to simulate the experiment, and the maze complexity was defined as the number of branches and wall thickness. Then, the two groups of experimental complexity were divided from simple to complex. Finally, the time and presentation path of the two algorithms in each group of experiments were observed by transverse and longitudinal comparison. In two-dimensional maze path planning, A * is suitable for going through a maze efficiently, while RRT is suitable for exploring a maze evenly. These findings are significant for emergency search and rescue and exploration of unknown areas by unmanned vehicles.