The auction algorithm: a distributed relaxation method for the assignment problem
Annals of Operations Research - Special Issue: Parallel Optimization on Novel Computer Architectures
Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
A genuinely polynomial primal simplex algorithm for the assignment problem
Discrete Applied Mathematics
Multiagent systems: a modern approach to distributed artificial intelligence
Multiagent systems: a modern approach to distributed artificial intelligence
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Communications of the ACM
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
A prototype infrastructure for distributed robot-agent-person teams
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Decentralized Assignment Reasoning Using Collaborative Local Mediation
IEEE Transactions on Knowledge and Data Engineering
Information Sciences: an International Journal
Performance of multiagent taxi dispatch on extended-runtime taxi availability: a simulation study
IEEE Transactions on Intelligent Transportation Systems
| Hi-index | 0.00 |
A multiagent collaboration algorithm using the concepts of belief (B), desire (D) and intention (I) for the classical assignment problem is presented. The problem can be viewed as seeking a concurrent allocation of one different resource for every task. Existing sequential algorithms use a single agent to operate on all assignment values; each value indicates the application quality-of-service (A-QoS) of one resource for one task. However, for many network applications, it may be practically more effective or desirable to deploy multiple communicating agents to solve the problem. The proposed algorithm for collaborative assignment is motivated by this potential and the availability of multiagent technologies to implement it.Given an (N tasks and N resources) N × N assignment problem, the proposed algorithm has each different task represented by an agent possessing only (local) knowledge of A-QoS's of all resources for the task. The novelty of the algorithm lies in the generic BDI-based reasoning mechanism of task agents whose individual resource exchange intentions are arbitrated by a simple arbitration agent. The algorithm is examined both analytically and experimentally, and discussed, also in relation to existing multiagent work.