Benchmarks for grid-based pathfinding

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 4, Issue 2, 2012, Pages 144-148

  Sturtevant, Nathan R ^a  

^a University of Denver   (United States)

Author keywords

Grid; map; path planning; pathfinding; search

Indexed keywords

COMMERCIAL VIDEO; FAST MEMORY; GRID; GRID-BASED; PATHFINDING; PERFORMANCE CHARACTERISTICS; RESEARCH PAPERS; SEARCH; STANDARD TESTS; TEST SETS;

MAPS; MOTION PLANNING; PAPER;

RESEARCH;

EID: 84862524584     PISSN: 1943068X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCIAIG.2012.2197681     Document Type: Article

References (10)

1. N. R. Sturtevant and M. Buro, "Partial pathfinding usingmap abstraction and refinement," in Proc. 20th Nat. Conf. Artif. Intell., 2005, pp. 1392-1397.
2. N. R. Sturtevant, "Memory-efficient abstractions for pathfinding," in Proc. Conf. Artif. Intell. Interactive Digit. Entertainment, 2007, pp. 31-36.
3. N. R. Sturtevant, A. Felner, M. Barrer, J. Schaeffer, and N. Burch, "Memory-based heuristics for explicit state spaces," in Proc. Int. Joint Conf. Artif. Intell., 2009, pp. 609-614.
4. H. Bast, S. Funke, and D. Matijevic, "Ultrafast shortest-path queries via transit nodes," in The Shortest Path Problem: Ninth DIMACS Implementation Challenge, C. Demetrescu, A. V. Goldberg, and D. S. Johnson, Eds. Providence, RI: AMS, 2009, pp. 175-192.
5. I. Abraham, A. Fiat, A. V. Goldberg, and R. F. Werneck, "Highway dimension, shortest paths, and provably efficient algorithms," in Proc. 21st Annu. ACM-SIAM Symp. Discrete Algorithms, Philadelphia, PA, 2010, pp. 782-793.
6. R.Geisberger, P. Sanders, D. Schultes, andD.Delling, "Contraction hierarchies: Faster and simpler hierarchical routing in road networks," in Experimental Algorithms, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2008, vol. 5038, pp. 319-333.
7. A. V. Goldberg, H. Kaplan, and R. F.Werneck, "Reach for a: Efficient point-to-point shortest path algorithms," in Proc. Workshop Algorithm Eng. Exp., 2006, pp. 129-143.
8. D. C. Rayner, M. H. Bowling, and N. R. Sturtevant, "Euclidean heuristic optimization," in Proc. 25th Conf. Artif. Intell., 2011, pp. 81-86.
9. A.Botea, M. Müller, and J. Schaeffer, "Near optimal hierarchical pathfinding," J. Game Develop., vol. 1, no. 1, pp. 7-28, 2004.
10. C.Hernández and J. A. Baier, "Fast subgoaling for pathfinding via realtime search," in Proc. Int. Conf. Autom. Planning Scheduling, 2011, pp. 327-330.