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...[Show more]
|Collections||ANU Research Publications|
|Source:||Numerical Software Verification (LNCS 10381)|
|Book Title:||Numerical Software Verification|
|01_Bak_Challenges_and_Tool_2018.pdf||1.03 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.