Rapidly Exploring Random Tree (RRT) is an algorithm designed to efficiently search nonconvex, high-dimensional spaces by randomly building a space-filling tree.
-
Notifications
You must be signed in to change notification settings - Fork 0
jungjae01eng/PathPlanning-RRT_Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Personal Project - Rapidly Exploring Random Tree (RRT) is an algorithm designed to efficiently search nonconvex, high-dimensional spaces by randomly building a space-filling tree.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published