Path Planning of Quadrupedal Robot Based on Improved RRT-Connect Algorithm

Path Planning of Quadrupedal Robot Based on Improved RRT-Connect Algorithm

Blog Article

In view of the large randomness, redundant path nodes, and low search efficiency of RRT-connect in a complex obstacle environment, this study intends to develop a path-planning method combining RRT-connect and Informed RRT*.First, to solve the problem of large sampling randomness, the Informed RRT* algorithm is combined to adopt a simpler rectangle and limit the sampling range to the rectangle.Second, for the poor quality of the search path, the dynamic step size is used for growth iphone 13 price ohio extension, the reverse greedy algorithm is used to delete redundant nodes, the spline curve is used to smooth the path such that the position meets the cubic spline curve and the speed meets the quadratic spline curve, and the final path is optimized.

Finally, the proposed algorithm is verified in the simulation and real world using a self-developed quadrupedal robot.Compared with the original RRT-connect algorithm, the first solution time, total number of nodes, and initial path cost were reduced by more el reformador tequila anejo than 11%, 8.5%, and 2.

5%, respectively.