rrt-algorithms
- Software
- Navigation and mapping
- Library
A Python collection of sampling-based motion planning algorithms, including RRT, RRT* and RRT-Connect, that work in any number of dimensions.
Made by motion-planning.
Source on GitHub: github.com/motion-planning/rrt-algorithms (opens in a new tab). Facts read at commit 14e4796 (opens in a new tab).
Licenses
- Code
- MIT (opens in a new tab)
Read by Robotheca from LICENSE (opens in a new tab) (MIT) at commit 14e4796 (opens in a new tab), on 22 Oct 2026.
- Commercial use
- Yes
What it does
- Implements RRT, RRT* (standard and bidirectional, plus a lazy shortening variant) and RRT-Connect.
- Scales to n-dimensional search spaces.
- Uses R-trees to speed up collision checking and distance queries.
- Obstacles are defined as axis-aligned (hyper)rectangles.
- Edge resolution is set by q (probe distance) and r (discretization length for collision sampling).
- Includes Plotly-based visualization examples for 2D and 3D paths.
Written by Robotheca from the project's README (opens in a new tab) at commit 14e4796.
Getting started
- Difficulty
- Beginner
- Hardware it needs, as the project states it
- Python 3+, NumPy, Rtree; Plotly is only needed for plotting.
- How to start
- The project's README (opens in a new tab)
Maintenance
- Status
- Active: a commit in the last 90 days
- Newest commit
- 5 Sept 2026 on develop
- Latest release
- None published on GitHub
Checked on GitHub on 22 Oct 2026.
Links
Robots that can run it
No robot on Robotheca is linked to it yet. Links come from a robot's robot.yaml, from its dependency files read as text, or from Robotheca's editors.
Robotheca lists software as a reference: nothing is hosted or run here, and every fact links to where it was read.