The event is going on:
PhD: Multi-Agent Potential Field Based Architec...
Doctoral student Johan Hagelbäck will defend his doctoral thesis in Computer Science.
Time: 11 January 2012 at 13:15
Place: Room J1610, BTH, Campus Gräsvik, Karlskrona
Thesis title: Multi-Agent Potential Field Based Architectures for Real-Time Strategy Game Bots
Research education subject: Computer Science
Principal supervisor: Docent Stefan Johansson, BTH
Assistant supervisor: Professor Craig Lindley, BTH
Faculty examiner: Associate Professor Pieter Spronck, Tilburg University, Holland
- Docent Mathias Broxvall, Örebro University
- Docent Harko Verhagen, Stockholm University
- Professor Tom Ziemke, University of Skövde
Deputy member of examining committee: Dr. Mattias Dahl, BTH
After the defence there will be some refreshments. Please contact Karin Svahnberg no later than 20 December if you plan to participate.
Real-Time Strategy (RTS) is a sub-genre of strategy games which is running in real-time, typically in a war setting. The player uses workers to gather resources, which in turn are used for creating new buildings, training combat units, build upgrades and do research. The game is won when all buildings of the opponent(s) have been destroyed. The numerous tasks that need to be handled in real-time can be very demanding for a player. Computer players (bots) for RTS games face the same challenges, and also have to navigate units in highly dynamic game worlds and deal with other low-level tasks such as attacking enemy units within fire range.
This thesis is a compilation grouped into three parts. The first part deals with navigation in dynamic game worlds which can be a complex and resource demanding task. Typically it is solved by using pathfinding algorithms. We investigate an alternative approach based on Artificial Potential Fields and show how an APF based navigation system can be used without any need of pathfinding algorithms.
In RTS games players usually have a limited visibility of the game world, known as Fog of War. Bots on the other hand often have complete visibility to aid the AI in making better decisions. We show that a Multi-Agent PF based bot with limited visibility can match and even surpass bots with complete visibility in some RTS scenarios. We also show how the bot can be extended and used in a full RTS scenario with base building and unit construction.
In the next section we propose a flexible and expandable RTS game architecture that can be modified at several levels of abstraction to test different techniques and ideas. The proposed architecture is implemented in the famous RTS game StarCraft, and we show how the high-level architecture goals of flexibility and expandability can be achieved.
In the last section we present two studies related to gameplay experience in RTS games. In games players usually have to select a static difficulty level when playing against computer opponents. In the first study we use a bot that during runtime can adapt the difficulty level depending on the skills of the opponent, and study how it affects the perceived enjoyment and variation in playing against the bot.
To create bots that are interesting and challenging for human players a goal is often to create bots that play more human-like. In the second study we asked participants to watch replays of recorded RTS games between bots and human players. The participants were asked to guess and motivate if a player was controlled by a human or a bot. This information was then used to identify human-like and bot-like characteristics for RTS game players.
School of Computing