A Comparison between A ∗ RRT in Maze Solving Problem

He，Yuxuan1; Wang，Pingping2; Zhang，Jing3

10.1109/ISRIMT53730.2021.9596830

2021

978-1-6654-3719-6

2021 3rd International Symposium on Robotics and Intelligent Manufacturing Technology, ISRIMT 2021

333-338

24-26 Sept. 2021

Changzhou, China

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.

A maze path planning RRT

通讯

英语

EI

20220511541302

MATLAB ; Unmanned vehicles

Computer Applications:723.5 ; Mathematics:921

2-s2.0-85123444238

Scopus

1.Wuhan University of Technology,Department of Automation,Wuhan,China
2.University of Leeds,School of Electronic and Electrical Engineering,Leeds,United Kingdom
3.Southern University of Science and Technology,Department of Electrical and Electronic Engineering,Shenzhen,China

He，Yuxuan,Wang，Pingping,Zhang，Jing. A Comparison between A ∗ RRT in Maze Solving Problem[C],2021:333-338.