Exploring the Comparison between Dijkstra's Algorithm and Rapidly-exploring Random Trees Algorithm for Robot Path Planning

Since the inception and evolution of artificial intelligence, control systems, particularly automated pathfinding, have constituted a pivotal area of significance. It is reflected in today's world of life in all aspects of autonomous driving, rescue robots and so on. Algorithms as the basis for the realization of this field exist in thousands of situations, which are reflected in different logic, different computational efficiency, different time and space complexity, etc. We will introduce the development history and basic principles of Dijkstras algorithm and Rapidly-exploring Random Trees algorithm, and analyze the advantages and disadvantages of each of these two algorithms to determine the domains in which they are applicable. In this paper, we will use MATLAB to set up a test environment and will investigate the effect of different environments comparing Dijkstras algorithm and RRT algorithm on the automatic control system in artificial intelligence. In addition, some experimental data and icons will be cited to support the experimental results by comparing the algorithms in terms of distance and efficiency. It is concluded that Dijkstras algorithm will be more suitable for static and low dimensional environments, while Rapidly-exploring Random Trees algorithm will be suitable for more complex and high dimensional environments.