Automated Team Assembly in Mobile Games: A Data-Driven Evolutionary Approach Using a Deep Learning Surrogate

被引:5
作者
Gong, Yue-Jiao [1 ]
Guo, Jian-Xiong [2 ]
Lin, Da-Lue [1 ]
Zuo, Yuan-Lin [1 ]
Liang, Jun-Chao [1 ]
Luo, Lin-Jun [1 ]
Shao, Xian-Xin [1 ]
Zhou, Chao [2 ]
Li, Meng-Ting [2 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
[2] Guangzhou Lingxi Interact Entertainment Ltd, Guangzhou 510335, Peoples R China
关键词
Automated team assembly (ATA); data-driven evolutionary computation; mobile game; surrogate model; team strength estimation; OPTIMIZATION; ALGORITHMS; MODEL;
D O I
10.1109/TG.2022.3145886
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many mobile games adopt autobattle systems in which the major consideration of players is how to assemble strong teams. The automated team assembly (ATA) becomes a crucial issue from different standpoints, such as assisting the game designers in performing balance analysis and directing the players to configure teams. Since the ATA is generally a combinatorial optimization problem, this article exploits the evolutionary optimizers. However, unlike the traditional problems that the evaluation functions are explicit, in the ATA, we are unable to evaluate the team strengths straightforwardly. To address this issue, we collect data from the server and build an end-to-end deep learning surrogate for estimating the team strengths. The model has a three-layer architecture of a feature embedding layer, a sequential relation layer, and a regression layer, which is able to characterize the complex dependencies between the sparse input features and the team strengths. The evolutionary algorithms are then guided by the constructed surrogate to seek for the strongest teams. Several adjustments are also made on the evolutionary algorithms to adapt it to the ATA problem with multiple constraints. Simulations on the game Romance of the Three Kingdoms: Strategy Edition validate a good performance of the proposed data-driven evolutionary optimizers.
引用
收藏
页码:67 / 80
页数:14
相关论文
共 43 条
[11]   Ant colony optimization -: Artificial ants as a computational intelligence technique [J].
Dorigo, Marco ;
Birattari, Mauro ;
Stuetzle, Thomas .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (04) :28-39
[12]  
Fogel DB, 2006, EVOLUTIONARY COMPUTATION: TOWARD A NEW PHILOSOPHY OF MACHINE INTELLIGENCE, 3RD EDITION, P1, DOI 10.1002/0471749214
[13]   GENETIC ALGORITHMS - PRINCIPLES OF NATURAL-SELECTION APPLIED TO COMPUTATION [J].
FORREST, S .
SCIENCE, 1993, 261 (5123) :872-878
[14]  
García-Sánchez P, 2016, IEEE CONF COMPU INTE
[15]  
Goldberg D.E., 2014, P 1 INT C GEN ALG TH, P154, DOI DOI 10.4324/9781315799674
[16]   Genetic Learning Particle Swarm Optimization [J].
Gong, Yue-Jiao ;
Li, Jing-Jing ;
Zhou, Yicong ;
Li, Yun ;
Chung, Henry Shu-Hung ;
Shi, Yu-Hui ;
Zhang, Jun .
IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (10) :2277-2290
[17]  
Hochreiter S, 1997, NEURAL COMPUT, V9, P1735, DOI [10.1162/neco.1997.9.1.1, 10.1007/978-3-642-24797-2]
[18]   A Niching Memetic Algorithm for Multi-Solution Traveling Salesman Problem [J].
Huang, Ting ;
Gong, Yue-Jiao ;
Kwong, Sam ;
Wang, Hua ;
Zhang, Jun .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (03) :508-522
[19]  
Hüsken M, 2005, SOFT COMPUT, V9, P21, DOI 10.1007/S00500-003-0330-7
[20]  
Jiayu Xu, 2020, 2020 IEEE 6th International Conference on Computer and Communications (ICCC), P2300, DOI 10.1109/ICCC51575.2020.9345074