Benchmarks for Grid-Based Pathfinding

  title={Benchmarks for Grid-Based Pathfinding},
  author={Nathan R Sturtevant},
  journal={IEEE Transactions on Computational Intelligence and AI in Games},
  • Nathan R Sturtevant
  • Published 3 May 2012
  • Computer Science
  • IEEE Transactions on Computational Intelligence and AI in Games
The study of algorithms on grids has been widespread in a number of research areas. [] Key Method In addition to creating these sets, we use a variety of metrics to analyze the properties of the test sets. The goal is that these test sets will be useful to many researchers, making experimental results more comparable across papers, and improving the quality of research on grid-based domains.

Figures and Tables from this paper

Regions Discovery Algorithm for Pathfinding in Grid Based Maps
A novel graph partition technique to boost the speed of pathfinding and preserve optimality for grid based environments is presented and the objective is to maintain the pathfinding optimality by only eliminating the regions that are obsolete.
Improving the Combination of JPS and Geometric Containers
This work considers an alternative approach where Dijkstra only from every node where a jump point is located, and compute and store geometric containers only for those outgoing edges which are consistent with the diagonal-first ordering in JPS.
Expected Path Degradation when Searching over a Sparse Grid Hierarchy
This work focuses on grid path-finding to propose an algorithm that constructs a grid spanner, where analysis for the obstacle-free case shows that significant performance gains can be achieved with a small decrease in expected path quality.
Euclidean Pathfinding with Compressed Path Databases
This work considers optimal and anytime algorithms for the Euclidean Shortest Path Problem (ESPP) in two dimensions and shows that the auxiliary data structures required by the new method are cheap to build and store and faster than a range of recent ESPP planners.
Canonical Orderings on Grids
This paper decomposes the algorithm and gradually re-constructs it, showing the component pieces from which the algorithm is constructed, and is able to define a spectrum of new algorithms that borrow and repurpose ideas from Jump Point Search.
Combining Bounding Boxes and JPS to Prune Grid Pathfinding
This paper looks at a specific implementation of the general idea of Geometric Containers, showing that, while it is effective on grid maps, when combined with JPS+ it provides state-of-the-art performance.
Fast Grid-Based Path Finding for Video Games
This work presents an algorithm called DBA* that uses a database of pre-computed paths to reduce the time to solve search problems, and requires less memory and time for search, and performs lessPre-computation than comparable real-time search algorithms.
Solving the Watchman Route Problem on a Grid with Heuristic Search
This paper formalizes WRP as a heuristic search problem and solves it with an A*-based algorithm and develops a series of admissible heuristics with increasing difficulty and accuracy.
TRANSIT Routing on Video Game Maps
A new general symmetry breaking technique is developed which adds small random e-values to edges in the search graph, reducing the size of the TRANSIT network by up to 4 times while preserving optimality, and which achieves up to four orders of magnitude speed improvement vs. A* search.


Near Optimal Hierarchical Path-Finding
HPA* (Hierarchical Path-Finding A*), a hierarchical approach for reducing problem complexity in path-finding on grid-based maps, which abstracts a map into linked local clusters and works very well in domains with a dynamically changing environment.
The shortest path problem : ninth DIMACS implementation challenge
This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms.
Memory-Based Heuristics for Explicit State Spaces
This work provides a number of techniques for using and improving true distance heuristics such that most of the benefits of the all-pairs shortest-path computation can be gained with less than 1% of the memory.
Partial Pathfinding Using Map Abstraction and Refinement
This paper introduces Partial-Refinement A* (PRA*), which can fully interleave planning and acting through path abstraction and refinement, and demonstrates the etfectiveness of PRA* in the domain of real-time strategy (RTS) games.
Fast Subgoaling for Pathfinding via Real-Time Search
A novel preprocessing algorithm is proposed that generates subgoals using a series of backward search episodes carried out from potential goals that are then used in the online planning phase to obtain high-quality solutions.
Memory-Efficient Abstractions for Pathfinding
This paper brings together several related pieces of work on using abstraction for pathfinding, showing how the ideas can be implemented using a minimal amount of memory.
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
This work introduces a bidirectional version of the reach-based approach of Gutman [17] that uses implicit lower bounds and adds shortcut arcs to reduce vertex reaches and greatly improves both preprocessing and query times.
TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
We introduce the concept of transit nodes, as a means for preprocessing a road network, with given coordinates for each node and a travel time for each edge, such that point-to-point shortest-path
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
CHs can be combined with many other route planning techniques, leading to improved performance for many-to-many routing, transit-node routing, goal-directed routing or mobile and dynamic scenarios, and a hierarchical query algorithm using bidirectional shortest-path search is obtained.
Highway dimension, shortest paths, and provably efficient algorithms
The notion of highway dimension is introduced and it is shown how low highway dimension gives a unified explanation for several seemingly different algorithms.