计算机工程 ›› 2009, Vol. 35 ›› Issue (21): 186-188,.doi: 10.3969/j.issn.1000-3428.2009.21.062

• 人工智能及识别技术 • 上一篇    下一篇

给定限界的势结构生成算法

李少芳1,胡山立2   

  1. (1. 莆田学院电子信息工程学系,莆田 351100;2. 福州大学计算机科学与技术系,福州 350108)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-11-05 发布日期:2009-11-05

Cardinality Structure Generating Algorithm with Given Bound

LI Shao-fang1, HU Shan-li2   

  1. (1. Department of Electronic Information Engineering, Putian University, Putian 351100;
    2. Department of Computer Science and Technology, Fuzhou University, Fuzhou 350108)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-11-05 Published:2009-11-05

摘要: 在联盟结构生成过程中,同势的2个联盟通常具有相同值或相似值。在同势同值情况下建立不同联盟的限界时,必须搜索势结构图的最底两层。研究最优势结构生成问题,提出一种给定限界的势结构生成算法,确定需要进一步搜索的势结构。分析结果表明,搜索势结构图的最底两层和顶层后,通过搜索势结构集合,可以得到符合要求的限界。与其他势结构生成算法相比,该算法需要搜索的势结构数最少。

关键词: 多Agent, 势结构, 联盟组合, 限界

Abstract: During the generating process of coalition structure, two coalitions with same cardinality always have same value or similitude value. It is necessary to search the lowest two levels of the cardinality structure graph while establishing a bound of different coalition with same cardinality and same value. This paper researches the problem about best cardinality structure generating, proposes an algorithm for cardinality structure generating with bound and ascertains cardinality structures need to be further searched. Analysis results show that the required bound can be achieved by searching the cardinality structure set after searching the lowest two levels and the top level of the cardinality structure graph. The number of cardinality structures for searching of this algorithm is minimal comparing with other algorithms for cardinality structure generating.

Key words: multi-Agent, cardinality structure, coalition combination, bound

中图分类号: