高级检索

基于改进JPS与三次B样条插值的路径规划算法

Path Planning Algorithm Based on Improved JPS and Cubic B-spline Interpolation

  • 摘要: 针对跳点搜索(JPS)算法在路径规划中易穿越障碍、路径拐点尖锐的问题,提出一种基于改进的JPS与三次B样条插值的路径规划算法。在原JPS算法的基础上,通过对障碍物附近的路径拐点进行条件限制,降低穿越障碍物可能性;引入时间轴改进原三次B样条插值算法,进一步优化路径拐点,使路径更平滑;在对提出算法进行仿真验证的基础上,将其作为一个插件注册到ROS中对机器人进行路径规划。结果表明:改进的JPS算法在保留原搜索效率的基础上,可有效提高机器人规避障碍物的能力;时间轴的引入可改善路径尖锐性,优化的路径更符合机器人的实际运动规划;在真实场景的机器人路径规划中,机器人可成功地从指定的起点到达设定的目标点,搜索时间比A*算法减少约20%,有效提高了机器人路径规划的准确性和实时性。

     

    Abstract: Aiming at the problems of easy crossing obstacles and sharp path inflection points in path planning by jump point search (JPS) algorithm, a path planning algorithm based on improved JPS with cubic B-spline interpolation was proposed. Based on the original JPS algorithm, the path inflection points near obstacles were conditionally restricted to reduce the possibility of crossing obstacles. The original cubic B-spline interpolation algorithm was improved by introducing a time axis to further optimize the path inflection points and make the path smoother. Based on the simulation verification of the proposed algorithm, it was registered as a plug-in to the ROS for path planning of the robot. The results show that the improved JPS algorithm can effectively improve the robot’ s ability to avoid obstacles on the basis of retaining the original search efficiency. The introduction of the time axis can improve the path sharpness, and the optimized path is more consistent with the actual motion planning of the robot. In the robot path planning of real scenarios, the robot can successfully reach the set target point from the specified starting point, and its search time is reduced by about 20% compared with that of A* algorithm, which effectively improves the accuracy and real-time of robot path planning.

     

/

返回文章
返回