Dynamic step length-based target gravity bidirectional RRT path planning method

Abstract

The invention relates to a dynamic step length-based target gravity bidirectional RRT path planning method, and belongs to the field of intelligent robot path planning. A dynamic step length concept is introduced based on a bidirectional RRT algorithm of target gravity idea, and the new node Xnew of an RRT random tree is extended by utilizing the dynamic change of the step length, which can not only utilize the randomness of the bidirectional RRT algorithm, but also utilize the characteristic that the new node Xnew is extended toward the target point Xgoal direction by utilizing the target gravity idea, and simultaneously solves the problem of target unreachability in the multi-obstacle environment, and can effectively improve the path search success rate and enhance the obstacle avoidanceability.

Description

technical field [0001] The invention relates to a dynamic step-based bidirectional RRT path planning method for target gravity, belonging to the field of path planning for intelligent robots. Background technique [0002] Intelligent robots will inevitably encounter various obstacles during their movement, and avoiding these obstacles flexibly and in real time is a key indicator to measure their performance. Intelligent robots with obstacle avoidance functions have high social value and are widely used in aerospace, military, manufacturing, medical and other fields. Path planning technology is one of the core issues in the field of intelligent robots, and has received extensive attention from the outside world in recent years. [0003] The working environment of intelligent robots is becoming more and more complex. Basically, there are a large number of irregular obstacles and uneven distribution of obstacles in the complex environment, including fixed obstacles and moving ...

AI Technical Summary

Problems solved by technology

[0004] Although the two-way RRT algorithm can solve problems such as environmental constraints, time constraints, the dynamic constraints of the robot itself, and high-dimensional space path planning, because this method requires random sampling of the global space, it results in poor real-time performance and low efficiency; based on the idea of ​​target gravity The two-way RRT algorithm can reduce the randomness of path search, but in the environment with many obstacles, there is a problem that the target cannot be reached, the efficiency is low, and the planned path cannot reach the optimal or suboptimal solution.

Images