scispace - formally typeset
Open AccessPosted Content

Fast Risk Assessment for Autonomous Vehicles Using Learned Models of Agent Futures

Reads0
Chats0
TLDR
In this article, the authors present fast non-sampling based methods to assess the risk of trajectories for autonomous vehicles when probabilistic predictions of other agents' futures are generated by deep neural networks (DNNs).
Abstract
This paper presents fast non-sampling based methods to assess the risk of trajectories for autonomous vehicles when probabilistic predictions of other agents' futures are generated by deep neural networks (DNNs). The presented methods address a wide range of representations for uncertain predictions including both Gaussian and non-Gaussian mixture models for predictions of both agent positions and controls. We show that the problem of risk assessment when Gaussian mixture models (GMMs) of agent positions are learned can be solved rapidly to arbitrary levels of accuracy with existing numerical methods. To address the problem of risk assessment for non-Gaussian mixture models of agent position, we propose finding upper bounds on risk using Chebyshev's Inequality and sums-of-squares (SOS) programming; they are both of interest as the former is much faster while the latter can be arbitrarily tight. These approaches only require statistical moments of agent positions to determine upper bounds on risk. To perform risk assessment when models are learned for agent controls as opposed to positions, we develop TreeRing, an algorithm analogous to tree search over the ring of polynomials that can be used to exactly propagate moments of control distributions into position distributions through nonlinear dynamics. The presented methods are demonstrated on realistic predictions from DNNs trained on the Argoverse and CARLA datasets and are shown to be effective for rapidly assessing the probability of low probability events.

read more

Citations
More filters
Journal ArticleDOI

DiversityGAN: Diversity-Aware Vehicle Motion Prediction via Latent Semantic Sampling

TL;DR: In this paper, a generative adversarial network (GAN) framework is extended with a low-dimensional approximate semantic space, and shape that space to capture semantics such as merging and turning, and sample from this space in a way that mimics the predicted distribution, but allows to control coverage of semantically distinct outcomes.
Journal ArticleDOI

Non-Gaussian Chance-Constrained Trajectory Planning for Autonomous Vehicles Under Agent Uncertainty

TL;DR: In this article, the authors extend the state-of-the-art by presenting a methodology to upper-bound chance-constraints defined by polynomials and mixture models with potentially non-Gaussian components.
Journal ArticleDOI

A Robust Scenario MPC Approach for Uncertain Multi-Modal Obstacles

TL;DR: A control scheme based on Model Predictive Control with robust constraint satisfaction where the constraint uncertainty, stemming from the road users’ behavior, is multimodal and a feedback policy that is a function of the disturbance mode and allows the controller to take less conservative actions is presented.
Posted Content

Chance-Constrained Trajectory Optimization for Safe Exploration and Learning of Nonlinear Systems

TL;DR: This work presents a new approach for optimal motion planning with safe exploration that integrates chance-constrained stochastic optimal control with dynamics learning and feedback control and proves the safety of rollout from the exploration method and reduction in uncertainty over epochs, thereby guaranteeing the consistency of the learning method.
Posted Content

Non-Gaussian Chance-Constrained Trajectory Planning for Autonomous Vehicles in the Presence of Uncertain Agents.

TL;DR: This paper presents a general method for enforcing chance-constraints on the probability of collision with other agents in model predictive control problems for autonomous driving that can be used with non-Gaussian mixture models of agent positions.
References
More filters
Proceedings ArticleDOI

YALMIP : a toolbox for modeling and optimization in MATLAB

TL;DR: Free MATLAB toolbox YALMIP is introduced, developed initially to model SDPs and solve these by interfacing eternal solvers by making development of optimization problems in general, and control oriented SDP problems in particular, extremely simple.
Journal ArticleDOI

Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones

TL;DR: This paper describes how to work with SeDuMi, an add-on for MATLAB, which lets you solve optimization problems with linear, quadratic and semidefiniteness constraints by exploiting sparsity.
Journal ArticleDOI

New Results in Linear Filtering and Prediction Theory

TL;DR: The Duality Principle relating stochastic estimation and deterministic control problems plays an important role in the proof of theoretical results and properties of the variance equation are of great interest in the theory of adaptive systems.
Journal ArticleDOI

Unscented filtering and nonlinear estimation

TL;DR: The motivation, development, use, and implications of the UT are reviewed, which show it to be more accurate, easier to implement, and uses the same order of calculations as linearization.
Proceedings ArticleDOI

The unscented Kalman filter for nonlinear estimation

TL;DR: The unscented Kalman filter (UKF) as discussed by the authors was proposed by Julier and Uhlman (1997) for nonlinear control problems, including nonlinear system identification, training of neural networks, and dual estimation.
Related Papers (5)