This package implements the Monte Carlo Tree Search (MCTS) planning algorithm for Multi-Agent MDPs. The algorithm factorizes the true action value function, based on the locality of interactions between agents that is encoded with a Coordination Graph. We implement two schemes for coordinating the actions for the team of agents during the MCTS computations. The first is the iterative message-passing MaxPlus, while the second is the exact Variable Elimination. We thus get two different Factored Value MCTS algorithms, FV-MCTS-MaxPlus and FV-MCTS-VarEl respectively.
The full FV-MCTS-MaxPlus algorithm is described in our AAMAS 2021 paper Scalable Anytime Planning for Multi-Agent MDPs (Arxiv). The FV-MCTS-Varel is based on the Factored Statistics algorithm from the AAAI 2015 paper Scalable Planning and Learning from Multi-Agent POMDPs (Extended Version) applied to Multi-Agent MDPs rather than POMDPs. We use the latter as a baseline and show how the former outperforms it on two distinct simulated domains.
To use our solver, the domain must implement the interface from MultiAgentPOMDPs.jl. For examples, please see MultiAgentSysAdmin and MultiUAVDelivery, which are the two domains from our AAMAS 2021 paper. Experiments from the paper are available at https://github.com/rejuvyesh/FVMCTS_experiments.
In the Julia REPL, just do:
] add FactoredValueMCTS