[2] Jump point search preserves A*'s optimality, while potentially reducing its running time by an order of magnitude.
[1] Harabor and Grastien's original publication provides algorithms for neighbor pruning and identifying successors.
The authors presented modified pruning rules for applications where corner-cutting is not allowed the following year.
[3] This paper also presents an algorithm for pre-processing a grid in order to minimize online search times.
Although jump point search is limited to uniform cost grids and homogeneously sized agents, the authors are placing future research into applying JPS with existing grid-based speed-up techniques such as hierarchical grids.