This is a small library that implements a meldable priority queue and a generalizable A* search algorithm on top of that. The performance is good. It targets PCL profile 111.
Simple A* (A-Star) library. Simply define your problem space, then traverse it. Supports multi-threaded traversal.
Optimized for heavy node expansion calculations rather than node quantity.
For examples, see github project.
This is a small library that implements a meldable priority queue and a generalizable A* search algorithm on top of that. The performance is good. It targets PCL profile 111.
A simple to use collection of various path finding algorithms.
Includes a A*, Breadth-First, and Greedy graph traversing path finding implementations.
Currently a work in progress and API's may change until version 1.