arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.05384cs.ROmath.OC
收藏

FPR --一种快速的碰撞概率路径风险算法

FPR -- Fast Path Risk Algorithm to Evaluate Collision Probability

Andrew Blake, Alejandro Bordallo, Kamen Brestnichki, Majd Hawasly, Svetlin Penkov, Subramanian Ramamoorthy, Alexandre Silva

摘要:

随着移动机器人和自动驾驶汽车在以人为中心的环境中变得越来越普遍,需要控制碰撞风险。感知模块,例如机器视觉,提供对象位置的不确定估计。在这种情况下,经常假设一个确切已知的自由空间是无效的。显然,没有路径可以保证是无冲突的。相反,它是必要的,以计算碰撞的概率风险在任何建议的路径。FPR算法,提出了这里,有效地计算上界的碰撞风险的机器人在平面上移动。该计算根据候选轨迹的风险程度(上的界限)对候选轨迹进行排序。然后,可以根据次要标准(例如舒适度和效率)选择用户定义的主要风险阈值内的路径。本文的主要贡献是FPR算法及其“卷积技巧”,用于分解用于限制碰撞风险的积分。作为卷积技巧的结果,给定$K$障碍和$N$候选路径,计算负荷从原始$O(NK)$减少到定性更快的$O(N+K)$。

英文摘要:

As mobile robots and autonomous vehicles become increasingly prevalent in human-centred environments, there is a need to control the risk of collision. Perceptual modules, for example machine vision, provide uncertain estimates of object location. In that context, the frequently made assumption of an exactly known free-space is invalid. Clearly, no paths can be guaranteed to be collision free. Instead, it is necessary to compute the probabilistic risk of collision on any proposed path. The FPR algorithm, proposed here, efficiently calculates an upper bound on the risk of collision for a robot moving on the plane. That computation orders candidate trajectories according to (the bound on) their degree of risk. Then paths within a user-defined threshold of primary risk could be selected according to secondary criteria such as comfort and efficiency. The key contribution of this paper is the FPR algorithm and its `convolution trick' to factor the integrals used to bound the risk of collision. As a consequence of the convolution trick, given $K$ obstacles and $N$ candidate paths, the computational load is reduced from the naive $O(NK)$, to the qualitatively faster $O(N+K)$.

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

↑