首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于P学习的分布式并行多任务分配算法
引用本文:苏兆品, 蒋建国, 梁昌勇, 张国富. 一种基于P学习的分布式并行多任务分配算法. 自动化学报, 2011, 37(7): 865-872. doi: 10.3724/SP.J.1004.2011.00865
作者姓名:苏兆品  蒋建国  梁昌勇  张国富
作者单位:School of Computer and Information;Hefei University of Technology;Postdoctoral Research Station for Management Science and Engineering;School of Management;Information and Communication Engineering Postdoctoral Research Station;
基金项目:Supported by National Natural Science Foundation of China(61004103); National Research Foundation for the Doctoral Program of Higher Education of China (20100111110005); China Postdoctoral Science Foundation (20090460742); Natural Science Foundation of Anhui Province of China (090412058, 11040606Q44)
摘    要:并行多任务分配是多agent系统中极具挑战性的课题, 主要面向资源分配、灾害应急管理等应用需求, 研究如何把一组待求解任务分配给相应的agent联盟去执行. 本文提出了一种基于自组织、自学习agent的分布式并行多任务分配算法, 该算法引入P学习设计了单agent寻找任务的学习模型, 并给出了agent之间通信和协商策略. 对比实验说明该算法不仅能快速寻找到每个任务的求解联盟, 而且能明确给出联盟中各agent成员的实际资源承担量, 从而可以为实际的控制和决策任务提供有价值的参考依据.

关 键 词:多Agent系统(MAS)   并发多任务分配   联盟形成   P学习   协商
收稿时间:2010-03-05
修稿时间:2011-03-02

A Distributed Algorithm for Parallel Multi-task Allocation Based on Profit Sharing Learning
SU Zhao-Pin, JIANG Jian-Guo, LIANG Chang-Yong, ZHANG Guo-Fu. A Distributed Algorithm for Parallel Multi-task Allocation Based on Profit Sharing Learning. ACTA AUTOMATICA SINICA, 2011, 37(7): 865-872. doi: 10.3724/SP.J.1004.2011.00865
Authors:SU Zhao-Pin  JIANG Jian-Guo  LIANG Chang-Yong  ZHANG Guo-Fu
Affiliation:1. School of Computer and Information, Hefei University of Technology, Hefei 230009, P.R.China;
2. Postdoctoral Research Station for Management Science and Engineering, School of Management, Hefei University of Technology, Hefei 230009, P.R.China;
3. Information and Communication Engineering Postdoctoral Research Station, Hefei University of Technology, Hefei 230009, P.R.China
Abstract:Task allocation via coalition formation is a fundamental research challenge in several application domains of multi-agent systems (MAS), such as resource allocation, disaster response management, and so on. It mainly deals with how to allocate many unresolved tasks to groups of agents in a distributed manner. In this paper, we propose a distributed parallel multi-task allocation algorithm among self-organizing and self-learning agents. To tackle the situation, we disperse agents and tasks geographically in two-dimensional cells, and then introduce profit sharing learning (PSL) for a single agent to search its tasks by continual self-learning. We also present strategies for communication and negotiation among agents to allocate real workload to every tasked agent. Finally, to evaluate the effectiveness of the proposed algorithm, we compare it with Shehory and Kraus' distributed task allocation algorithm which were discussed by many researchers in recent years. Experimental results show that the proposed algorithm can quickly form a solving coalition for every task. Moreover, the proposed algorithm can specifically tell us the real workload of every tasked agent, and thus can provide a specific and significant reference for practical control tasks.
Keywords:Multi-agent systems (MAS)  parallel multi-task allocation  coalition formation  profit sharing learning (PSL)  negotiation
本文献已被 CNKI 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号