The Real-Time Strategy Game Multi-Objective Build Order Problem

Authors

  • Jason Blackford Air Force Institute of Technology
  • Gary Lamont Air Force Institute of Technology

DOI:

https://doi.org/10.1609/aiide.v10i1.12720

Keywords:

multi-objective, evolutionary algorithms, build order, real-time strategy

Abstract

In this paper we examine the build order problem in real-time strategy (RTS) games in which the objective is to optimize execution of a strategy by scheduling actions with respect to a set of subgoals. We model the build order problem as a multi-objective problem (MOP), and solutions are generated utilizing a multi-objective evolutionary algorithm (MOEA). A three dimensional solution space is presented providing a depiction of a Pareto front for the build order MOP. Results of the online strategic planning tool are provided which demonstrate that our planner out-performs an expert scripted player. This is demonstrated for an AI agent in the Spring Engine Balanced Annihilation RTS game.

Downloads

Published

2021-06-29

How to Cite

Blackford, J., & Lamont, G. (2021). The Real-Time Strategy Game Multi-Objective Build Order Problem. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 10(1), 105-111. https://doi.org/10.1609/aiide.v10i1.12720