Probabilistic Risk Assessment for Chance-Constrained Collision Avoidance in Uncertain Dynamic Environments
Khaled A. Mustafa, Oscar de Groot, Xinwei Wang, Jens Kober, and Javier, Alonso-Mora

TL;DR
This paper introduces a real-time method to improve probabilistic collision avoidance planning by explicitly controlling risk bounds, leading to safer and less conservative robot navigation in uncertain, dynamic environments.
Contribution
It proposes a novel approach that evaluates and selects the least conservative planning trajectory within a specified risk threshold, enhancing safety guarantees in probabilistic planning.
Findings
Improves safety guarantees by tighter risk bounds.
Enhances performance of probabilistic planners in dynamic environments.
Validated through simulations and real-world experiments.
Abstract
Balancing safety and efficiency when planning in crowded scenarios with uncertain dynamics is challenging where it is imperative to accomplish the robot's mission without incurring any safety violations. Typically, chance constraints are incorporated into the planning problem to provide probabilistic safety guarantees by imposing an upper bound on the collision probability of the planned trajectory. Yet, this results in overly conservative behavior on the grounds that the gap between the obtained risk and the specified upper limit is not explicitly restricted. To address this issue, we propose a real-time capable approach to quantify the risk associated with planned trajectories obtained from multiple probabilistic planners, running in parallel, with different upper bounds of the acceptable risk level. Based on the evaluated risk, the least conservative plan is selected provided that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Formal Methods in Verification · Software Reliability and Analysis Research
