Potential-Field Based navigation in in StarCraft

Document type: Conference Papers
Peer reviewed: Yes
Full text:
Author(s): Johan Hagelbäck
Title: Potential-Field Based navigation in in StarCraft
Conference name: Computational Intelligence in Games (CIG)
Year: 2012
Pagination: 388-393
City: Granada
Organization: Blekinge Institute of Technology
Department: School of Computing (Sektionen för datavetenskap och kommunikation)
School of Computing S-371 79 Karlskrona
+46 455 38 50 00
http://www.bth.se/com
Authors e-mail: johan.hagelback@bth.se
Language: English
Abstract: Real-Time Strategy (RTS) games are a sub-genre of strategy games typically taking place in a war setting. RTS games provide a rich challenge for both human- and computer players (bots). Each player has a number of workers for gathering resources to be able to construct new buildings, train additional workers, build combat units and do research to unlock more powerful units or abilities. The goal is to create a strong army and destroy the bases of the opponent(s). Armies usually consists of a large number of units which must be able to navigate around the game world. The highly dynamic and real time aspects of RTS games make pathfinding a challenging task for bots. Typically it is handled using pathfinding algorithms such as A*, which without adaptions does not cope very well with dynamic worlds. In this paper we show how a bot for StarCraft uses a combination of A* and potential fields to better handle the dynamic aspects of the game.
Subject: Digital Game Development\General
Computer Science\Artificial Intelligence
Keywords: potential fields, starcraft, pathfinding, agents, navigation
Edit