Software:Pommerman Challenge
The Pommerman Challenge is a multi-agent game to test autonomous artificial intelligence systems.[1]
Game structure
Two-agent team compete against each other on an 11 x 11 board. Each agent can observe only part of the board, and the agents cannot communicate. The goal is to knock down the opponents. Agents place explosives to destroy walls and collect power-ups that appear from those walls, while avoiding death. Game objects can move unpredictably or be moved by an agent.[1]
Play
The game involves real-time decision making. Agents must choose moves in about .1 seconds.[1]
Algorithms
The real-time requirement limits the use of compute-heavy techniques such as Monte Carlo tree search. The branching factor at each move can be as large as 1,296, because all four agents act in each step, choosing among six possibilities. The agents choose by accounting for explosions, which have lifetimes of 10 steps. Explosions derail tree search techniques, as searchews with less than 10 levels ignore explosions while deeper searches consider too many choices (given the branching factor).[1]
A hybrid approach uses a limited-depth tree search followed by exploring a deterministic/pessimistic scenario. Limiting the depth keeps the search tree small. The deterministic approach can predict far in the future, by omitting branching. "Good" actions are often those that perform well under pessimistic scenarios, particularly if safety is important. Identifying the worst sequence of positions for an object can suggest where to move it.
After generating pessimistic scenarios, the agent quantifies the survivability of each move, notionally the number of positions in which the agent can then remain safely (without encountering other agents).
Competitions
3 competitions were organized with slightly changing rules during 2018–2019.
Online - FFA
This round was a warm-up online event, where each competitor controlled only one agent. Results:[2]
- 1st: Agent47Agent by Yichen Gong
- 2nd: aiKiller by Márton Görög
NeurIPS 2018 - Team
The first Pommerman competition with in-person finals. Results:[2]
- 1st: hakozakijunctions by Toshihiro Takahashi
- 2nd: eisenach by Márton Görög
- 3rd: dypm by Takayuki Osogami
The 3 best performing solutions used online tree search.
NeurIPS 2019 - Team Radio
The second competition with in-person finals improved communication between teammate agents. Results:[3]
- 1st: Márton Görög
- 2nd: Paul Jasek
- 3rd: Yifan Zhang
References
- ↑ 1.0 1.1 1.2 1.3 Rodriguez, Jesus (2019-03-18). "This New Technique Helps Build Autonomous, Self-Learning AI Agents that Passed the Pommerman…". https://towardsdatascience.com/this-new-technique-helps-build-autonomous-self-learning-ai-agents-that-passed-the-pommerman-458f93390978.
- ↑ 2.0 2.1 Official page of Pommerman announces results of 2018. Official site of Pommerman
- ↑ Pommerman Twitter channel announces results of 2019. Pommerman Twitter channel
External links
- PlayGround: AI Research into Multi-Agent Learning.: MultiAgentLearning/playground, MultiAgentLearning, 2019-05-24, https://github.com/MultiAgentLearning/playground, retrieved 2019-05-25
- "Discord - Free voice and text chat for gamers". https://discordapp.com/channels/406046782091689985/406046782091689987.
- Pommerman Challenge on Twitter
 |  |
