Discovering optimal strategy in tactical combat scenarios through the evolution of behaviour trees

Author:

Masek MartinORCID,Lam Chiou Peng,Kelly Luke,Wong Martin

Abstract

AbstractIn this paper we address the problem of automatically discovering optimal tactics in a combat scenario in which two opposing sides control a number of fighting units. Our approach is based on the evolution of behaviour trees, combined with simulation-based evaluation of solutions to drive the evolution. Our behaviour trees use a small set of possible actions that can be assigned to a combat unit, along with standard behaviour tree constructs and a novel approach for selecting which action from the tree is performed. A set of test scenarios was designed for which an optimal strategy is known from the literature. These scenarios were used to explore and evaluate our approach. The results indicate that it is possible, from the small set of possible unit actions, for a complex strategy to emerge through evolution. Combat units with different capabilities were observed exhibiting coordinated team work and exploiting aspects of the environment.

Funder

Defence Science and Technology Group

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Reference26 articles.

1. Baker, J. E. (1987). Reducing bias and inefficiency in the selection algorithm. In Proceedings of the second international conference on genetic algorithms (Vol. 206, pp. 14–21).

2. Berthling-Hansen, G., Morch, E., Løvlid, R. A., & Gundersen, O. E. (2018). Automating behaviour tree generation for simulating troop movements (poster). In 2018 IEEE conference on cognitive and computational aspects of situation management (CogSIMA) (pp. 147–153). IEEE. https://doi.org/10.1109/COGSIMA.2018.8423978.

3. Bowden, F. D., Pincombe, B. M., & Williams, P. B. (2015). Feasible scenario spaces: A new way of measuring capability impacts. MODSIM2015, 836–842.

4. Courtney, H., Kirkland, J., & Viguerie, P. (1997). Strategy under uncertainty. Harvard Business Review, 75(6), 67–79.

5. Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In International conference on parallel problem solving from nature (pp. 849–858). Springer, Berlin, Heidelberg.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3