@inproceedings{633,
  abstract     = {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.},
  author       = {Bak, Stanley and Bogomolov, Sergiy and Henzinger, Thomas A and Kumar, Aviral},
  editor       = {Abate, Alessandro and Bodo, Sylvie},
  isbn         = {978-331963500-2},
  location     = {Heidelberg, Germany},
  pages        = {83 -- 89},
  publisher    = {Springer},
  title        = {{Challenges and tool implementation of hybrid rapidly exploring random trees}},
  doi          = {10.1007/978-3-319-63501-9_6},
  volume       = {10381},
  year         = {2017},
}