2025
A Kinematic Constrained Batch Informed Trees Algorithm With Varied Density Sampling for Mobile Robot Path Planning
RA-L 2025
we proposed a novel Kinematic Batch Informed Trees algorithm (K-BIT*) to solve problems of the low efficiency, poor geometric smoothness and local optimum when conducting path planning for mobile robots. A variable density sampling strategy is designed which can automatically adjust the searching ra