RADIUS: Risk-Aware, Real-Time, Reachability-Based Motion Planning

TL;DR

RADIUS is a real-time motion planning framework that balances safety and performance by computing risk-aware trajectories without restrictive distribution assumptions, outperforming existing methods in simulations and hardware tests.

Contribution

It introduces RADIUS, a novel reachability-based, risk-aware motion planning approach that efficiently computes safe trajectories under uncertainty without distribution restrictions.

Findings

Outperforms state-of-the-art methods in simulation scenarios.

Provides real-time risk assessment and trajectory optimization.

Successfully demonstrated on hardware in driving scenarios.

Abstract

Deterministic methods for motion planning guarantee safety amidst uncertainty in obstacle locations by trying to restrict the robot from operating in any possible location that an obstacle could be in. Unfortunately, this can result in overly conservative behavior. Chance-constrained optimization can be applied to improve the performance of motion planning algorithms by allowing for a user-specified amount of bounded constraint violation. However, state-of-the-art methods rely either on moment-based inequalities, which can be overly conservative, or make it difficult to satisfy assumptions about the class of probability distributions used to model uncertainty. To address these challenges, this work proposes a real-time, risk-aware reachability-based motion planning framework called RADIUS. The method first generates a reachable set of parameterized trajectories for the robot offline. At run time, RADIUS computes a closed-form over-approximation of the risk of a collision with an obstacle. This is done without restricting the probability distribution used to model uncertainty to a simple class (e.g., Gaussian). Then, RADIUS performs real-time optimization to construct a trajectory that can be followed by the robot in a manner that is certified to have a risk of collision that is less than or equal to a user-specified threshold. The proposed algorithm is compared to several state-of-the-art chance-constrained and deterministic methods in simulation, and is shown to consistently outperform them in a variety of driving scenarios. A demonstration of the proposed framework on hardware is also provided.