A Bidirectional Interpolation Method for Post-Processing in Sampling-Based Robot Path Planning

Path Planning for Multiple Unmanned Vehicles (MUVs) Formation Shape Generation Based on Dual RRT Optimization

In this paper, dual RRT optimization is proposed to solve the formation shape generation problem for a large number of MUVs. Since large numbers of MUVs are prone to collision during formation shape generation, this paper considers the use of path planning algorithms to solve the collision avoidance problem. Additionally, RRT as a commonly used path planning algorithm has non-optimal solutions and strong randomness. Therefore, this paper proposes a dual RRT optimization to improve the drawbacks of RRT, which is applicable to the formation shape generation of MUVs. First, an initial global path can be obtained quickly by taking advantage of RRT-connect. After that, RRT* is used to optimize the initial global path locally. After finding the section that needs to be optimized, RRT* performs a new path search on the section and replaces the original path. Due to its asymptotic optimality, the path obtained by RRT* is shorter and smoother than the initial path. Finally, the algorithm can further optimize the path results by introducing a path evaluation function to determine the results of multiple runs. The experimental results show that the dual RRT operation optimization can greatly reduce the running time while avoiding obstacles and obtaining better path results than the RRT* algorithm. Moreover, multiple runs still ensure stable path results. The formation shape generation of MUVs can be completed in the shortest time using dual RRT optimization.

A Novel Collision-Free Homotopy Path Planning for Planar Robotic Arms

Achieving the smart motion of any autonomous or semi-autonomous robot requires an efficient algorithm to determine a feasible collision-free path. In this paper, a novel collision-free path homotopy-based path-planning algorithm applied to planar robotic arms is presented. The algorithm utilizes homotopy continuation methods (HCMs) to solve the non-linear algebraic equations system (NAES) that models the robot’s workspace. The method was validated with three case studies with robotic arms in different configurations. For the first case, a robot arm with three links must enter a narrow corridor with two obstacles. For the second case, a six-link robot arm with a gripper is required to take an object inside a narrow corridor with two obstacles. For the third case, a twenty-link arm must take an object inside a maze-like environment. These case studies validated, by simulation, the versatility and capacity of the proposed path-planning algorithm. The results show that the CPU time is dozens of milliseconds with a memory consumption less than 4.5 kB for the first two cases. For the third case, the CPU time is around 2.7 s and the memory consumption around 18 kB. Finally, the method’s performance was further validated using the industrial robot arm CRS CataLyst-5 by Thermo Electron.