.png){kind=icon}
.png){kind=icon}
Return
Clustering Allocation for Large-Scale Multi-Agent Systems: A Coalitional Game Method
.png){kind=icon}
OA
AI
DOI：10.3390/electronics15020304.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Motivated by the inefficiencies where multi-agent systems fail to reconcile individual agent self-interest with global optimality and accommodate dynamic tasks as its population increases, this paper investigates a clustering allocation problem for large-scale multi-agent systems. A novel coalitional game clustering allocation scheme that can simultaneously reconcile individual agent self-interest and adapt to dynamic tasks is proposed. In this scheme, a coalition switching strategy is newly constructed and incorporated to select optimal switching operation and obtain stable coalition partition. Simulation and comparative results are provided to verify the effectiveness of the developed allocation scheme. It is shown both theoretically and simulation experimentally that in the case of large-scale multi-agent systems, the generated clustering allocation strategy is Nash stable using the proposed scheme.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
9.6K
Citations:
4.7W