Grid-based path-finding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2338, Issue , 2002, Pages 44-55

  Yap, Peter ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GAMES; DISTRIBUTED COMPUTER SYSTEMS; ITERATIVE METHODS; LEARNING ALGORITHMS; MILITARY APPLICATIONS; ROBOT PROGRAMMING;

GRAPH SEARCH; GRID-SEARCH ALGORITHM; MILITARY SIMULATION; MINIMAL COST; NETWORK TRAFFIC; PATH FINDING; ROBOT PLANNING; SEARCH ALGORITHMS;

COMPUTER NETWORKS;

EID: 84974674579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47922-8_4     Document Type: Conference Paper

References (11)

1. K. Forbus, J. Mahoney, and K. Dill. How qualitative spatial reasoning can improve strategy game AIs. AAAI Spring Symposium on Artificial Intelligence and Interactive Entertainment, pages 35–40, 2001. 45
2. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet., 4(2):100–107, 1968. 44
3. S. Johnson. Wild Things. Wired, pages 78–83, 2002. March issue. 44
4. R. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97–109, 1985. 44
5. R. Korf, M. Reid, and S. Edelkamp. Time complexity of iterative-deepening A*. Artificial Intelligence, 129(2):199–218, 2001. 46
6. J. Laird and M. van Lent. Human-level AI’s killer application: Interactive computer games. In AAAI National Conference, pages 1171–1178, 2000. 46
7. J. Pearl. Heuristics: Intelligent search strategies. In Addison-Wesley, 1984. 46
8. S. Rabin. A* Aesthetic Optimizations. Game Programming Gems. Charles River Media, pages 264-271, 2000. 45
9. B. Stout. Smart moves: Intelligent path-finding. Game Developer Magazine, (October):28–35, 1996. 44
10. D. Takahashi. Games get serious. Red Herring, (87):64–70, 2000. December 18 issue. 44
11. P. Yap. New Ideas in Pathfinding. PhD thesis, Department of Computing Science, University of Alberta. In preparation. 48