arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.00776cs.AIcs.RO
收藏

基于Kinodynamic约束的安全区间路径规划

Safe Interval Path Planning With Kinodynamic Constraints

Moscow Institute of Physics and Technology(莫斯科物理技术学院);Federal Research Center for Computer Science and Control of Russian Academy of Sciences(俄罗斯科学院联邦计算机科学与控制研究中心);AIRI

Zain Alabedeen Ali, Konstantin Yakovlev

摘要:

安全区间路径规划(SIPP)是一种功能强大的算法,用于解决单智能体寻路问题,当智能体被限制在一个图中,并且该图的某些顶点/边由于填充环境的动态障碍物而在某些时间间隔被阻塞时。原始SIPP算法依赖于代理能够瞬时停止的假设。然而,这种假设在实践中往往不成立,例如,以巡航速度移动的移动机器人不能立即停止,而是需要逐渐减速到完全停止,这需要时间。换句话说,机器人受到Kinodynamic约束。不幸的是,正如我们在这项工作中所展示的,在这种情况下,原始SIPP是不完整的。为此,我们介绍了一种新的变体SIPP,可证明是完整的和最佳的规划与加速/减速。在实验评估中,我们表明原始SIPP的关键属性仍然适用于修改后的版本-与A* 相比,它执行的扩展少得多,因此速度明显更快。

英文摘要:

Safe Interval Path Planning (SIPP) is a powerful algorithm for solving single-agent pathfinding problem when the agent is confined to a graph and certain vertices/edges of this graph are blocked at certain time intervals due to dynamic obstacles that populate the environment. Original SIPP algorithm relies on the assumption that the agent is able to stop instantaneously. However, this assumption often does not hold in practice, e.g. a mobile robot moving with a cruising speed is not able to stop immediately but rather requires gradual deceleration to a full stop that takes time. In other words, the robot is subject to kinodynamic constraints. Unfortunately, as we show in this work, in such a case original SIPP is incomplete. To this end, we introduce a novel variant of SIPP that is provably complete and optimal for planning with acceleration/deceleration. In the experimental evaluation we show that the key property of the original SIPP still holds for the modified version -- it performs much less expansions compared to A* and, as a result, is notably faster.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑