AI project for 3D Path Planning. Other details and running instructions can be found on the Readme.md file
MIT License
3D path planning is required in various applications such as robotics, self-driving cars, protein folding, games etc. It ensures to and a trajectory from the initial point to the destination, subject to rules of motion and any other constraints, such as collision avoid- ance, balance and joint limits. Algorithms like Dijkstra, A* can be used but they are quite expensive to compute for large clustered space Random sampling based planning algorithm like RRT can solve motion planning problem while also taking the differential constraint into consideration. But the paths so produced are jagged, with several unnecessary branches. They need to be pruned and smoothed. An approach could be to fit a spline over the points which would produce a smooth path. Developers: Kushagra Khare, Rachit Jain Mentor: Prof. Srisha Rao, IIIT-B Project Duration: Aug '18 - Nov '18
In this project, we aim to provide an algorithm for 3D Path Planning. We will implement a RRT-A* based 3D Path Planning algorithm. The algorithm would include path pruning with constraint satisfaction and account for non-holonomic constraints. We will go ahead with Manhattan based RRT-A* in the initial stages but will also try to find an optimized distance metric function using Voronoi bias property for the algorithm.