Abstract
Groups of agents in multi-agent systems may have to cooperate to solve tasks efficiently, and coordinating such groups is an important problem in the field of artificial intelligence. In this paper, we consider the problem of forming disjoint coalitions and assigning them to independent tasks simultaneously, and present an anytime algorithm that efficiently solves the simultaneous coalition structure generation and task assignment problem. This NP-complete combinatorial optimization problem has many real-world applications, including forming cross-functional teams aimed at solving tasks. To evaluate the algorithm’s performance, we extend established methods for synthetic problem set generation, and benchmark the algorithm using randomized data sets of varying distribution and complexity. Our results show that the presented algorithm efficiently finds optimal solutions, and generates high quality solutions when interrupted prior to finishing an exhaustive search. Additionally, we apply the algorithm to solve the problem of assigning agents to regions in a commercial computer-based strategy game, and empirically show that our algorithm can significantly improve the coordination and computational efficiency of agents in a real-time multi-agent system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bryan, H., Lesser, V.: A survey of multi-agent organizational paradigms. Knowl. Eng. Rev. (2004)
Gerkey, B.P., Matar, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23(9), 943 (2004)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1–2), 83–97 (1955)
Larson, K.S., Sandholm, T.W.: Anytime coalition structure generation: an average case study. J. Exp. Theoret. Artif. Intell. 12(1), 23–42 (2000)
Rahwan, T., Jennings, N.R.: An improved dynamic programming algorithm for coalition structure generation. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 3. International Foundation for Autonomous Agents and Multiagent Systems (2008)
Rahwan, T., Michalak, T.P., Wooldridge, M., Jennings, N.R.: Coalition structure generation: a survey. Artif. Intell. 229, 139–174 (2015)
Rahwan, T., Ramchurn, S.D., Jennings, N.R., Giovannucci, A.: An anytime algorithm for optimal coalition structure generation. J. Artif. Intell. Res. 34, 521–567 (2009)
Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artif. Intell. 101(1–2), 165–200 (1998)
Takaoka, T.: An O(1) time algorithm for generating multiset permutations. In: International Symposium on Algorithms and Computation. Springer (1999)
Williams, A.: Loopless generation of multiset permutations using a constant number of variables by prefix shifts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics (2009)
Yamada, T., Nasu, Y.: Heuristic and exact algorithms for the simultaneous assignment problem. Eur. J. Oper. Res. 123(3), 531–542 (2000)
Yang, J., Luo, Z.: Coalition formation mechanism in multi-agent systems based on genetic algorithms. Appl. Soft Comput. 7(2), 561–568 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Präntare, F., Ragnemalm, I., Heintz, F. (2017). An Algorithm for Simultaneous Coalition Structure Generation and Task Assignment. In: An, B., Bazzan, A., Leite, J., Villata, S., van der Torre, L. (eds) PRIMA 2017: Principles and Practice of Multi-Agent Systems. PRIMA 2017. Lecture Notes in Computer Science(), vol 10621. Springer, Cham. https://doi.org/10.1007/978-3-319-69131-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-69131-2_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69130-5
Online ISBN: 978-3-319-69131-2
eBook Packages: Computer ScienceComputer Science (R0)