Abstract
This paper describes the group formation problem in multi-agent systems. A finite set of agents should be divided into the best set of groups. The task is to form the groups of agents of several types, which have different properties and abilities, so that they to be able to achieve the goal which cannot be achieved by any single agent on its own. To date, several group formation algorithms have been proposed: optimal algorithms are able to work with up to 50 agents; approximate algorithms can handle the group formation problem if number of agents is about hundreds or thousands. In this work SPADE multi-agent system is chosen after evaluation of its scalability and performance for several hundreds of agents. Greedy algorithm for agents group formation is proposed and implemented using SPADE multi-agent system. Characteristics of implemented algorithm are studied. Results show that performance of proposed SPADE based framework allows the implementation of more complex algorithms for agents group formation, which may provide results closer to optimal.
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.
