This repository contains an implementation of the Rapidly Exploring Random Tree (RRT) motion planning algorithm in Python. The implementation includes impementation for parallel processing, visualization tools to help users understand how the algorithm works and how it explores the configuration space.
Note that shape and size of the object is assumed to be very small in this implementation