Using Lanchester Attrition Laws for Combat Prediction in StarCraft.

作者: Michael Buro , Nicolas A. Barriga , Marius Adrian Stanescu

DOI:

关键词:

摘要: Smart decision making at the tactical level is important for Artificial Intelligence (AI) agents to perform well in domain of real-time strategy (RTS) games. Winning battles crucial RTS games, and while ahumans can decide when how attack based on their experience, it challenging AI estimate combat outcomes accurately. A few existing models address this problem game StarCraft but present many restrictions, such as not modeling injured units, supporting only a small number unit types, or being able predict winner fight remaining army. Prediction using simulations popular method, generally slow requires extensive coding model engine This paper introduces Lanchester’s attrition laws which addresses mentioned limitations faster than running simulations. Unit strength values are learned maximum likelihood estimation from past recorded battles. We experiments that use simulator generating both training testing, show capable accurate predictions. Furthermore, we implemented our method bot uses either traditional retreat. tournament results (against top bots 2014 AIIDE competition) comparing performances two versions, increased winning percentages method.

参考文章(10)
Frederick William Lanchester, Aircraft in Warfare: The Dawn of the Fourth Arm ,(1996)
Alexander Kovarsky, Michael Buro, Heuristic search applied to abstract combat games Lecture Notes in Computer Science. pp. 66- 78 ,(2005) , 10.1007/11424918_9
Abdallah Saffidine, Michael Buro, David Churchill, Fast heuristic search for RTS game combat scenarios national conference on artificial intelligence. pp. 112- 117 ,(2012)
Michael Buro, Marius Stanescu, Sergio Poo Hernandez, Graham Erickson, Russel Greiner, Predicting army combat outcomes in StarCraft national conference on artificial intelligence. pp. 86- 92 ,(2013)
Harald Köstler, Björn Gmeiner, A Multi-objective Genetic Algorithm for Build Order Optimization in StarCraft II Künstliche Intelligenz. ,vol. 27, pp. 221- 233 ,(2013) , 10.1007/S13218-013-0263-2
Alberto Uriarte, Santiago Ontañón, Game-tree search over high-level game states in RTS games national conference on artificial intelligence. pp. 73- 79 ,(2014)
Michael Buro, David Churchill, Incorporating Search Algorithms into RTS Game Agents ,(2012)
Michael Buro, Nicolas A. Barriga, Marius Stanescu, Hierarchical adversarial search applied to Real-Time Strategy games national conference on artificial intelligence. pp. 66- 72 ,(2014)
Michael Buro, Nicolas A. Barriga, Marius Stanescu, Introducing hierarchical adversarial search, a scalable search procedure for real-time strategy games european conference on artificial intelligence. pp. 1099- 1100 ,(2014) , 10.3233/978-1-61499-419-0-1099