Anytime Algorithms for Multiagent Decision Making Using Coordination Graphs

Reference : Anytime Algorithms for Multiagent Decision Making Using Coordination Graphs


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/11059

Title :	Anytime Algorithms for Multiagent Decision Making Using Coordination Graphs
Language :	English
Author, co-author :	Vlassis, Nikos [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
	Elhorst, R. [> >]
	Kok, J. R. [> >]
Publication date :	2004
Main document title :	Proceedings of the International Conference on Systems, Man and Cybernetics
Publisher :	Institute of Electronics Engineers
Pages :	953-957
Peer reviewed :	No
City :	New York
Country :	NY
Event name :	International Conference on Systems, Man and Cybernetics
Event date :	2004
Abstract :	[en] Coordinationgraphsprovideatractableframe- work for cooperative multiagent decision making by decom- posing the global payoff function into a sum of local terms. In this paper we review some distributed algorithms for ac- tion selection in a coordination graph and discuss their pros and cons. For real-time decision making we emphasize the need for anytime algorithms for action selection: these are algorithms that improve the quality of the solution over time. We describe variable elimination, coordinate ascent, and the max-plus algorithm, the latter being an instance of the be- lief propagation algorithm in Bayesian networks. We discuss some interesting open problems related to the use of the max- plus algorithm in real-time multiagent decision making.
Permalink :	http://hdl.handle.net/10993/11059

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	download.pdf		Author postprint	175.55 kB	View/Open

All documents in ORBi^lu are protected by a user license.