In this repository you will find implementations of various algorithms I have studied as part of my doctoral research into path-finding. This includes Jump Point Search and Rectangular Symmetry Reduction.
If you would like more information about my work, or are looking for copies of published papers, please visit my ANU homepage.
| Path | Description |
|---|---|
| warthog | Fast implementations of various pathfinding algorithms including Jump Point Search and JPS+. |
| anyangle | Fast implementations of Anya and Polyanya, two techniques for optimal any-angle pathfinding |
| other | |
| ├ jump_point_graphs | A graph-specific reinterpretation of Jump Point Search. |
| ├ hog | A highly modified implementation of Hierarchical Open Graph v1. |
| └ topping | An implementation of Two Oracle Path PlannING (Topping). |
| gppc | |
| ├ gppc-2013 | Codes and instances from the 2013 Grid-based Path Planning Competition. |
| └ gppc-2014 | Codes and instances from the 2014 Grid-based Path Planning Competition. |
| maps | Benchmark gridmaps that I often use in experiments. |
| scenarios | Benchmark instances (point-to-point problems) that I use in experiments. |
My development platform is Linux 20.04with most of the code here being written in C++. When compiling I recommend that platform together with GCC 9.3.0. In the past I have successfully compiled and executed the same code on OSX (most recently macOS 10.13).