Challenges and Tool Implementation of Hybrid Rapidly-Exploring Random Trees

A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a space-filling tree. The tree is constructed from random points drawn from system’s state space and is biased to grow towards large unexplored areas in the system. RRT can provide better coverage of a system’s possible behaviors compared with random simulations, but is more lightweight than full reachability analysis. In this paper, we explore some of the design decisions encountered while implementing a hybrid extension of the RRT algorithm, which have not been elaborated on before. In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena. We showcase our ideas using heater and navigation benchmarks.

[1]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[2]  Sergiy Bogomolov,et al.  A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx , 2012, CAV.

[3]  Steven M. LaValle,et al.  Resolution complete rapidly-exploring random trees , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[4]  Marius Mikucionis,et al.  Co-Simulation of Hybrid Systems with SpaceEx and Uppaal , 2015 .

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

[6]  Tarik Nahhal,et al.  Randomized Simulation of Hybrid Systems For Circuit Validation , 2006, FDL.

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

[8]  Vijay Kumar,et al.  Adaptive RRTs for Validating Hybrid Robotic Control Systems , 2004, WAFR.

[9]  Thomas A. Henzinger,et al.  Scalable Static Hybridization Methods for Analysis of Nonlinear Systems , 2016, HSCC.

[10]  Sergiy Bogomolov,et al.  Composing Reachability Analyses of Hybrid Systems for Safety and Stability , 2010, ATVA.

[11]  Lydia E. Kavraki,et al.  Hybrid systems: from verification to falsification by combining motion planning and discrete search , 2007, CAV.

[12]  Antoine Girard,et al.  SpaceEx: Scalable Verification of Hybrid Systems , 2011, CAV.

[13]  Ansgar Fehnker,et al.  Benchmarks for Hybrid Systems Verification , 2004, HSCC.

[14]  Sergiy Bogomolov,et al.  HYST: a source transformation and translation tool for hybrid automaton models , 2015, HSCC.