Results 1 
4 of
4
Maximal Clique Based Distributed Group Formation for Autonomous Agent Coalitions
 In Coalitions and Teams Workshop (W10), 3rd Int’l Joint Conf. on Agents and Multi Agent Systems
, 2004
"... We present herein a fully distributed algorithm for group or coalition formation among autonomous agents. The algorithm is based on a distributed computation of maximal cliques (of up to prespecified size) in the underlying graph that captures the interconnection topology of the agents. Hence ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
(Show Context)
We present herein a fully distributed algorithm for group or coalition formation among autonomous agents. The algorithm is based on a distributed computation of maximal cliques (of up to prespecified size) in the underlying graph that captures the interconnection topology of the agents. Hence, given the current configuration of the agents, the groups that are formed are characterized by a high degree of connectivity, and therefore high fault tolerance with respect to node and link failures. We also briefly discuss how our basic algorithm can be adapted in various ways so that the formed groups satisfy the requirements ("goodness" criteria) other than mere strong intergroup communication connectivity. We envision various variants of our basic algorithm to prove themselves useful subroutines in many multiagent system and ad hoc network applications where the agents may repeatedly need to form temporary groups or coalitions in an e#cient, fully distributed and online manner.
Maximal Clique Based Distributed Coalition Formation for Task Allocation in LargeScale Multiagent Systems
, 2004
"... We present a fully distributed algorithm for coalition formation among autonomous agents. The algorithm is based on two main ideas. One is a distributed computation of maximal cliques (of bounded sizes) in the underlying graph that captures the interconnection communication topology of the agents. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a fully distributed algorithm for coalition formation among autonomous agents. The algorithm is based on two main ideas. One is a distributed computation of maximal cliques (of bounded sizes) in the underlying graph that captures the interconnection communication topology of the agents. Hence, given the current configuration of the agents, the coalitions that are formed are characterized by a high degree of connectivity, and therefore a high fault tolerance with respect to the subsequent node and/or link failures. The second idea is that each agent chooses its most preferable coalition based on how highly the agent values each such coalition in terms of the coalition members ’ combined resources or capabilities. Coalitions with sufficient resources for fulfilling highly desirable tasks are preferable to the coalitions with resources that suffice only for completing less valuable tasks. We envision variants of our distributed algorithm presented herein to prove themselves useful coordination subroutines in many massively multiagent system applications where the agents may repeatedly need to form temporary groups or coalitions of modest sizes in an efficient, online and fully distributed manner.
Modeling and Analysis of the Collective Dynamics of LargeScale MultiAgent Systems: A Cellular and Network Automata based Approach
, 2006
"... This technical report addresses a particular approach to modeling and analysis of the behavior of largescale multiagent systems. A broad variety of multiagent systems are modeled as appropriate variants of cellular and network automata. Several fundamental properties of the collective dynamics of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This technical report addresses a particular approach to modeling and analysis of the behavior of largescale multiagent systems. A broad variety of multiagent systems are modeled as appropriate variants of cellular and network automata. Several fundamental properties of the collective dynamics of those cellular and network automata are then formally analyzed. Various loosely coupled largescale distributed information systems are of an increasing interest in a variety of areas of computer science and its applications – areas as diverse as team robotics, intelligent transportation systems, open distributed software environments, disaster response management, distributed databases and information retrieval, and computational theories of language evolution. A popular paradigm for abstracting such distributed infrastructures is that of multiagent systems (MAS) made of typically a large number of autonomous agents that locally interact with each other. This report is an attempt at a cellular and network automata based mathematical and computational theory of such MAS. The