A rapidly-exploring random tree (RRT) is a data structure and algorithm that is designed for efficiently searching nonconvex high-dimensional spaces. RRT is constructed incrementally in a way that ...

Through the use of the Discernibility Matrix in Rough Set, this paper introduced an Attribute Reduction Algorithm, based on which, a new one is put forward about the Generation of Hybrid Decision Tree ...