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 analysi...
Main Authors: | Liebenwein, Lucas, Baykal, Cenk, Gilitschenski, Igor, Karaman, Sertac, Rus, Daniela L |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
2018
|
Online Access: | http://hdl.handle.net/1721.1/116235 https://orcid.org/0000-0002-3229-6665 https://orcid.org/0000-0002-6776-9493 https://orcid.org/0000-0002-2225-7275 https://orcid.org/0000-0001-5473-3566 |
Similar Items
-
Data-dependent coresets for compressing neural networks with applications to generalization bounds
by: Baykal, Cenk, et al.
Published: (2022) -
Sampling-based Algorithms for Fast and Deployable AI
by: Baykal, Cenk
Published: (2022) -
Sampling-based algorithm for filtering using Markov chain approximations
by: Karaman, Sertac, et al.
Published: (2013) -
Practical data-dependent metric compression with provable guarantees
by: Indyk, Piotr, et al.
Published: (2019) -
Robust Sampling-based Motion Planning with Asymptotic Optimality Guarantees
by: Karaman, Sertac, et al.
Published: (2013)