RRT algorithm based path planning method

Abstract

The invention discloses an RRT (Rapidly exploring Random Tree) algorithm based path planning method. On the basis of the classic algorithm, pruning operation is performed and tiny branches on a tree generated by RRT algorithm are cut off, so that the quantity of nodes travelled through by a finally generated path is reduced and the path bending frequency is reduced. Therefore, the path is more suitable for robot walking. The RRT algorithm is a path planning algorithm disclosed by LaValle in a paper for the first time in 1998 and is a classic algorithm frequently used in MDOF robot motion planning and plan path planning. However, length of paths generated by the RRT algorithm has comparatively large redundancy and the linearity of the paths is poor. Through the improvement implemented through pruning in the invention, path redundancy is reduced and the linearity is improved substantially.

Description

technical field [0001] The present invention relates to a path planning method in the field of intelligent robot motion planning, in particular to a path planning method based on pruning fast random search tree (RRT, Rapidly exploring Random Tree) algorithm which improves the classic RRT algorithm, mainly in During the tree generation process, the small branches and leaves are cut off, so that the length of the branches and leaves of the tree structure is at least above a given threshold distance, so that the number of turns of the final path is reduced and the straightness is improved. Background technique [0002] At present, the research on robot systems capable of autonomous navigation and obstacle avoidance is extremely hot, and many products have been applied in practice. For example, a service robot in a restaurant has the ability to identify obstacles and plan paths; another example is a home sweeping robot, which also has the ability to plan its own movement path in...

AI Technical Summary

Problems solved by technology

[0005] In the path planning problem, when evaluating the pros and cons of a path planning algorithm, consider the length of the path generated by the algorithm and the calculation time of the algorithm. Compared with other path planning methods, the calculation time of the RRT algorithm is relatively short and the performance is excellent. , but the path redundancy generated by it is relatively large, and there are many retracement sections, resulting in a greatly increased path length, and the path generated by it has many nodes, resulting in many turns, when the robot actually applies this path, it needs make very many orientation changes

For a robot, the cost of walking in a straight line is much lower than the cost of turning, so the path generated by RRT is difficult to be directly applied to the robot platform

Images