Local coordination in online distributed constraint optimization problems

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In cooperative multi-agent systems, group performance often depends more on the interactions between team members, rather than on the performance of any individual agent. Hence, coordination among agents is essential to optimize the group strategy. One solution which is common in the literature is to let the agents learn in a joint action space. Joint Action Learning (JAL) enables agents to explicitly take into account the actions of other agents, but has the significant drawback that the action space in which the agents must learn scales exponentially in the number of agents. Local coordination is a way for a team to coordinate while keeping communication and computational complexity low. It allows the exploitation of a specific dependency structure underlying the problem, such as tight couplings between specific agents. In this paper we investigate a novel approach to local coordination, in which agents learn this dependency structure, resulting in coordination which is beneficial to the group performance. We evaluate our approach in the context of online distributed constraint optimization problems. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Brys, T., De Hauwere, Y. M., Nowé, A., & Vrancx, P. (2012). Local coordination in online distributed constraint optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7541 LNAI, pp. 31–47). Springer Verlag. https://doi.org/10.1007/978-3-642-34799-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free