Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Fast Risk Assessment for Autonomous Vehicles Using Learned Models of Agent Futures

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

Thumbnail Image
Download
Name

2005.13458.pdf

Description
Accepted version
Size

861.4 KB

Format

Adobe PDF

Checksum (MD5)

4dd3d3b2ce7a42054e8634443880450c

sword-2022-09-21T15:33:11.original.xml (130 B)
Original SWORD entry document
Author(s)
Wang, Allen
•
Huang, Xin
•
Jasour, Ashkan
•
Williams, Brian
Date Issued
2020
Journal
Robotics: Science and Systems XVI
Publisher
Robotics: Science and Systems Foundation
Citation
Wang, Allen, Huang, Xin, Jasour, Ashkan and Williams, Brian. 2020. "Fast Risk Assessment for Autonomous Vehicles Using Learned Models of Agent Futures." Robotics: Science and Systems XVI.
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/145543
DOI of Published Version
https://doi.org/10.15607/RSS.2020.XVI.089
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.