TY - GEN
T1 - Dynamic pricing algorithms for task allocation in multi-agent swarms
AU - Dasgupta, Prithviraj
AU - Hoeing, Matthew
PY - 2008
Y1 - 2008
N2 - Over the past few years, emergent computing based techniques such as swarming have evolved as an attractive technique to design coordination protocols in large-scale distributed systems and massively multi-agent systems. In this paper, we consider a search-and-execute problem domain where agents have to discover tasks online and perform them in a distributed, collaborative manner. We specifically focus on the problem of distributed coordination between agents to dynamically allocate the tasks among themselves. To address this problem, we describe a novel technique that combines a market-based dynamic pricing algorithm to control the task priorities with a swarming-based coordination technique to disseminate task information across the agents. Experimental results within a simulated environment for a distributed aided target recognition application show that the dynamic pricing based task selection strategies compare favorably with other heuristic-based task selection strategies in terms of task completion times while achieving a significant reduction in communication overhead.
AB - Over the past few years, emergent computing based techniques such as swarming have evolved as an attractive technique to design coordination protocols in large-scale distributed systems and massively multi-agent systems. In this paper, we consider a search-and-execute problem domain where agents have to discover tasks online and perform them in a distributed, collaborative manner. We specifically focus on the problem of distributed coordination between agents to dynamically allocate the tasks among themselves. To address this problem, we describe a novel technique that combines a market-based dynamic pricing algorithm to control the task priorities with a swarming-based coordination technique to disseminate task information across the agents. Experimental results within a simulated environment for a distributed aided target recognition application show that the dynamic pricing based task selection strategies compare favorably with other heuristic-based task selection strategies in terms of task completion times while achieving a significant reduction in communication overhead.
UR - http://www.scopus.com/inward/record.url?scp=54349116999&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=54349116999&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-85449-4_5
DO - 10.1007/978-3-540-85449-4_5
M3 - Conference contribution
AN - SCOPUS:54349116999
SN - 3540854487
SN - 9783540854487
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 64
EP - 79
BT - Massively Multi-Agent Technology - AAMAS Workshops - MMAS 2006, LSMAS 2006, and CCMMS 2007, Hakodate, Japan, May 9, 2006, Honolulu, HI, USA, May 15, 2007, Selected and Revised Papers
T2 - 1st International Workshop on Coordination and Control in Massively Multi-agent Systems, CCMMS 2007
Y2 - 15 May 2007 through 15 May 2007
ER -