Using the max-plus algorithm for multiagent decision making in coordination graphs: extended abstract

Jelle R. Kok and Nikos Vlassis. Using the max-plus algorithm for multiagent decision making in coordination graphs: extended abstract. In Proc. of the 17th Belgian-Dutch Conference on Artifical Intelligence, pp. 359–360, Brussels, Belgium, October 2005.

Download

pdf [75.6kB]  ps.gz [107.1kB]  

Abstract

Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each agent can in principle select an optimal individual action based on a variable elimination algorithm performed on this graph. This results in optimal behavior for the group, but its worst-case time complexity is exponential in the number of agents, and it can be slow in densely connected graphs. Moreover, variable elimination is not appropriate for real-time systems as it requires that the complete algorithm terminates before a solution can be reported. In this paper, we investigate the max-plus algorithm, an instance of the belief propagation algorithm in Bayesian networks, as an approximate alternative to variable elimination. In this method the agents exchange appropriate payoff messages over the coordination graph, and based on these messages compute their individual actions. We provide empirical evidence that this method converges to the optimal solution for tree-structured graphs (as shown by theory), and that it finds near optimal solutions in graphs with cycles, while being much faster than variable elimination.

BibTeX Entry

@InProceedings{Kok05bnaic,
  author =       {Jelle R. Kok and Nikos Vlassis},
  title =        {Using the max-plus algorithm for multiagent decision
                  making in coordination graphs: extended abstract},
  booktitle =    {Proc.\ of the 17th Belgian-Dutch Conference on
                  Artifical Intelligence},
  address =      {Brussels, Belgium},
  year =         2005,
  month =        oct,
  pages =        {359-360},
  editor =       {K. Verbeeck and K. Tuyls and A. Now\'e and
                  B. Manderick and B. Kuijpers},
  postscript =   {2005/Kok05bnaic.ps.gz},
  pdf =          {2005/Kok05bnaic.pdf},
  abstract =     { Coordination graphs offer a tractable framework for
                  cooperative multiagent decision making by
                  decomposing the global payoff function into a sum of
                  local terms. Each agent can in principle select an
                  optimal individual action based on a variable
                  elimination algorithm performed on this graph. This
                  results in optimal behavior for the group, but its
                  worst-case time complexity is exponential in the
                  number of agents, and it can be slow in densely
                  connected graphs. Moreover, variable elimination is
                  not appropriate for real-time systems as it requires
                  that the complete algorithm terminates before a
                  solution can be reported. In this paper, we
                  investigate the max-plus algorithm, an instance of
                  the belief propagation algorithm in Bayesian
                  networks, as an approximate alternative to variable
                  elimination. In this method the agents exchange
                  appropriate payoff messages over the coordination
                  graph, and based on these messages compute their
                  individual actions. We provide empirical evidence
                  that this method converges to the optimal solution
                  for tree-structured graphs (as shown by theory), and
                  that it finds near optimal solutions in graphs with
                  cycles, while being much faster than variable
                  elimination.}
}

---

Generated by bib2html.pl (written by Patrick Riley) on Tue Oct 31, 2006 19:33:42 UTC