首页> 外文会议>Chinese Control and Decision Conference >An Improved Jump Point Search Algorithm for Home Service Robot Path Planning
【24h】

An Improved Jump Point Search Algorithm for Home Service Robot Path Planning

机译:用于家庭服务机器人路径规划的改进跳转点搜索算法

获取原文

摘要

When the jump point search algorithm is applied to robot path planning, there are problems such as many redundant path points, large cumulative turning angle and the robot incapable of adjusting its posture at the path point. This paper proposes an improved jump point search algorithm, which checks the connectivity between the previous point and the last point of each original point. It also uses vector cross product to identify the direction of the next path point relative to the current path point. The vector dot product is adopted to calculate the rotation angle of the current path point. Three evaluation indicators, such as the number of path points, the total path length and the cumulative turning angle, are formulated to judge the merits and demerits of the optimized algorithm. The experimental results show that on the map of scene 1, improved jump point search algorithm reduces the path points from 9 to 7, with total path length decreased by about 12%, and cumulative turning angle decreased by about 27%. The improved jump point search algorithm is designed to obtain a shorter final path, a smaller cumulative turning angle, and to able robot to adjust posture at the path point.
机译:将跳跃点搜索算法应用于机器人路径规划时,会出现许多冗余路径点,较大的累积转向角以及机器人无法调整其在路径点处的姿势等问题。本文提出了一种改进的跳点搜索算法,该算法可以检查每个原始点的上一个点和最后一个点之间的连通性。它还使用矢量叉积来确定下一个路径点相对于当前路径点的方向。采用矢量点积来计算当前路径点的旋转角度。制定了三个评估指标,例如路径点数,总路径长度和累积转弯角度,以判断优化算法的优缺点。实验结果表明,在场景1的地图上,改进的跳转点搜索算法将路径点从9个减少到7个,总路径长度减少了约12%,累计转弯角度减少了约27%。改进的跳跃点搜索算法旨在获得更短的最终路径,更小的累积转向角,并使机器人能够调整路径点的姿态。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号