首页> 外文会议>International Symposium on Agent and Multi-Agent Systems >Hierarchical Organization of Agents Based on Galois Sub-Hierarchy for Complex Tasks Allocation in Massive MAS
【24h】

Hierarchical Organization of Agents Based on Galois Sub-Hierarchy for Complex Tasks Allocation in Massive MAS

机译:基于Galois Sub-Shierarchy的复杂任务分配在大型MAS中的分层组织

获取原文

摘要

A major challenge in the field of Multi-Agent Systems is to enable autonomous agents to allocate tasks efficiently. In previous work, we have developed a decentralized and scalable method for complex tasks allocation for Massive Multi-Agent System (MMAS) based on two steps: 1) hierarchical organization of agent groups using Formal Concepts Analysis approach (FCA), 2) computing the optimal allocation. The first step is computed by one agent named global allocator that computes Galois lattice representing the hierarchical structure of agent groups. Then, it simplifies the completed lattices by pruning unnecessary groups. The second step distributes the tasks allocation process among all agent groups. Nevertheless, the hierarchical organization process is still centralized. Moreover, generation of Galois lattice composed by all concepts (2~(min(|O|,|A|)) concepts in the worst cases. Where 0 and A means, respectively, the set of objects and the set of attributes) and then simplification of the hierarchy of such size are not useful. This paper extends our last approach to distribute the organization process of agent groups among all agents by providing extension to the Pulton algorithm that generates Galois Sub-Hierarchy which is a polynomial size representation of a concept lattice. This decentralized self-organization of agents provides a flexible infrastructure for agents' dynamicity in MMAS.
机译:多代理系统领域的一项重大挑战是使自治代理能够有效地分配任务。在以前的工作中,我们对大规模多代理系统(MMS)的复杂任务分配进行了分散和可扩展的方法,基于两个步骤:1)使用正式概念分析方法(FCA),2)计算代理组的分层组织。计算最佳分配。第一步由一个名为全局分配器的一个代理计算,该代理计算代表代理组的分层结构的Galois格子。然后,通过修剪不必要的组来简化完成的格子。第二步分发所有代理组之间的任务分配过程。尽管如此,分层组织过程仍然是集中的。此外,在最糟糕的情况下,由所有概念组成的Galois格子(2〜(Min(| |,| a))概念。其中0和均值,分别是对象集和一组属性)和然后简化这种尺寸的层次结构没有用。本文通过向普遍素算法提供扩展来扩展到所有代理中的代理组组织过程的最后一种方法,该算法是生成Galois子层次结构的,这是概念格的多项式大小表示。这种分散的自我组织的代理商在MMAS中为代理商的动态提供了灵活的基础设施。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号