jbujak / A-star-CUDALinks
A* implementation for NVIDIA GPU
☆72Updated 5 years ago
Alternatives and similar repositories for A-star-CUDA
Users that are interested in A-star-CUDA are comparing it to the libraries listed below
Sorting:
- Universal General Propose A* for a GPU platform☆35Updated 9 years ago
- LBFGS-Lite: A header-only L-BFGS unconstrained optimizer.☆398Updated 2 years ago
- Source repository for OOQP, a quadratic programming solver (and more)☆81Updated 9 years ago
- Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables☆93Updated 3 years ago
- STD-Trees: Spatio-temporal Deformable Trees for Multirotors Kinodynamic Planning☆44Updated 3 years ago
- Fast and simple voxel traversal algorithm through a 3D space partition.☆169Updated 6 years ago
- Small-Dimensional Quadratic Programming in Linear Time☆74Updated 3 years ago
- ☆19Updated 3 years ago
- Basic algorithms for height map based 3D path planning: BFS, Dijkstra, A*, Theta*☆97Updated 5 years ago
- Robot Path Planning Algorithm- Generalized Voronoi Diagram☆37Updated 6 years ago
- Builds 2D signed distance fields from images, 3D signed distance fields from pointclouds, 3D signed distance fields from Octomap, provide…☆244Updated 2 years ago
- Root-Finder is a header-only univariate polynomial solver, which finds/counts all real roots of any polynomial within any interval.☆43Updated 3 years ago
- Simplexes with Minimum Volume Enclosing Polynomial Curves☆81Updated last year
- ☆105Updated 2 years ago
- Simulation of RRT* algorithms with and without Dubins Nonholonomic Robot steering.☆67Updated 8 years ago
- Generalized voronoi diagram for python☆29Updated 9 months ago
- Implementation of ORCA algorithm☆161Updated last year
- [IROS 2023] Continuous Implicit SDF Based Any-shape Robot Trajectory Optimization☆257Updated last year
- c++ implementation of 3D incremental convell hull algorthim☆42Updated 5 years ago
- Root-Finder is a header-only univariate polynomial solver, which finds/counts all real roots of any polynomial within any interval.☆37Updated 4 years ago
- Reciprocal Collision Avoidance with Acceleration-Velocity Obstacles (C++)☆71Updated last week
- Basic algorithms for single-shot grid-based 2D path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*☆73Updated 4 years ago
- Toy code for local path planning algorithm DWA(Dynamic Window Approach) in CUDA implementation.☆22Updated 5 years ago
- Fast and lightweight class for Bezier curves of any order in C++☆108Updated last month
- C++ implementation of RRT, RRT*, and Informed-RRT* using kd-tree for searching NN and NBHD nodes. Supports arbitrary dimensions and compi…☆143Updated 4 years ago
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆256Updated 6 months ago
- C++ hybrid-a-star extracted from ROS2 nav2 stack☆35Updated 3 years ago
- Behavior planners based on single- and multi-agent Monte Carlo Tree Search☆41Updated 3 years ago
- Classical robotics algorithms implemented in C++17.☆49Updated 5 years ago
- A C++ interface for the OSQP quadratic programming solver.☆282Updated 2 years ago