Agent-based sensor coalition formation

Large numbers of heterogeneous sensors the collect and fuse information in dynamic environments are envisioned in domains, such as military operations, disaster response or border surveillance. Depending on the dynamically evolving needs, operators will submit to groups of these sensors information acquisition and fusion goals that must be fulfilled within time constraints. To fulfill these goals, the sensors must autonomously and dynamically form coalitions. The problem that this paper addresses is the dynamic coalition formation problem and the evolving performance of coalitions over time. Coalition formation is an NP complete problem. One of the ways to mitigate the computational cost is to constrain the decentralized coalition formation problem by taking into consideration the underlying network structure. Has showed (a) that the network topology has a significant effect on the quality of the formed coalitions and their performance, and (b) that it is possible to develop agents that intelligently adapt the network structure to increase the ability of the organization to form good quality coalitions. However, that work used unrealistically simple coalitional models and did not perform an analysis of the network topologies and adaptation policies that could result. In this paper we make three contributions. First we present an analysis and results on the underlying network topologies that are formed. Second, we develop and analyze a more realistic coalition formation model. Third we present two new network adaptation policies. Experimental evaluation of our contributions are presented.

[1]  Sarit Kraus,et al.  Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents * , 1996 .

[2]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[3]  César A. Hidalgo,et al.  Scale-free networks , 2008, Scholarpedia.

[4]  Esther M. Arkin,et al.  On Local Search for Weighted k-Set Packing , 1998, Math. Oper. Res..

[5]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[6]  Somesh Jha,et al.  Multi-Agent Coordination through Coalition Formation , 1997, ATAL.

[7]  Victor R. Lesser,et al.  Coalition Formation among Bounded Rational Agents , 1995, IJCAI.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Katia P. Sycara,et al.  Mechanisms for coalition formation and cost sharing in an electronic marketplace , 2003, ICEC '03.

[10]  Katia P. Sycara,et al.  A stable and efficient buyer coalition formation scheme for e-marketplaces , 2001, AGENTS '01.

[11]  Yang Xu,et al.  An integrated token-based algorithm for scalable coordination , 2005, AAMAS '05.

[12]  H. Moulin Cooperative Microeconomics: A Game-Theoretic Introduction , 1995 .

[13]  Marie desJardins,et al.  Agent-organized networks for dynamic team formation , 2005, AAMAS '05.

[14]  Paul Scerri,et al.  A POMDP Approach to Token-Based Team Coordination , 2005 .

[15]  Katia P. Sycara,et al.  Algorithm for combinatorial coalition formation and payoff division in an electronic marketplace , 2002, AAMAS '02.