Motion Planning Library for Grid Maps
This library aims to provide pathfinding algorithms for grid based maps which are thoroughly unit tested and benchmarked for use in Robot Path Planning and Game development.
Currently the library provides the following path planning algorithms to the users:
- Breadth First Search
- Depth First Search
- A-Star Heuristic Search
- Jump Point Search
The following features are planned to be added in the future:
- Faster and Flexible versions of A-star
- Sampling Based Algorithms for Larger Search Spaces
- Support for 3 Dimensional Planning