Abstract
Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation (Conte et al., 1991; Rosenschein, 1986), negotiation (Kraus and Wilkenfeld, 1991), distributed planning (Conry et al., 1988), and coalition formation (Ketchpel, 1994; Sandholm and Lesser, 1997), have provided a variety of approaches and several algorithms and solutions to situations wherein cooperation is possible. However, the case of cooperation in large-scale multi-agent systems (MAS) has not been thoroughly examined. Therefore, in this paper we present a framework for cooperative goal-satisfaction in large-scale environments focusing on a low-complexity physics-oriented approach. The multi-agent systems with which we deal are modeled by a physics-oriented model. According to the model, MAS inherit physical properties, and therefore the evolution of the computational systems is similar to the evolution of physical systems. To enable implementation of the model, we provide a detailed algorithm to be used by a single agent within the system. The model and the algorithm are appropriate for large-scale, dynamic, Distributed Problem Solver systems, in which agents try to increase the benefits of the whole system. The complexity is very low, and in some specific cases it is proved to be optimal. The analysis and assessment of the algorithm are performed via the well-known behavior and properties of the modeling physical system.
Original language | English |
---|---|
Pages (from-to) | 1-55 |
Number of pages | 55 |
Journal | Artificial Intelligence |
Volume | 110 |
Issue number | 1 |
DOIs | |
State | Published - May 1999 |
Bibliographical note
Funding Information:I This material is based upon work supported by NSF grant No. IRI-9423967, ARPA/Rome Labs contract F30602-93-C-0241 and the Army Research Lab contract No. DAAL0197K0135. Preliminary results of this research appear in the proceedings of ECAI-96 and ATAL-98. ∗Corresponding author. Email: [email protected].
Funding
I This material is based upon work supported by NSF grant No. IRI-9423967, ARPA/Rome Labs contract F30602-93-C-0241 and the Army Research Lab contract No. DAAL0197K0135. Preliminary results of this research appear in the proceedings of ECAI-96 and ATAL-98. ∗Corresponding author. Email: [email protected].
Funders | Funder number |
---|---|
ARPA/Rome Labs | F30602-93-C-0241 |
Army Research Lab | |
National Science Foundation | IRI-9423967 |
Directorate for Computer and Information Science and Engineering | 9423967 |