Customer coalitions in the electronic marketplace
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
A formal method for inheritance graph hierarchy construction
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Software engineering: Systems and tools
Coalition formation with uncertain heterogeneous information
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Forming efficient agent groups for completing complex tasks
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Gradient field-based task assignment in an AGV transportation system
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
An algorithm for distributing coalitional value calculations among cooperating agents
Artificial Intelligence
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Distributed task allocation in social networks
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Methods for task allocation via agent coalition formation
Artificial Intelligence
Performances of galois sub-hierarchy-building algorithms
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Hi-index | 0.00 |
A major challenge in the field of multi-agent systems is to enable autonomous agents to allocate tasks efficiently. In the context of massive multi-agents system (MMAS) which is characterised by a large number of dynamic and heterogeneous agents, traditional tasks allocations approaches based on the negotiation between agents, or a single allocator agent, proved impracticality. In this paper, we propose a decentralised and scalable approach for complex task allocation pro cooperative MMAS. Our approach is based on the idea of grouping agents according to their capacities to execute sub-tasks. Thus, the approach is based on two steps: 1) hierarchical organisation of agent groups using Galois sub-hierarchy, imminent from the formal concepts analysis approach (FCA); 2) computing the optimal allocation. These two steps are fully distributed among agents with the minimum of communication and a grant of finding the optimal allocation in a polynomial time. Further, this paper extends our last approach by distributing the global allocation process among all agents. It provides a solution based on cooperation among agents. This solution prohibits generation of conflicts. It is based on the idea that each agent has to pick out its own sub-task.