Benchmarks for Grid-Based Pathfinding
暂无分享,去创建一个
[1] Jorge A. Baier,et al. Fast Subgoaling for Pathfinding via Real-Time Search , 2011, ICAPS.
[2] Peter Sanders,et al. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.
[3] A. Goldberg,et al. TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing , 2006 .
[4] Stefan Funke,et al. Ultrafast Shortest-Path Queries via Transit Nodes , 2006, The Shortest Path Problem.
[5] Andrew V. Goldberg,et al. The shortest path problem : ninth DIMACS implementation challenge , 2009 .
[6] Nathan R. Sturtevant,et al. Partial Pathfinding Using Map Abstraction and Refinement , 2005, AAAI.
[7] Nathan R. Sturtevant,et al. Memory-Based Heuristics for Explicit State Spaces , 2009, IJCAI.
[8] Adi Botea,et al. Near Optimal Hierarchical Path-Finding , 2004, J. Game Dev..
[9] Nathan R. Sturtevant,et al. Memory-Efficient Abstractions for Pathfinding , 2007, AIIDE.
[10] Amos Fiat,et al. Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.
[11] Nathan R. Sturtevant,et al. Euclidean Heuristic Optimization , 2011, AAAI.
[12] Haim Kaplan,et al. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.