Novel Kinematic Batch Informed Trees Algorithm for Efficient Mobile Robot Path Planning

Strategic Insights -

Researchers at Zhejiang Science Technical University have proposed a novel Kinematic Batch Informed Trees algorithm (K-BIT*) for efficient mobile robot path planning. The algorithm addresses the limitations of existing methods, which often experience low efficiency, poor geometric smoothness, and local optima. By utilizing a variable density sampling strategy, K-BIT* can automatically adjust the searching radius to speed up the search efficiency of feasible paths. The algorithm also incorporates a better escape approach when detecting entrapment, enhancing the robot's searching capability.

Key Takeaways:

  • The novel Kinematic Batch Informed Trees algorithm (K-BIT*) is designed to address the limitations of existing path planning methods for mobile robots.
  • K-BIT* employs a variable density sampling strategy to automatically adjust the searching radius based on the complexity of the environment, thereby improving search efficiency.
  • The algorithm incorporates a better escape approach that generates specific way points based on current obstacles information, enhancing the robot's searching capability.
  • Simulation and experiment results demonstrate that K-BIT* provides superior optimization efficiency (minimum improvement of 23.94%) and higher success rates (nearly 100%) compared to existing algorithms (BIT*, RRT*, and kinematic RRT*).
  • The algorithm ensures generated paths adhere to the robot's physical and dynamic characteristics while maintaining smoothness and stability of motion.
  • The research has been peer-reviewed and published in the Ieee Robotics and Automation Letters journal.
  • Funders for this research include the National Natural Science Foundation of China (NSFC), Key R&D Program of Zhejiang Province, National College Students' Innovation and Entrepreneurship Training Program, and Students in Zhejiang Province Science and Technology Innovation Plan (Xinmiao Talents Program).
  • Authors of the research include Wei Wang, Haoyu Wang, Yiwei Shen, Kun Li, Qiankun Zhang, and Tao Zheng from Zhejiang Science Technical University and other collaborating institutions.

Statistics:

  • Minimum improvement in optimization efficiency achieved by K-BIT*: 23.94%
  • Success rates achieved by K-BIT* in complex environments: nearly 100%
  • Number of authors contributing to the research: 6
  • Number of funding agencies supporting the research: 4
  • Frequency of peer-review: at least once
  • Publication outlet: Ieee Robotics and Automation Letters

Sources:

  • A Kinematic Constrained Batch Informed Trees Algorithm With Varied Density Sampling for Mobile Robot Path Planning (Ieee Robotics and Automation Letters, 2025;10(7):6912-6919)
  • NewsRx. Data on Robotics Described by Researchers at Zhejiang Science Technical University (A Kinematic Constrained Batch Informed Trees Algorithm With Varied Density Sampling for Mobile Robot Path Planning). Robotics & Machine Learning. July 7, 2025; p 72.