Multiagent Learning of Coordination in Loosely Coupled Multiagent Systems

被引:40
作者
Yu, Chao [1 ]
Zhang, Minjie [2 ]
Ren, Fenghui [2 ]
Tan, Guozhen [1 ]
机构
[1] Dalian Univ Technol, Sch Comp Sci & Technol, Dalian 116024, Peoples R China
[2] Univ Wollongong, Sch Comp Sci & Software Engn, Wollongong, NSW 2522, Australia
关键词
Agent independence; coordination; multiagent learning (MAL); reinforcement learning (RL); sparse interactions; DECENTRALIZED CONTROL; COMPLEXITY;
D O I
10.1109/TCYB.2014.2387277
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multiagent learning (MAL) is a promising technique for agents to learn efficient coordinated behaviors in multiagent systems (MASs). In MAL, concurrent multiple distributed learning processes can make the learning environment nonstationary for each individual learner. Developing an efficient learning approach to coordinate agents' behaviors in this dynamic environment is a difficult problem, especially when agents do not know the domain structure and have only local observability of the environment. In this paper, a coordinated MAL approach is proposed to enable agents to learn efficient coordinated behaviors by exploiting agent independence in loosely coupled MASs. The main feature of the proposed approach is to explicitly quantify and dynamically adapt agent independence during learning so that agents can make a trade-off between a single-agent learning process and a coordinated learning process for an efficient decision making. The proposed approach is employed to solve two-robot navigation problems in different scales of domains. Experimental results show that agents using the proposed approach can learn to act in concert or independently in different areas of the environment, which results in great computational savings and near optimal performance.
引用
收藏
页码:2853 / 2867
页数:15
相关论文
共 53 条
[1]  
Allen M., 2009, ADV NEURAL INFORM PR, P19
[2]  
ALLEN M, 2008, C ART INT AAAI, P1440
[3]  
[Anonymous], 2009, P 20 BELG NETH C ART
[4]  
[Anonymous], CSM404 U ESS DEP COM
[5]  
[Anonymous], 2010, P 9 INT C AUT AG MUL
[6]  
[Anonymous], 2002, INT C MACH LEARN ICM
[7]  
Barto AG, 2003, DISCRETE EVENT DYN S, V13, P343
[8]   Solving transition independent decentralized Markov decision processes [J].
Becker, R ;
Zilberstein, S ;
Lesser, V ;
Goldman, CV .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2004, 22 :423-455
[9]  
Becker R., 2003, P 2 INT JOINT C AUT, P41
[10]   The complexity of decentralized control of Markov decision processes [J].
Bernstein, DS ;
Givan, R ;
Immerman, N ;
Zilberstein, S .
MATHEMATICS OF OPERATIONS RESEARCH, 2002, 27 (04) :819-840