Ultra-fast optimal pathfinding without runtime search

Proceedings of the 7th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2011

Volumn , Issue , 2011, Pages 122-127

  Botea, Adi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION FACTOR; ITINERARY PLANNING; MEMORY REQUIREMENTS; OPTIMAL PATHS; ORDERS OF MAGNITUDE; PATHFINDING; PERFORMANCE DEGRADATION; REASONABLE VALUE;

ARTIFICIAL INTELLIGENCE; HUMAN COMPUTER INTERACTION; ROBOT PROGRAMMING;

OPTIMIZATION;

EID: 84869846976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Björnsson, Y., and Halldórsson, K. 2006. Improved heuristics for optimal path-finding on game maps. In AIIDE, 9-14.
2. Botea, A.; Müller, M.; and Schaeffer, J. 2004. Near optimal hierarchical path-finding. Journal of Game Dev. 1:7-28.
3. Cazenave, T. 2006. Optimizations of data structures, heuristics and algorithms for path-finding on maps. In CIG, 27-33.
4. Culberson, J., and Schaeffer, J. 1998. Pattern Databases. Computational Intelligence 14(4):318-334.
5. Goldberg, A. V., and Harrelson, C. 2005. Computing the Shortest Path: A* Search Meets Graph Theory. In ACMSIAM Symposium on Discrete Algorithms SODA-05.
6. Goldenberg, M.; Felner, Ar.; Sturtevant, N.; and Schaeffer, J. 2010. Portal-based true-distance heuristics for path finding. In Symposium on Combinatorial Search, 39-45.
7. Harabor, D., and Botea, A. 2010. Breaking path symmetries in 4-connected grid maps. In AIIDE-10, 33-38.
8. Harabor, D., and Grastien, A. 2011. Online graph pruning for pathfinding on grid maps. In AAAI-11.
9. Ishida, T., and Korf, R. E. 1992. Moving Target Search. In IJCAI, 204-210.
10. Kring, A.; Champandard, A. J.; and Samarin, N. 2010. DHPA* and SHPA*: Efficient Hierarchical Pathfinding in Dynamic and Static Game Worlds. In AIIDE-10, 39-44.
11. Sankaranarayanan, J.; Alborzi, H.; and Samet, H. 2005. Efficient query processing on spatial networks. In ACM workshop on Geographic information systems, 200-209.
12. Sturtevant, N., and Buro, M. 2005. Partial Pathfinding Using Map Abstraction and Refinement. In AAAI, 47-52.
13. Sturtevant, N. R.; Felner, A.; Barrer, M.; Schaeffer, J.; and Burch, N. 2009. Memory-based heuristics for explicit state spaces. In Proceedings of IJCAI, 609-614.
14. Wang, K.-H. C., and Botea, A. 2009. Tractable Multi-Agent Path Planning on Grid Maps. In IJCAI, 1870-1875.