Lookahead pathology in real-time path-finding

AAAI Workshop - Technical Report

Volumn WS-06-11, Issue , 2006, Pages 108-114

  Luštrek, Mitja ^a   Bulitko, Vadim ^b  

^a JO EF STEFAN INSTITUTE   (Slovenia)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING; REAL TIME SYSTEMS; THREE DIMENSIONAL COMPUTER GRAPHICS;

COMPUTER GAMES; LOOKAHEAD PATHOLOGIES; REAL-TIME PATH-FINDING;

MOTION PLANNING;

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

References (17)

1. Donald F. Beal. An analysis of minimax. In M. R. B. Clarke, editor, Advances in Computer Chess, volume 2, pages 103-109, Edinburgh, UK, 1980. Edinburgh University Press.
2. Ivan Bratko and Matjaž Gams. Error analysis of the minimax principle. In M. R. B. Clarke, editor, Adv. in Computer Chess, volume 3, pages 1-15, Oxford, UK, 1982. Pergamon Press.
3. Vadim Bulitko and Greg Lee. Learning in real time search: A unifying framework. JAIR, 25:119-157, 2006.
4. Vadim Bulitko, Lihong Li, Russell Greiner, and Ilya Levner. Lookahead pathologies for single agent search. In Proceedings of IJCAI, poster section, pages 1531-1533, Acapulco, Mexico, 2003.
5. Vadim Bulitko, Nathan Sturtevant, and Maryia Kazakevich. Speeding up learning in real-time search via automatic state abstraction. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 1349-1354, Pittsburgh, Pennsylvania, 2005.
6. Vadim Bulitko. Lookahead pathologies and meta-level control in real-time heuristic search. In Proceedings of the 15th Euromicro Conference on Real-Time Systems, pages 13-16, Porto, Portugal, 2003.
7. Carlos Hernández and Pedro Meseguer. LRTA*(k). In Proceedings of IJCAI, pages 1238-1243, Edinburgh, UK, 2005.
8. Sven Koenig. A comparison of fast search methods for real-time situated agents. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2, pages 864-871, 2004.
9. Richard E. Korf. Real-time heuristic search. Artificial Intelligence, 42(2, 3):189-211, 1990.
10. Mitja Luštrek, Ivan Bratko, and Matjaž Gams. Why minimax works: An alternative explanation. In Proceedings of IJCAI, pages 212-217, Edinburgh, UK, 2005.
11. Mitja Luštrek. Pathology in single-agent search. In Proceedings of Information Society Conference, pages 345-348, Ljubljana, Slovenia, 2005.
12. Dana S. Nau. Quality of Decision versus Depth of Search on Game Trees. PhD thesis, Duke U., 1979.
13. Dana S. Nau. An investigation of the causes of pathology in games. Artificial Itelligence, 19(3):257-278, 1982.
14. Judea Pearl. On the nature of pathology in game searching. Artificial Intelligence, 20(4):427-453, 1983.
15. Dave C. Pottinger. Terrain analysis in realtime strategy games. In Proceedings of Computer Game Developers Conference, 2000.
16. Anton Scheucher and Hermann Kaindl. Benefits of using multivalued functions for minimaxing. AIJ, 99(2): 187-208, 1998.
17. L.-Y. Shue, S.-T. Li, and R. Zamani. An intelligent heuristic algorithm for project scheduling problems. In Proceedings of the 32nd Annual Meeting of the Decision Sciences Institute, San Francisco, 2001.