Journal
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS
Volume 10, Issue 4, Pages 445-470Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S1469026811003185
Keywords
Probability collectives; multi-agent system; collective intelligence; Nash equilibrium; sociophysics
Categories
Ask authors/readers for more resources
The best option to deal with a complex system that is too cumbersome to be treated in a centralized way is to decompose it into a number of sub-systems and optimize them in a distributed and decentralized way to reach the desired system objective. These sub-systems can be viewed as a multi-agent system (MAS) with self-learning agents. Furthermore, another challenge is to handle the constraints involved in real world optimization problems. This paper demonstrates the theory of probability collectives (PC) in the collective intelligence (COIN) framework, supplemented with a penalty function approach for constraint handling. The method of deterministic annealing in statistical physics, game theory and Nash equilibrium are at the core of the PC optimization methodology. Three benchmark problems have been solved with the optimum results obtained at reasonable computational cost. The evident strengths and weaknesses are also discussed to determine the future direction of research.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available