A python port of Jumper, a pathfinding library originally developed by Yonaba.
Jumper is a pathfinding library designed for grid-based games. It aims to be fast and lightweight. It features a wide range of search algorithms, built within a clean interface with chaining features which makes it very friendly and easy to use.
The original idea of jumper-py was to assess whether the readability of python is better or not than the readability of Lua (still trying to assess and forge an opinion on the matter). No benchmarking has been done yet.
- Theta-star: Any-Angle Path Planning on Grids: https://www.aaai.org/Papers/AAAI/2007/AAAI07-187.pdf
- JPS algorithm
- Online Graph Prunning for Pathfinding on Grid Maps: http://users.cecs.anu.edu.au/~dharabor/data/papers/harabor-grastien-aaai11.pdf
- Jump point search algorithm: https://www.gamedev.net/tutorials/programming/artificial-intelligence/jump-point-search-fast-a-pathfinding-for-uniform-cost-grids-r4220/
- Clearance-based pathfinding: https://users.cecs.anu.edu.au/~dharabor/data/papers/harabor-aigamedev09.pdf