Skip navigation
Skip navigation

Challenges and Tool Implementation of Hybrid Rapidly-Exploring Random Trees

Bak, Stanley; Bogomolov, Sergiy; Henzinger, Thomas A.; Kumar, Aviral


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...[Show more]

CollectionsANU Research Publications
Date published: 2017-07-12
Type: Conference paper
Source: Numerical Software Verification (LNCS 10381)
Book Title: Numerical Software Verification
DOI: 10.1007/978-3-319-63501-9_6


File Description SizeFormat Image
01_Bak_Challenges_and_Tool_2018.pdf1.03 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator