Fer14 / rapidly-exploring-random-trees

Path finding using the algorithm RapidExploringRandomTrees

RRT simulation in Python

A simple Python-based simulation of path finding using the algorithm RapidExploringRandomTrees

Introduction

This project is a simple simulation of path finding using the algorithm RapidExploringRandomTrees. The simulation is written in Python and uses the PyGame library for the graphical interface.

rrt.webm

Installation

Clone the repository:

git clone https://github.com/Fer14/rapidly-exploring-random-trees

Change into the project directory:

cd rapidly-exploring-random-trees

Install the necessary libraries:

pip install -r requirements.txt

Usage

Run the simulation:

python rrt.py

Simplified version

Aditionally there is a simplified version of the rrt algorithm that looks like this:

rrt_simplified.webm

To run it, simply ro:

python rrt.py --simplified

Contributing

If you would like to contribute to this project, please follow these steps:

• Fork the repository on GitHub.
• Clone the forked repository to your local machine.
• Create a new branch for your feature or bug fix.
• Implement your changes and test them.
• Commit your changes with descriptive commit messages.
• Push the changes to your fork on GitHub.
• Create a pull request to the original repository.