medalotte/sampling-based-planners
C++ implementation of RRT, RRT*, and Informed-RRT* using kd-tree for searching NN and NBHD nodes. Supports arbitrary dimensions and compiles as a shared library.
C++MIT
Issues
- 4
format the code with clang-format
#8 opened by medalotte - 0
The collision checking between the goal and the min_cost_node is not perform in implementation of Informed RRT*
#7 opened by medalotte - 0
implement GridConstraint::checkCollision() appropriately using Bresenham's line algorithm
#5 opened by medalotte - 1
- 2