Learning Probabilistic Obstacle Spaces from Data-driven Uncertainty using Neural Networks

TL;DR

This paper introduces a neural network-based method to efficiently generate probabilistic obstacle spaces with convex properties, improving path planning accuracy and reducing computational costs in autonomous systems.

Contribution

It presents a novel neural network approach trained via supervised learning to model uncertainty in obstacle spaces, offering faster and convex outputs compared to traditional methods.

Findings

Neural network accurately replicates probabilistic obstacle spaces with limited samples.

The method significantly reduces obstacle space generation time.

Generated obstacle spaces are convex, aiding path planning.

Abstract

Identifying the obstacle space is crucial for path planning. However, generating an accurate obstacle space remains a significant challenge due to various sources of uncertainty, including motion, behavior, and perception limitations. Even though an autonomous system can operate with an inaccurate obstacle space by being over-conservative and using redundant sensors, a more accurate obstacle space generator can reduce both path planning costs and hardware costs. Existing generation methods that generate high-quality output are all computationally expensive. Traditional methods, such as filtering, sensor fusion and data-driven estimators, face significant computational challenges or require large amounts of data, which limits their applicability in realistic scenarios. In this paper, we propose leveraging neural networks, commonly used in imitation learning, to mimic expert methods for modeling uncertainty and generating confidence regions for obstacle positions, which we refer to as the probabilistic obstacle space. The network is trained using a multi-label, supervised learning approach. We adopt a fine-tuned convex approximation method as the expert to construct training datasets. After training, given only a small number of samples, the neural network can accurately replicate the probabilistic obstacle space while achieving substantially faster generation speed. Moreover, the resulting obstacle space is convex, making it more convenient for subsequent path planning.