Rapidly Exploring Random Trees algorithm for path planning, implemented in Matlab. Written as the Final Project for ECE 545 at U of M Dearborn. Repo also includes an open and closed-loop controller.
-
Notifications
You must be signed in to change notification settings - Fork 0
pellegreene/RRT-Implementation-MATLAB
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Rapidly Exploring Random Trees algorithm for path planning, implemented in Matlab. Written for ECE 545 at U of M Dearborn
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published