Effective and Diverse Adaptive Game AI

被引:11
作者
Szita, Istvan [1 ,2 ]
Ponsen, Marc [1 ]
Spronck, Pieter [3 ,4 ]
机构
[1] Maastricht Univ, Dept Knowledge Engn, NL-6200 MD Maastricht, Netherlands
[2] Univ Alberta, Edmonton, AB T6G 2R3, Canada
[3] Tilburg Univ, Tilburg Ctr Creat Comp TiCC, NL-5000 LE Tilburg, Netherlands
[4] Dutch Open Univ, NL-6401 DL Heerlen, Netherlands
关键词
AI; cross-entropy method (CEM); dynamic scripting; game; reinforcement learning; ADAPTATION;
D O I
10.1109/TCIAIG.2009.2018706
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Adaptive techniques tend to converge to a single optimum. For adaptive game AI, such convergence is often undesirable, as repetitive game AI is considered to be uninteresting for players. In this paper, we propose a method for automatically learning diverse but effective macros that can be used as components of adaptive game AI scripts. Macros are learned by a cross-entropy method (CEM). This is a selection-based optimization method that, in our experiments, maximizes an interestingness measure. We demonstrate the approach in a computer role-playing game (CRPG) simulation with two duelling wizards, one of which is controlled by an adaptive game AI technique called "dynamic scripting." Our results show that the macros that we learned manage to increase both adaptivity and diversity of the scripts generated by dynamic scripting, while retaining playing strength.
引用
收藏
页码:16 / 27
页数:12
相关论文
共 41 条
  • [1] Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
    Alon, G
    Kroese, DP
    Raviv, T
    Rubinstein, RY
    [J]. ANNALS OF OPERATIONS RESEARCH, 2005, 134 (01) : 137 - 151
  • [2] [Anonymous], 1994, POPULATION BASED INC, DOI 10.1007/978-3-540-70706-6_21
  • [3] [Anonymous], 2006, REINFORCEMENT LEARNI
  • [4] [Anonymous], 2004, PROC C INTELLIGENT A
  • [5] Evolution strategies – A comprehensive introduction
    Hans-Georg Beyer
    Hans-Paul Schwefel
    [J]. Natural Computing, 2002, 1 (1) : 3 - 52
  • [6] Barto AG, 2003, DISCRETE EVENT DYN S, V13, P343
  • [7] BROCKINGTON M, 2002, AI GAME PROGRAMMING, P548
  • [8] BULL L, 2005, FDN LEARNING CLASSIF, P3
  • [9] Convergence properties of the cross-entropy method for discrete optimization
    Costa, Andre
    Jones, Owen Dafydd
    Kroese, Dirk
    [J]. OPERATIONS RESEARCH LETTERS, 2007, 35 (05) : 573 - 580
  • [10] Cross-entropic learning of a machine for the decision in a partially observable universe
    Dambreville, Frederic
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2007, 37 (04) : 541 - 555