As a sampling-based pathfinding algorithm, Rapidly Exploring Random Trees (RRT) has been widely used in motion planning problems due to the ability to find a feasible path quickly. However, the RRT algorithm still has several shortcomings, such as the large variance in the search time, poor performance in narrow channel scenarios, and being far from the optimal path. In this paper, we propose a new RRT-based path find algorithm, Fast-RRT, to find a near-optimal path quickly. The Fast-RRT algorithm consists of two modules, including Improved RRT and Fast-Optimal. The former is aims to quickly and stably find an initial path, and the latter is to merge multiple initial paths to obtain a near-optimal path. Compared with the RRT algorithm, Fast-RRT shows the following improvements: (1) A Fast-Sampling strategy that only samples in the unreached space of the random tree was introduced to improve the search speed and algorithm stability; (2) A Random Steering strategy expansion strategy was proposed to solve the problem of poor performance in narrow channel scenarios; (3) By fusion and adjustment of paths, a near-optimal path can be faster found by Fast-RRT, 20 times faster than the RRT* algorithm. Owing to these merits, our proposed Fast-RRT outperforms RRT and RRT* in both speed and stability during experiments.
In order to fly safely and autonomously in complex environments, UAVs need to be able to plan their trajectories in real-time. This paper proposes an improved B-spline-based trajectory generation method that can generate safe, smooth, and kinodynamically feasible trajectories in real-time. This paper firstly introduces the principle of error upper bound of the B-spline curve and proposes a new trajectory safety assurance method; then, the loss function of trajectory is constructed based on safety, smoothness, and flight time; finally, a parameter adaptive trajectory optimization method is proposed, so that obtain the safe trajectory. Compared with the existing methods, the proposed method has two important improvements: (1) it solves the problem of overly conservative safety distance estimation at control points, improves the trajectory smoothness, and reduces the required flight time; (2) it proposes a trajectory optimization method with adaptive adjustment of safety distance parameters, which improves the quality and success rate of the planned trajectory. We validate our proposed method in simulation and real-world tasks, and the test results show that the method proposed in this paper can significantly improve the quality of the generated trajectory.
In order to complete various tasks automatically, robots need to have onboard sensors to gain the ability to move autonomously in complex environments. Here, we propose a combined strategy to achieve the real-time, safe, and smooth autonomous motion of robots in complex environments. The strategy consists of the building of an occupancy grid map of the environment in real time via the binocular system, followed by planning a smooth and safe path based on our proposed new motion-planning algorithm. The binocular system, which is small in size and lightweight, can provide reliable robot position, attitude, and obstacle information, enabling the establishment of an occupancy grid map in real time. Our proposed new algorithm can generate a high-quality path by using the gradient information of the ESDF (Euclidean Signed Distance Functions) value to adjust the waypoints. Compared with the reported motion-planning algorithm, our proposed algorithm possesses two advantages: (i) ensuring the security of the entire path, rather than that of the waypoints; and (ii) presenting a fast calculation method for the ESDF value of the path points, one which avoids the time-consuming construction of the ESDF map of the environment. Experimental and simulation results demonstrate that the proposed method can realize the safe and smooth autonomous motion of the robot in a complex environment in real time. Therefore, our proposed approach shows great potential in the application of robotic autonomous motion tasks.