Scalable Online Planning for Multi-Agent MDPs
Citations Over Time
Abstract
We present a scalable tree search planning algorithm for large multi-agent sequential decision problems that require dynamic collaboration. Teams of agents need to coordinate decisions in many domains, but naive approaches fail due to the exponential growth of the joint action space with the number of agents. We circumvent this complexity through an approach that allows us to trade computation for approximation quality and dynamically coordinate actions. Our algorithm comprises three elements: online planning with Monte Carlo Tree Search (MCTS), factored representations of local agent interactions with coordination graphs, and the iterative Max-Plus method for joint action selection. We evaluate our approach on the benchmark SysAdmin domain with static coordination graphs and achieve comparable performance with much lower computation cost than our MCTS baselines. We also introduce a multi-drone delivery domain with dynamic coordination graphs, and demonstrate how our approach scales to large problems on this domain that are intractable for other MCTS methods. We provide an open-source implementation of our algorithm at https://github.com/JuliaPOMDP/FactoredValueMCTS.jl.
Related Papers
- A Dynamic Scalable Asynchronous Message Model Based on Distributed Objects(2002)
- → DARDIS: Distributed And Randomized DIspatching and Scheduling(2016)1 cited
- → Optimizing the NAS parallel BT application for the POWER CHALLENGEarray(1996)
- High Scalable Load Balancing Middleware for the Distributed Simulation Applications(2009)
- Agent-based Distributed Computing Environment ABDE(2001)