Locally Guided Multiple BiRRTxe2x88x97 for Fast Path Planning in Narrow Passages Rapidlyexploring Random Tree Star (RRTxe2x88x97) and its variants can provide a collisionfree and asymptotic optimal solution for many path planning problems. However, it is inefficient for many RRTxe2x88x97 based variants to rapidly find one initial solution in a clustered environment with narrow passages, since consuming high memory as well as time, due to a large number of iterations in sampling critical nodes. To overcome this problem, the paper proposes the Locally Guided Multiple BiRRTxe2x88x97 (LGMBRRTxe2x88x97) method, which can provide a fast solution by incorporating an improved bridgetest and a novel search strategy based on local guidance. It ensures an accelerated success rate and more efficient memory utilization compared with Bidirectional RRTxe2x88x97(BRRTxe2x88x97), and it is easy for implementation as well. It was verified on different types of scenarios in terms of efficiency and success rate. The results demonstrated that LGMBRRTxe2x88x97 is beneficial for fast path planning in a clustered environment with narrow passages.

Rapidlyexploring Random Trees Based on Cylindrical Sampling Space In this paper, the defect of traditional fastexpanding random tree (RRT) is optimized for the path planning in threedimensional environment. Due to the randomness generated by its own nodes, the traditional RRT algorithm has the defects of the planned path twist and easy to cross the target point, and greatly differs from the ideal path, so that the time required for the robot to implement path tracking is greatly increased. In this paper, an RRT algorithm based on cylindrical sampling space is proposed. The algorithm uses the line connecting the starting point and the ending point of the path as the central axis. The maximum distance from all nodes on the path to the cylinder axis is taken as the radius value of the first cylinder. The cylinder space is used as the new node sampling space in the next path planning. Then, a new cylinder is generated by reducing the radius of the previous cylinder as the current sample sampling space. Repeat the above steps until find the last optimized path. The path generated by the traditional RRT algorithm and the path generated by the RRT optimization algorithm based on cylindrical sampling space are compared and analyzed under the given obstacle and obstaclefree environment. The simulation results show that the path generated by the RRT optimization algorithm based on the cylindrical sampling space is smoother and shorter, almost no redundant path. The path meets the actual motion requirements of the robot.