摘要
联盟生成是MAS的一个关键问题,现有的工作主要研究如何针对一个任务生成最优联盟,很少考虑多任务多联盟生成问题(MMG).对MMG问题建立了模型,并进行了分析.在系统能力受限的条件下给出一种并行算法,首先找出最优可达任务集,再针对每个任务生成相应的联盟,从而实现了问题的分布并行求解.最后通过仿真试验说明了此算法的有效性.
Coalition formation has been a very active area of research in MAS. The existing work mainly researches how to generate an optimal coalition to one task, but few is about multi-task multi-coalition generation (MMG) problem. A model is established to MMG and the basic characteristics are analyzed. A parallel algorithm is suggested to solve this problem under the assumption of limited resources of the system, first finding the best achievable task set, then generating corresponding coalitions to each task. The efficiency and feasibleness of the proposed algorithm are demonstrated by simulation studies.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2008年第4期90-95,共6页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(60474035)
国家教育部博士点基金(20060359004)
关键词
多任务多联盟生成问题
最优可达任务集
能力匹配
多AGENT系统
multi-task multi-coalition generation (MMG) problem
optimal achievable task set
capability matching
multi-agent system