Rapidly exploring dense trees

Rapidly exploring dense trees (RDTs) is a data structure and algorithm primarily used in the field of robotics and motion planning. It is a variation of Rapidly Exploring Random Trees (RRTs), which are techniques designed to efficiently explore high-dimensional spaces, especially when dealing with complex environments where trajectories must be determined.