| Abstract: |  AI challenge is an international AI programming contest. The latest challenge (fall 2011),
called Ants, was about searching food and enemies in two dimensional space, gathering food
and destroying enemies by controlling large amount of units (ants).
This thesis describes
several algorithms that can be used in this domain, such as A* search, potential elds,
DCOP solvers, Minimax. It proposes solution for optimizing assignments based on distance,
covering and exploring area using multiple agents and for dealing with combat situations.
Some of described algorithms were used by my player implemented for the tournament
where appeared advantages and disadvantages of used potential elds thanks to the variance
of the map set.
|
|---|