Fringe search: Beating A* at pathfinding on game maps

IEEE 2005 Symposium on Computational Intelligence and Games, CIG'05

Volumn , Issue , 2005, Pages 125-132

  Björnsson, Yngvi ^a   Enzenberger, Markus ^b   Holte, Robert C ^b   Schaeffer, Jonathan ^b  

^a REYKJAVIK UNIVERSITY   (Iceland)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION DOMAINS; DE FACTO STANDARD; ITERATIVE DEEPENING; PATHFINDING; SEARCH ALGORITHMS; SEARCH SPACES; SEARCH TREES;

ARTIFICIAL INTELLIGENCE;

LEARNING ALGORITHMS;

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

References (14)

1. [Bagchi and Mahanti, 1983] Bagchi, A. and Mahanti, A. (1983). Search algorithms under different kinds of heuristics - a comparative study. Journal of the Association of Computing Machinery, 30(1):1-21. (Pubitemid 13504820)
2. [Björnsson et al., 2003] Björnsson, Y., Enzenberger, M., Holte, R., Schaeffer, J., and Yap., P. (2003). Comparison of different abstractions for pathfinding on maps. In International Joint Conference on Artificial Intelligence (IJCAI'03), pages 1511-1512.
3. [Ghosh et al., 1994] Ghosh, S., Mahanti, A., and Nau, D. S. (1994). ITS: An efficient limited-memory heuristic tree search algorithm. In National Conference on Artificial Intelligence (AAAI'94), pages 1353-1358.
4. [Hart et al., 1968] Hart, P., Nilsson, N., and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet., 4(2):100-107.
5. [Korf, 1985] Korf, R. (1985). Depth-first iterativedeepening: An optimal admissible tree search. Artificial Intelligence, 27:97-109. (Pubitemid 15604803)
6. [Korf and Zhang, 2000] Korf, R. and Zhang, W. (2000). Divide-and-conquer frontier search applied to optimal sequence alignment. In National Conference on Artificial Intelligence (AAAI'02), pages 910-916.
7. [Martelli, 1977] Martelli, A. (1977). On the complexity of admissible search algorithms. Artificial Intelligence, 8:1-13.
8. [Niewiadomski et al., 2003] Niewiadomski, R., Amaral, N., and Holte, R. (2003). Crafting data structures: A study of reference locality in refinement-based path finding. In International Conference on High Performance Computing (HiPC), number 2913 in Lecture Notes in Computer Science, pages 438-448. Springer.
9. [Pearl, 1984] Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison & Wesley.
10. [Reinefeld and Marsland, 1994] Reinefeld, A. and Marsland, T. (1994). Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16:701-710.
11. [Russell, 1992] Russell, S. J. (1992). Efficient memorybounded search methods. In European Conference on Artificial Intelligence (ECAI'92), pages 1-5, Vienna, Austria. Wiley.
12. [Sarkar et al., 1991] Sarkar, U., Chakrabarti, P., Ghose, S., and Sarkar, S. D. (1991). Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Artificial Intelligence, 50:207-221. (Pubitemid 21707421)
13. [Stentz, 1995] Stentz, A. (1995). The focussed D* algorithm for real-time replanning. In International Joint Conference on Artificial Intelligence (IJCAI'95), pages 1652-1659.
14. [Stout, 1996] Stout, B. (1996). Smart moves: Intelligent path-finding. Game Developer Magazine, (October):28- 35.