Path planning for mobile robots based on fast moving tree algorithm

With the development and progress of the times, people's expectations for robots to replace some or all of human labor are increasing, so the use of robots is becoming more and more common. Some of the work scenarios require robots to be able to move autonomously. During the movement, there may be issues such as slow response speed and suboptimal path planning. This article proposes a path planning method based on a fast-moving tree to address such issues. The method first constructs three types of environmental maps with identical obstacles but different starting points to simulate different work scenarios; Then, based on the Fast Moving Tree algorithm, three scene preferences were implemented using the FMT * algorithm to search for paths; The final simulation experiment shows that the fast moving tree algorithm performs well in key performance indicators such as search time, route length, and success rate, and the path has also been significantly improved, providing a solution for path planning of mobile robots in complex environments.