19 February 2024 in IEEE Access
To address the shortcomings of the classical RRT (Rapidly-exploring Range Tree) path planning algorithm, such as long planning time and path curvature in some narrow and complex environments, an improved APG-RRT (Adaptive Path-Guide-RRT) algorithm is proposed. First, a guiding path is introduced in the sampling stage, and a node on the preset guiding path is selected first to expand the node tree so as to guide the algorithm to plan the exploration process. Secondly, the selection weight of the loading guidance path is dynamically adjusted according to the probability of collision between obstacles during the exploration process, and a safe and feasible path point is generated in the path expansion stage by combining the expansion information of the obstacles. Finally, in the path post-processing stage, combined with the vehicle kinematic constraints, the triangular inequality method is used to remove redundant path points, making the path more smooth, so as to fulfill the specific operational needs of the vehicle. The results of the simulation experiment demonstrate that the suggested method exhibits superior planning efficiency compared to the previous algorithm, resulting in a higher quality final path. At the same time, the verification of the algorithm’s feasibility and effectiveness is conducted through real car testing.
5 December 2023 in IEEE Access
Motion planning between dynamic obstacles is an essential capability to achieve real-world navigation. In this study, we investigated the problem of avoiding dynamic obstacles in complex environments for a car-like mobile robot with an incompletely constrained Ackerman front wheel steering. To address the problems of weak dynamic obstacle avoidance and poor path smoothing in motion planning with the traditional Timed Elastic Band (TEB) algorithm, We proposed a hybrid motion planning algorithm (TEB-CA,Timed Elastic Band-Collision Avoidance) that combines an improved traditional TEB algorithm and Optimal Reciprocal Collision Avoidance (ORCA) model to improve the ability of the robot to predict dynamic obstacles in advance and avoid collisions safely. Moreover, We also add new constraints to the traditional TEB algorithm, including: jerk constraints, smoothness constraints, and curvature constraints. The algorithm is implemented in C++ and evaluated experimentally in the Gazebo and Rviz simulation environments of the Robot Operating System (ROS) , as well as in actual experimental tests on our car-like autonomous mobile robot " Little Ant " which proves the effectiveness of the method, and that the motion planning scheme is more effective in avoiding dynamic obstacles than the traditional TEB and DWA algorithms.