Fast Collision Probability Estimation for Automated Driving using Multi-circular Shape Approximations
Leon Tolksdorf, Christian Birkner, Arturo Tejada, Nathan van de Wouw
TL;DR
This work tackles the problem of estimating the probability of collision (POC) for automated driving under Gaussian position uncertainty. It replaces costly Monte Carlo sampling with fast, multi-circle shape approximations, deriving four circle-to-circle POC methods (local, global, polar, and Monte Carlo) and identifying the local-coordinate approach as the most computationally efficient. The authors extend the framework to multi-circle ego models, introduce lens-overlap corrections, and provide upper and lower bounds on the approximation error, demonstrated in simulation. The results show substantial real-time benefits for motion-planning use cases while maintaining guaranteed bounds on the POC estimate, enabling safer and more scalable planning in autonomous systems.
Abstract
Many state-of-the-art methods for safety assessment and motion planning for automated driving require estimation of the probability of collision (POC). To estimate the POC, a shape approximation of the colliding actors and probability density functions of the associated uncertain kinematic variables are required. Even with such information available, the derivation of the POC is in general, i.e., for any shape and density, only possible with Monte Carlo sampling (MCS). Random sampling of the POC, however, is challenging as computational resources are limited in real-world applications. We present expressions for the POC in the presence of Gaussian uncertainties, based on multi-circular shape approximations. In addition, we show that the proposed approach is computationally more efficient than MCS. Lastly, we provide a method for upper and lower bounding the estimation error for the POC induced by the used shape approximations.
