確率的ロボットナビゲーションにおけるエンドツーエンドリスクの上下界
Upper and Lower Bounds for End-to-End Risks in Stochastic Robot Navigation
不確実性下の線形ガウス系ロボットの経路衝突確率を、確率論の不等式を用いて上下界で推定する高速手法を提案し、モンテカルロ法より速くBooleの上界より保守性が低いことを示した。
著者: Apurva Patil, Takashi Tanaka
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
We present novel upper and lower bounds to estimate the collision probability of motion plans for autonomous agents with discrete-time linear Gaussian dynamics. Motion plans generated by planning algorithms cannot be perfectly executed by autonomous agents in reality due to the inherent uncertainties in the real world. Estimating collision probability is crucial to characterize the safety of trajectories and plan risk optimal trajectories. Our approach is an application of standard results in probability theory including the inequalities of Hunter, Kounias, Frechet, and Dawson. Using a ground robot navigation example, we numerically demonstrate that our method is considerably faster than the naive Monte Carlo sampling method and the proposed bounds are significantly less conservative than Boole's bound commonly used in the literature.
