The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Benchmarks for Grid-Based Pathfinding
Abstract
The study of algorithms on grids has been widespread in a number of research areas. Grids are easy to implement and offer fast memory access. Because of their simplicity, they are used even in commercial video games. But, the evaluation of work on grids has been inconsistent between different papers. Many research papers use different problem sets, making it difficult to compare results between papers. Furthermore, the performance characteristics of each test set are not necessarily obvious. This has motivated the creation of a standard test set of maps and problems on the maps that are open for all researchers to use. 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Geisberger, R., Sanders, P., Schultes, D., & Delling, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68552-4_24 · Cited by 714
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
Goldberg, A. V., Kaplan, H., & Werneck, R. F. (2006) · 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) · doi:10.1137/1.9781611972863.13 · Cited by 247
Highway dimension, shortest paths, and provably efficient algorithms
Abraham, I., Fiat, A., Goldberg, A. V., et al. (2010) · Cited by 147
Partial pathfinding using map abstraction and refinement
Sturtevant, N., & Buro, M. (2005) · National Conference on Artificial Intelligence · Cited by 124
Self-citationHighway Dimension, Shortest Paths, and Provably Efficient Algorithms
Abraham, I., Fiat, A., Goldberg, A. V., et al. (2010) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973075.64 · Cited by 111
Memory-Efficient Abstractions for Pathfinding
Sturtevant, N. (2007) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v3i1.18778 · Cited by 65
Self-citationUltrafast shortest-path queries via transit nodes
Bast, H., Funke, S., & Matijević, D. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/07 · Cited by 51
Cited by
Conflict-based search for optimal multi-agent pathfinding
Sharon, G., Stern, R., Felner, A., & Sturtevant, N. R. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.006 · Cited by 1,242
Self-citationA survey of real-time strategy game AI research and competition in StarCraft
Ontanon, S., Synnaeve, G., Uriarte, A., Richoux, F., Churchill, D., & Preuss, M. (2013) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2013.2286295 · Cited by 423
Liu, P., Chen, A. Y., Huang, Y.-N., Han, J.-Y., Lai, J.-S., Kang, S.-C., Wu, T.-H., Wen, M.-C., & Tsai, M.-H. (2014) · Smart Structures and Systems · doi:10.12989/sss.2014.13.6.1065 · Cited by 377
Metadata
- Authors
- Sturtevant, N. R.
- Venue
- IEEE Transactions on Computational Intelligence and AI in Games
- Published
- 2012-06
- Volume
- 4
- Issue
- 2
- Pages
- 144-148
- ISSN
- 1943-068X (ISSN-L)
- 1943-0698
- OpenAlex
- W2135125135
- Cited by
- 549
- References
- 7
- FWCI
- 20.65
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Benchmarks for Grid-Based Pathfinding. https://app.cochat.ai/papers/10.1109/tciaig.2012.2197681
- The paper
- Sturtevant, N. R. (2012). Benchmarks for Grid-Based Pathfinding. IEEE Transactions on Computational Intelligence and AI in Games. https://doi.org/10.1109/tciaig.2012.2197681
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
