Supported by the National Natural Science Foundation of China under Grant Nos.60573076,60496323(国家自然科学基金)
A Dynamic Formation Algorithm of Multi-Agent Coalition Structure
Author:
Affiliation:
Fund Project:
摘要
|
图/表
|
访问统计
|
参考文献
|
相似文献
|
引证文献
|
资源附件
|
文章评论
摘要:
针对多Agent联盟数量是Agent个数指数倍的问题,基于Agent合作收益独立性,给出了Agent联盟快速动态生成算法--SCS(search of coalition structure)算法;依Agent联盟之间的同构关系,将Agent联盟结构图剪枝,然后进行Agent联盟结构搜索,可降低搜索空间大小,并证明了是剪枝前搜索量的n(k-1)n-k.最后,以机器人足球赛RoboCup为背景给出了实验分析,表明了SCS算法的效率.SCS算法是
Abstract:
To solve the number of coalition structure increase rapidly, algorithm SCS (search of coalition structure), fast dynamic formation of Agent coalition, is given. It can prune the graph of Agent coalition structure, decrease the searching space., and proved that after pruning, the number of coalition structure is n(k-1)n-k of that before pruning. Finally, an experiment is given. This work can be seen as an improvement of Jennings and Sandholm’s related work.