1. 合肥工业大学特种显示技术教育部重点实验室,安徽,合肥,230009
2. 合肥工业大学计算机与信息学院,安徽,合肥,230009
3. 合肥工业大学信息与通信工程博士后科研流动站,安徽,合肥,230009
4. 合肥工业大学特种显示技术教育部重点实验室安徽合肥,230009
5. 合肥工业大学计算机与信息学院安徽合肥,230009
6. 合肥工业大学信息与通信工程博士后科研流动站安徽合肥,230009
纸质出版:2012
移动端阅览
张国富, 周鹏, 蒋建国, 等. 基于虚拟联盟的重叠联盟形成算法[J]. 电子学报, 2012,40(1):121-127.
ZHANG Guo-fu, ZHOU Peng, JIANG Jian-guo, et al. An Algorithm for Overlapping Coalition Formation Based on Virtual Coalition[J]. Acta Electronica Sinica, 2012, 40(1): 121-127.
张国富, 周鹏, 蒋建国, 等. 基于虚拟联盟的重叠联盟形成算法[J]. 电子学报, 2012,40(1):121-127. DOI: 10.3969/j.issn.0372-2112.2012.01.020.
ZHANG Guo-fu, ZHOU Peng, JIANG Jian-guo, et al. An Algorithm for Overlapping Coalition Formation Based on Virtual Coalition[J]. Acta Electronica Sinica, 2012, 40(1): 121-127. DOI: 10.3969/j.issn.0372-2112.2012.01.020.
重叠联盟形成问题是复杂智能系统中极具挑战性的前沿课题.特别是当一个能力有限的agent同时参与了多个不同的任务
但又不能同时满足这多个任务的需求时
就会产生资源冲突.为此
本文重点研究如何把一个无效的二维二进制编码修正为一个合法的编码
提出将有效联盟的剩余能力转移给一个动态的虚拟联盟
由虚拟联盟帮助解决其他无效联盟.实验结果表明
本文算法不会丢弃任何无效编码
在解决激烈的资源冲突时显得更加灵活有效.
Overlapping coalition formation is a very challenging topic in complex intelligent systems.When an agent with insufficient resources may join in several different tasks but can not satisfy those tasks' need at the same time
resource conflicts will take place.To tackle such scenarios
this paper mainly focuses on how to revise an invalid two-dimensional binary encoding into a valid one to resolve conflicts over the usage of joint resources.A dynamic virtual coalition is proposed to inherit the surplus resources of all feasible coalitions to join and help other invalid coalitions.Finally
contrastive experiments are made to show that the proposed algorithm does not discard any invalid encoding and is more effective to resolve possible resource conflicts.
0
浏览量
1206
下载量
5
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621