Multi-Agent Planning with Baseline Regret Minimization

, ,

We propose a novel baseline regret minimization algorithm for multi-agent planning problems modeled as finite-horizon decentralized POMDPs. It guarantees to produce a policy that is provably at least as good as a given baseline policy. We also propose an iterative belief generation algorithm to efficiently minimize the baseline regret, which only requires necessary iterations so as to converge to the policy with minimum baseline regret. Experimental results on common benchmark problems confirm the benefits of the algorithm compared with the state-of-the-art approaches.

» Read on
 address = {Melbourne, Australia},
 author = {Feng Wu and Shlomo Zilberstein and Xiaoping Chen},
 booktitle = {Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI)},
 doi = {10.24963/ijcai.2017/63},
 month = {August},
 pages = {444-450},
 title = {Multi-Agent Planning with Baseline Regret Minimization},
 year = {2017}