Yizhen Sun, Junyou Yang, Donghui Zhao, Yu Shu, Zihan Zhang, Shuoyu Wang

A Global Trajectory Planning Framework Based on Minimizing the Risk Index

  • Control and Optimization
  • Control and Systems Engineering

At present, autonomous mobile robots are widely used in industrial and commercial fields. However, although the global path searched by existing mobile robot path planning methods has no collision with obstacles, there is a problem in that the path is close to obstacles and is not smooth, and there is a collision safety risk when the robot is actually moving. To solve the above problems, this paper proposes a global path planning method based on minimizing the risk index. Firstly, the distance calculation method of the heuristic function of the traditional graph search algorithm is improved to reduce the number of nodes in the search space. Additionally, by selecting the appropriate search neighborhood, the search efficiency and path smoothness of the algorithm are improved. Thirdly, to increase the distance between the original search path and obstacles, the risk index path search strategy is proposed. Finally, the minimized snap trajectory smoothing method with a safe corridor is used to smooth the original waypoint. Both simulation and real robot experimental results show that the minimum distance between waypoints and obstacles is increased by 43.72% on average, and the number of trajectory inflection points are reduced by 75.12% on average after optimization. As such, the proposed method can fully guarantee safety and generate smooth mobile robot paths in global trajectory planning tasks.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive