Implementation, analysis and comparison of path planners based on generation of random point trees

The purpose of this work is to implement, analyze and compare two different route planning algorithms in three different static environments which include: avoiding a single major obstacle, solving a navigation problem and finally going through narrow passages. The algorithms used are sampling-based algorithms, in particular they are bidirectional RRTs. They have been studied in order to find the best performance in terms of computational time and length of the final path