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

Fast Certification of Collision Probability Bounds with Uncertain Convex Obstacles

Massachusetts Institute of Technology(麻省理工学院)

Charles Dawson, Andreas Hofmann, Brian Williams

英文摘要:

To operate reactively in uncertain environments, robots need to be able to quickly estimate the risk that they will collide with their environment. This ability is important for both planning (to ensure that plans maintain acceptable levels of safety) and execution (to provide real-time warnings when risk exceeds some threshold). Existing methods for estimating this risk are often limited to models with simplified geometry (e.g. point robots); others handle complex geometry but are too slow for many applications. In this paper, we present two algorithms for quickly computing upper bounds on the risk of collision between a robot and uncertain obstacles by searching for certificate regions that capture collision probability mass while avoiding the robot. These algorithms come with strong theoretical guarantees that the true risk does not exceed the estimated value, support arbitrary geometry via convex decomposition, and provide fast query times ($<200μ$s) in representative scenarios. We characterize the performance of these algorithms in environments of varying complexity, demonstrating at least an order of magnitude speedup over existing techniques.

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

↑