计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2009年
21期
186-188,191
,共4页
多Agent%势结构%联盟组合%限界
多Agent%勢結構%聯盟組閤%限界
다Agent%세결구%련맹조합%한계
multi-Agent%cardinality structure%coalition combination%bound
在联盟结构生成过程中,同势的2个联盟通常具有相同值或相似值.在同势同值情况下建立不同联盟的限界时,必须搜索势结构图的最底两层.研究最优势结构生成问题,提出一种给定限界的势结构生成算法,确定需要进一步搜索的势结构.分析结果表明,搜索势结构图的最底两层和顶层后,通过搜索势结构集合,可以得到符合要求的限界.与其他势结构生成算法相比,该算法需要搜索的势结构数最少.
在聯盟結構生成過程中,同勢的2箇聯盟通常具有相同值或相似值.在同勢同值情況下建立不同聯盟的限界時,必鬚搜索勢結構圖的最底兩層.研究最優勢結構生成問題,提齣一種給定限界的勢結構生成算法,確定需要進一步搜索的勢結構.分析結果錶明,搜索勢結構圖的最底兩層和頂層後,通過搜索勢結構集閤,可以得到符閤要求的限界.與其他勢結構生成算法相比,該算法需要搜索的勢結構數最少.
재련맹결구생성과정중,동세적2개련맹통상구유상동치혹상사치.재동세동치정황하건립불동련맹적한계시,필수수색세결구도적최저량층.연구최우세결구생성문제,제출일충급정한계적세결구생성산법,학정수요진일보수색적세결구.분석결과표명,수색세결구도적최저량층화정층후,통과수색세결구집합,가이득도부합요구적한계.여기타세결구생성산법상비,해산법수요수색적세결구수최소.
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 card inality structures for searching of this algorithm is minimal comparing with other algorithms for cardinality structure generating.