资源约束下基于离散粒子群算法求解多Agent资源结盟博弈问题.pdfVIP

总第 228 期 Vo l. 36 No.10 计算机与数字工程 2008 年第 10 期 Computer . Digital Engineering 12 资源约束下基于离散粒子群算法求解多 Agent 资源结盟博弈问题* 骆剑彬1) 胡山立1) 林耀海1.2) (福州大学计算机科学与技术系J) 福州 350002)(福建农林大学计算机与信息学院2) 福州 350002) 摘 要针对资源结盟博弈(CRGs， Coalitional Resource Games) 中自治Agent 结盟问题，每个 Agent 占有的资源不足 以满足其日标要求，Agent 通过建在联盟可以相互合作，各自实现目标。求解 CRGs 稳定联盟及其可达目标集的问题是一 个 NP-完全问题，由于可能的联盟数目随着 Agent 数日呈指数增长，需要设计高效的搜索算法。通过引入离散粒子群算法 解决CRGs 中自治 Agent 结盟问题。 关键词 资源结盟博弈 Agent 离散粒子群算法 中图分类号 TP18 Solving Coalitional Resource Games Based on Discrete Particle Swarm Optimization under Resource Constraint 2 Luo JianbinJ) Hu ShanliJ) Lin Yaohaïl. ) (Department of Computer Scíence and Technology , Fuzhou Uníversíty) , Fuzhou 350002) (Department of Computer Scíence and Technology , Fujían Agrículture and Forestry Uníversíty2) , Fuzhou 350002) Abstract We study Coalítíonal Resource Games( CRGs) , in whích each agent ís endowed wíth a set of resources whích is not enough to realize its goals. By colítíon. agent are collectively endowed with the necessary resources to satisfy their goals. Searching the stable coalition is an NP - complete problem. Due to the exponentially increase of the number of possible coalitíons , a heuristic effícient algorithm is r叫uired. Then a particle swarrns cooperative optimization algorithm applied to solvíng coalitional resource games under resource constraint. Kev words coaltional resources games ,agent ,discrete particle swarn optimization Class Number TP18 1 引言 人t智能和 MAS 领域的许多问题与资源分配和