The Multi-Agent Programming Contest is held every year to stimulate research in the area of multi-agent systems. Our system mainly exploits four strategies: prior state reasoning, task allocation optimization, dijkstra with recharge and surrounding several stable and valuable zones with shorter boundaries. With these strategies, our team is able to conquer several large zones as early as possible, optimize collaboration, and ensure efficiency. The system was implemented in C++, and in this paper, we will introduce the design and architecture of AiWXX, and discuss the algorithms and implementations for these strategies.
['Chengqian Li', 'Lu Liu']
Prior State Reasoning in Multi-agent Systems and Graph-Theoretical Algorithms