Lookahead pathologies for single agent search

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1531-1533

  Bulitko, Vadim ^a   Li, Lihong ^a   Greiner, Russ ^a   Levner, Ilya ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE SEARCH; HEURISTIC FUNCTIONS; HEURISTIC SEARCH; INCOMPLETE SEARCHES; OPTIMAL ACTIONS; OPTIMAL SOLUTIONS; REAL-TIME STRATEGY GAMES; SINGLE-AGENT;

ARTIFICIAL INTELLIGENCE;

HEURISTIC ALGORITHMS;

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

References (23)

1. A. G. Barto, S. J. Bradtke, and S. P. Singh. Learning to act using real-time dynamic programming. Artificial Intelligence, 72(1) :81-138, 1995.
2. D.F. Beal. An analysis of minimax. In M.R.B. Clarke, editor, Advances in Computer Chess, volume 2, pages 103 109. Edinburgh University Press, 1980.
3. D.F. Beal. Benefits of minimax search. In M.R.B. Clarke, editor, Advances in Computer Chess, volume 3, pages 17 24. Oxford : Pergamon, 1982.
4. D.F. Beal. Recent progress in understanding minimax search. In Proceedings of ACM Annual Conference, pages 164-169, New York, 1983. Association for Computing Machinery.
5. I. Bratko and M. Gams. Error analysis of the minimax principle. In M.R.B. Clarke, editor, Advances in Computer Chess, volume 3, pages 1-15. Oxford : Pergamon, 1982.
6. V. Bulitko and D.C. Wilkins. Real-time decision making for shipboard damage control. In Proceedings of the AAAI/KDD/UAI-2002 Joint Workshop on Real-Time Decision Support and Diagnosis Systems, pages 37 46, Edmonton, Alberta, 2002. AAAI Press.
7. J. Culberson and J. SchaelTer. Efficiently searching the 15-puzzle. Technical Report TR 94-08, Department of Computing Science, University of Alberta, 1994.
8. P.E. Hart, N.J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans, on Systems Science and Cybernetics, 4(2): 100-107, 1968.
9. Dan Higgins. Pathfinding design architecture. In Steve Rabin, editor, AI Game Programming Wisdom, pages 122-132. Charles River Media, 2002.
10. Richard E. Korf and Larry A. Taylor. Finding optimal solutions to the twenty-four puzzle. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 1202 1207, Portland, Oregon, USA, 1996. AAAI Press / The MIT Press.
11. R. Korf. Depth-first iterative deepening : An optimal admissible tree search. Artificial Intelligence, 27(1), 1985.
12. Richard E. Korf. Real-time heuristic search. Artificial Intelligence, 42(2-3): 189 211, 1990.
13. R. Korf. Finding optimal solutions to rubik's cube using pattern databases. In Proceedings of the Workshop on Computer Games (W31) at IJCAI-97, pages 21-26, Nagoya, Japan, 1997.
14. I. Levner, V. Bulitko, O. Madani, and R. Greiner. Performance of lookahead control policies in the face of abstractions and approximations. In S. Koenig and R. Holte, editors, Lecture Notes in Artificial Intelligence (LNAI), volume 2371, pages 299-308. Springer-Verlag, Berlin, Heidelberg, 2002.
15. G. Michon. Recursive Random Games: A Probab-listic Model for Perfect Information Games. PhD thesis, University of California at Los Angeles, 1983.
16. D.S. Nau. An investigation of the causes of pathology in games. Artificial Intelligence, 19:257-278, 1982.
17. D.S. Nau. Pathology on game trees revisited, and an alternative to minimaxing. Artificial Intelligence, 21(1,2):221 244,1983.
18. J. Pearl. On the Nature of Pathology in Game Searching. Artificial Intelligence, 20:427 453, 1983.
19. A. E. Prieditis. Machine discovery of effective admissible heuristics. Machine Learning, 12:117-141, 1993.
20. Alexander Reinefeld. Complete solution of the eight-puzzle and the benefit of node ordering in IDA. In IJCAI, pages 248-253, 1993.
21. Stuart Jonathan Russell and Eric H. Wefald. Do the right thing: Studies in limited rationality. MIT Press, 1991.
22. G. Schriifer. Presence and absence of pathology on game trees. In D.F. Beal, editor, Advances in Computer Chess, volume 4, pages 101-112. Oxford: Pergamon, 1986.
23. K. Thompson. Computer chess strength. In M.R.B. Clarke, editor, Advances in Computer Chess, volume 3, pages 55 56. Oxford : Pergamon, 1982.