Task decomposition in dynamic agent societies
نویسندگان
چکیده
The Contract Net Protocol is one of the most prominent concepts for negotiation in Multi-Agent Systems. However , there are some unspecified features like the task decomposition procedures used by managers. Also the bottleneck induced by the central role of the managers will be identified as a weak point of the method. This is especially true if the amount of tasks in the system and the society of agents itself are dynamic. We will first investigate in a general task decomposition strategy. Then the central role of the manager will be softened by introducing the Decentralized Task Decomposition Model. Finally, in the Completely Decentralized Model, the manager will be totally eliminated. Our ideas are presented in a transportation domain, which is also described to some extent.
منابع مشابه
Geometric Task Decomposition in a Multi-Agent Environment
Task decomposition in a multi-agent environment is often performed online. This paper proposes a method for subtask allocation that can be performed before the agents are deployed, reducing the need for communication among agents during their mission. The proposed method uses a Voronoi diagram to partition the task-space among team members and includes two phases: static and dynamic. Static dec...
متن کاملA Metamodel for Agents, Roles, and Groups
Societies need patterned behavior to exist. Large-scale agent societies may contain a diversity of agents, each with differing abilities and functionalities. When such an agent system is given a task, it must dynamically muster together a group of agents that collectively have the capability to accomplish the task. To do this, the agent society needs to be able to understand its agents and thei...
متن کاملAn Agent-based Improved Task Decomposition Model for Multiple Expert Systems
To solve task decomposition of multi-expert system, agent-based task decomposition model and algorithm based on dependency is introduced. Firstly, AND/OR dependency graph for operation set is presented. Formal description of task decomposition based on With AND/OR dependency graph, is proposed. Secondly, task decomposition algorithm based on operation dependency is analyzed to solve communicati...
متن کاملA belief propagation-based method for task allocation in open and dynamic cloud environments
We propose a decentralized belief propagation-based method, PD-LBP, for multi-agent task allocation in open and dynamic grid and cloud environments where both the sets of agents and tasks constantly change. PD-LBP aims at accelerating the online response to, improving the resilience from the unpredicted changing in the environments, and reducing the message passing for task allocation. To do th...
متن کاملIncremental Negotiation and Coalition Formation for Resource bounded Agents Preliminary report
We explore a class of task allocation mechanisms that are incremental and can be tuned to the computational resource limitations of agents Our focus is on dis tributed task and resource allocation problems involv ing coalitions of cooperative agents that must negotiate among themselves on the distribution of tasks Our emphasis is on the design of mechanisms with desir able real time and dynamic...
متن کامل