Effect of Alternative Distributed Task Allocation Strategy Based on Local Observations in Contract Net Protocol

被引:0
作者
Sugawara, Toshiharu [1 ]
Fukuda, Kensuke [2 ]
Hirotsu, Toshio [3 ]
Kurihara, Satoshi [4 ]
机构
[1] Waseda Univ, Dept Comp Sci & Engn, Tokyo 1698555, Japan
[2] Natl Inst Informat Chiyoda, Tokyo 100000, Japan
[3] Hosei Univ, Fac Comp & Informat Sci, Tokyo 142, Japan
[4] Osaka Univ, Inst Sci & Ind Res, Osaka, Japan
来源
PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS | 2012年 / 7057卷
关键词
Distributed task allocation; Adaptive Behavior; Negotiation; Load-balancing; AGENTS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a distributed task allocation method whose strategies are alternatively selected based on the estimated workloads of the local agents. Recent Internet. sensor-network, and cloud computing applications are large-scale and fully-distributed, and thus, require sophisticated multi-agent system technologies to enable a large number of programs and computing resources to be effectively used. To elicit the capabilities of all the agents in a large-scale multi-agent system (LSMAS) in which thousands of agents work concurrently requires a new negotiation strategy for appropriately allocating tasks in a distributed manner. We start by focusing on the contract net protocol (CNP) in LSMAS and then examine the effects of the awardee selection strategies, that is. the task allocation strategies. We will show that probabilistic awardee selections improve the overall performance in specific situations. Next, the mixed strategy in which a number of awardee selections are alternatively used based on the analysis of the bid from the local agents is proposed. Finally, we show that the proposed strategy does not only avoid task concentrations but also reduces the wasted efforts, thus it can considerably improve the performance.
引用
收藏
页码:90 / +
页数:3
相关论文
共 17 条
[1]  
Abdallah S., 2007, P AAMAS HON HI US, P172
[2]  
[Anonymous], 2006, P 5 INT JOINT C AUTO, DOI DOI 10.1145/1160633.1160785
[3]   Economic models for resource management and scheduling in Grid computing [J].
Buyya, R ;
Abramson, D ;
Giddy, J ;
Stockinger, H .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2002, 14 (13-15) :1507-1542
[4]  
Casanova H., 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556), P349, DOI 10.1109/HCW.2000.843757
[5]  
Dalheimer M, 2006, LECT NOTES COMPUT SC, V3911, P741
[6]  
Gaston M.E., 2005, P 4 INT JOINT C AUTO, P230
[7]  
Gu C., 1996, LECT NOTES ARTIF INT, V1038, P116
[8]   Algorithms of distributed task allocation for cooperative agents [J].
Kraus, S ;
Plotkin, T .
THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) :1-27
[9]  
PARUNAK HVD, 1987, DISTRIBUTED ARTIFICI, P285
[10]  
SANDHOLM T, 1993, PROCEEDINGS OF THE ELEVENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, P256