Abstract
The complex systems can be best dealt by decomposing them into subsystems or Multi-Agent System (MAS) and further treat them in a distributed way. However, coordinating these agents to achieve the best possible global objective is one of the challenging issues. The problem becomes harder when the constraints are involved. This paper proposes the approach of Probability Collectives (PC) in the Collective Intelligence (COIN) framework for modeling and controlling the distributed MAS. At the core of the PC methodology are the Deterministic Annealing and Game Theory. In order to make it more generic and capable of handling constraints, feasibility-based rule is incorporated to handle solutions based on the number of constraints violated and drive the convergence towards feasibility. The approach is validated by successfully solving two test problems. The proposed algorithm is shown to be sufficiently robust and other strengths, weaknesses and future directions are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
