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 that is provably optimal up to any desired approximation accuracy. Our method achieves computational efficiency by judiciously sampling a finite subset of the state space and generating an approximate reachable set by conducting reachability analysis on this finite set of states. We prove that the reachable set generated by our algorithm approximates the ground-truth reachable set for any user-specified approximation accuracy. As a corollary to our main method, we introduce an asymptoticallyoptimal, anytime algorithm for reachability analysis. We present simulation results that reaffirm the theoretical properties of our algorithm and demonstrate its effectiveness in real-world inspired scenarios.

[1]  Vijay Kumar,et al.  Sampling-based Falsification and Verification of Controllers for Continuous Dynamic Systems , 2008, Int. J. Robotics Res..

[2]  Emilio Frazzoli,et al.  Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems , 2004, HSCC.

[3]  Homayoun Seraji Reachability analysis for base placement in mobile manipulators , 1995, J. Field Robotics.

[4]  Matthias Althoff,et al.  Provably safe motion of mobile robots in human environments , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[5]  Paul Backes,et al.  Workspace and Reachability Analysis of a Robotic Arm for Sample Cache Retrieval from a Mars Rover , 2015 .

[6]  Rajeev Alur,et al.  Predicate abstraction for reachability analysis of hybrid systems , 2006, TECS.

[7]  Jonathan A. DeCastro,et al.  Compositional and Contract-Based Verification for Autonomous Driving on Road Networks , 2017, ISRR.

[8]  Christoph Borst,et al.  Reachability and Dexterity: Analysis and Applications for Space Robotics , 2015 .

[9]  Bruce H. Krogh,et al.  Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations , 1999, HSCC.

[10]  Matthias Althoff,et al.  Online Verification of Automated Road Vehicles Using Reachability Analysis , 2014, IEEE Transactions on Robotics.

[11]  Paulo Tabuada,et al.  Verification and Control of Hybrid Systems - A Symbolic Approach , 2009 .

[12]  J. Christian Gerdes,et al.  Shared Steering Control Using Safe Envelopes for Obstacle Avoidance and Vehicle Stability , 2016, IEEE Transactions on Intelligent Transportation Systems.

[13]  Karl Henrik Johansson,et al.  Guaranteeing safety for heavy duty vehicle platooning : Safe set computations and experimental evaluations , 2014 .

[14]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[15]  L. Dubins On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[16]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[17]  Sriram Sankaranarayanan,et al.  Simulation-guided lyapunov analysis for hybrid dynamical systems , 2014, HSCC.

[18]  Mo Chen,et al.  Exact and efficient Hamilton-Jacobi reachability for decoupled systems , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[19]  P. Davis Leonhard Euler's Integral: A Historical Profile of the Gamma Function: In Memoriam: Milton Abramowitz , 1959 .

[20]  Xin Chen,et al.  A Benchmark Suite for Hybrid Systems Reachability Analysis , 2015, NFM.

[21]  H. Fédérer Geometric Measure Theory , 1969 .

[22]  Mark H. Overmars,et al.  Reachability Analysis of Sampling Based Planners , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[23]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

[24]  Davide Bresolin,et al.  Verification of Robotic Surgery Tasks by Reachability Analysis: A Comparison of Tools , 2014, 2014 17th Euromicro Conference on Digital System Design.

[25]  Matthias Althoff,et al.  An Introduction to CORA 2015 , 2015, ARCH@CPSWeek.

[26]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[27]  Xin Chen,et al.  Flow*: An Analyzer for Non-linear Hybrid Systems , 2013, CAV.

[28]  Rüdiger Dillmann,et al.  Efficient Grasp Planning with Reachability Analysis , 2011, Int. J. Humanoid Robotics.

[29]  Fabian Immler,et al.  Verified Reachability Analysis of Continuous Systems , 2015, TACAS.

[30]  Edmund M. Clarke,et al.  Verification Tools for Finite-State Concurrent Systems , 1993, REX School/Symposium.

[31]  Lydia E. Kavraki,et al.  Falsification of LTL Safety Properties in Hybrid Systems , 2009, TACAS.

[32]  Claire J. Tomlin,et al.  Applications of hybrid reachability analysis to robotic aerial vehicles , 2011, Int. J. Robotics Res..

[33]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[34]  Mo Chen,et al.  Reach-avoid problems with time-varying dynamics, targets and constraints , 2014, HSCC.