Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees

Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees

The successful deployment of many autonomous systems in part hinges on providing rigorous guarantees on their performance and safety through a formal verification method, such as reachability analysis. In this work, we present a simple-to-implement, sampling-based algorithm for reachability analysis...

Full description

Bibliographic Details
Main Authors: Liebenwein, Lucas (Contributor), Baykal, Cenk (Contributor), Gilitschenski, Igor (Contributor), Karaman, Sertac (Contributor), Rus, Daniela L (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Rus, Daniela (Contributor)
Format: Article
Language:English
Published: 2018-06-12T13:26:54Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items