Change search
ReferencesLink to record
Permanent link

Direct link
Potential-Field Based navigation in in StarCraft
Blekinge Institute of Technology, School of Computing.
2012 (English)Conference paper (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Granada, 2012.
Keyword [en]
potential fields, starcraft, pathfinding, agents, navigation
National Category
Computer Science
URN: urn:nbn:se:bth-7111Local ID: diva2:834692
Computational Intelligence in Games (CIG)
Available from: 2012-12-10 Created: 2012-12-05 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(1332 kB)41 downloads
File information
File name FULLTEXT01.pdfFile size 1332 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computing
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 41 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 35 hits
ReferencesLink to record
Permanent link

Direct link