Efficient Role Transfer Based on Kuhn–Munkres Algorithm

Authors:
Haibin Zhu;MengChu Zhou
Affiliations:
Department of Computer Science and Mathematics, Nipissing University, North Bay , Canada;Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University , Shanghai, China
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2012

Citing 0
Cited 4

Role assignment for an agent group in consideration of conflicts among agents

Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Adaptive Collaboration Based on the E-CARGO Model

International Journal of Agent Technologies and Systems
An efficient approach to solving the agent training problem for a sustainable group

Proceedings of the 2013 Summer Computer Simulation Conference
A Cooperative Intrusion Detection Model Based on Granular Computing and Agent Technologies

International Journal of Agent Technologies and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many-to-Many (M-M) role transfers are generalized problems that are encountered in collaboration. Exhaustive-search-based algorithms are too computationally intensive. This paper introduces the Kuhn–Munkres (or Hungarian) algorithm for the general assignment problems (GAPs) and proposes a new efficient algorithm to solve the M-M role transfer problems by converting them to the GAPs. The experiments and results validate the proposed algorithms.