Computer games in general, and Real Time Strategy games in particular is a challenging task for both AI research and game AI programmers. The player, or AI bot, must use its workers to gather resources. They must be spent wisely on structures such as barracks or factories, mobile units such as soldiers, workers and tanks. The constructed units can be used to explore the game world, hunt down the enemy forces and destroy the opponent buildings. We propose a multi-agent architecture based on artificial potential fields for a full real time strategy scenario. We validate the solution by participating in a yearly open real time strategy game tournament and show that the bot, even though not using any form of path planning for navigation, is able to perform well and win the tournament.
[1]
Stefan J. Johansson,et al.
Demonstration of multi-agent potential fields in real-time strategy games
,
2008,
AAMAS.
[2]
Edwin D. de Jong,et al.
Intransitivity in Coevolution
,
2004,
PPSN.
[3]
Rodney A. Brooks,et al.
A Robust Layered Control Syste For A Mobile Robot
,
2022
.
[4]
Stefan J. Johansson,et al.
Using multi-agent potential fields in real-time strategy games
,
2008,
AAMAS.
[5]
Stefan J. Johansson,et al.
The Rise of Potential Fields in Real Time Strategy Bots
,
2008,
AIIDE.
[6]
Christian Bauckhage,et al.
Learning Human-Like Movement Behavior for Computer Games
,
2004
.