basmango / Bidirectional-Rapidly-exploring-random-tree

Implementation of BRRT ( A path finding algorithm) in Python.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Bidirectional-Rapidly-exploring-random-tree

Implementation of BRRT ( A path finding algorithm) in Python.

This repository contains a python implementation of the Bidirectional Rapidly-Exploring Random Tree (BRRT) algorithm. BRRT is an extension of the Rapidly-Exploring Random Tree (RRT) algorithm that is used for path planning in robotics and control systems.

Dependencies

numpy
matplotlib (for visualization only)

Demo:

brrt

About

Implementation of BRRT ( A path finding algorithm) in Python.

License:MIT License


Languages

Language:Python 100.0%