ABSTRACT
Complex adversarial operations typically involve the allocation of finite resources to meet a set of objectives over a number of phases. This poses a challenge for AI-based strategy discovery. A strategy for one phase cannot be developed in isolation as the resources available in any one phase are dependent on the outcome of previous phases. Our proposed solution is to combine an evolutionary algorithm search with human-guided evaluation. The approach uses simulation-based fitness evaluation, where a human operator can view the fittest solution after every set number of generations. The operator can 'lock in' strategies for particular phases, and 'suggest' alternative strategies to guide further evolution. Key to our approach is a representation encoding that allows relative proportions of resources to be represented where actual levels may not be known a priori. We evaluate our solution on a three-phase scenario of a real-time strategy game and compare the effectiveness of strategies that were purely human-devised, purely evolved, and those resulting from the human-evolution collaboration. The collaborative approach shows promising results in being able to find an optimum solution earlier.
- Goldberg, D. E., & Deb, K. 1991. A comparative analysis of selection schemes used in genetic algorithms. In Foundations of genetic algorithms (Vol. 1, pp. 69--93). Elsevier.Google Scholar
- Holland, J. H. 1992. Genetic algorithms. Scientific american, 267(1), 66--73.Google Scholar
- Louis, S. J., & McDonnell, J. 2004. Learning with case-injected genetic algorithms. IEEE Transactions on Evolutionary Computation, 8(4), 316--328.Google ScholarDigital Library
- Ontañón, S. 2013. The Combinatorial Multi-Armed Bandit Problem and its Application to Real-Time Strategy Games, In AIIDE 2013. pp. 58--64.Google Scholar
- Takagi, H. 2001. Interactive evolutionary computation: Fusion of the capabilities of EC optimization and human evaluation. Proceedings of the IEEE, 89(9), 1275--1296.Google ScholarCross Ref
Index Terms
- Interactive Evolutionary Computation for Strategy Discovery in Multi-Phase Operations
Recommendations
Co-Evolutionary Algorithms Based on Mixed Strategy
Inspired by evolutionary game theory, this paper modifies previous mixed strategy framework, adding a new mutation operator and extending to crossover operation, and proposes co-evolutionary algorithms based on mixed crossover and/or mutation strategy. ...
Evolutionary multi-objective optimization algorithm based on global crowding diversity maintenance strategy
GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary ComputationThis paper presents an improved multi-objective evolutionary algorithm based on global crowding diversity maintenance strategy and diversity initialization population strategy. In selection process, the global crowding strategy is applied to be a part ...
A data-driven evolutionary algorithm with multi-evolutionary sampling strategy for expensive optimization
AbstractSurrogate-assisted evolutionary algorithms, which combine the powerful searching ability of evolutionary algorithms (EAs) with the predictive ability of surrogate models, are effective to solve expensive optimization problems. In this ...
Highlights- A multi-evolutionary sampling strategies algorithm is proposed.
- The database ...
Comments