Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (2): 29-31.

• 博士论坛 • Previous Articles     Next Articles

Searching for Agent coalition for single task using approximation algorithm

LI Yong,JIANG Jian-guo,XIA Na   

  1. Department of Computer and Information Science,Hefei University of Technology,Hefei 230009,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-11 Published:2008-01-11
  • Contact: LI Yong

一种求解单任务Agent联盟生成的近似算法

李 勇,蒋建国,夏 娜   

  1. 合肥工业大学 计算机与信息学院,合肥 230009
  • 通讯作者: 李 勇

Abstract: Coalition is an important cooperative method in Multi-Agent System(MAS).It is a complicated combinatorial optimization problem to search for the optimal,task-oriented Agent coalition.The problem’s character is that coalitions including more Agents are better than those including few Agents.So,an approximation algorithm is proposed according to the character.The results of contrastive experiment show that this algorithm is fast and effective.

Key words: Multi-Agent System(MAS), coalition, approximation algorithm

摘要: 联盟是多Agent之间一种重要的合作方法,如何生成面向某个任务的最优联盟是一个复杂的组合优化问题。本问题的特点是:包含较少Agent的联盟要优于包含较多Agent的联盟。根据此特点提出一种近似算法,比较实验结果表明本算法快速、有效。

关键词: 多Agent系统, 联盟, 近似算法