Distributionally safe path planning: Wasserstein Safe RRT

Paul Lathrop, Beth Boardman, and Sonia Martínez
IEEE Robotics and Automation Letters, 7 (1) (2021) 430-437

Abstract:

In this paper, we propose a Wasserstein metric-based random path planning algorithm. Wasserstein Safe RRT (W-Safe RRT) provides finite-sample probabilistic guarantees on the safety of a returned path in an uncertain obstacle environment. Vehicle and obstacle states are modeled as distributions based upon state and model observations. We define limits on distributional sampling error so the Wasserstein distance between a vehicle state distribution and obstacle distributions can be bounded. This enables the algorithm to return safe paths with a confidence bound through combining finite sampling error bounds with calculations of the Wasserstein distance between discrete distributions. W-Safe RRT is compared against a baseline minimum encompassing ball algorithm, which ensures balls that minimally encompass discrete state and obstacle distributions do not overlap. The improved performance is verified in a 3D environment using single, multi, and rotating non-convex obstacle cases, with and without forced obstacle error in adversarial directions, showing that W-Safe RRT can handle poorly modeled complex environments.

File: (IEEExplore)

Bib-tex entry:

@article{PL-BB-SS:21,
author = {P. Lathrop and B. Boardman and S. Mart{\'\i}nez},
title = {Distributionally safe path planning: Wasserstein Safe RRT.},
journal= {IEEE Robotics and Automation Letters},
pages = {430--437},
volume = {7},
number = {1},
year = {2021}
}