Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abdallah, S., Lesser, V.: Multiagent Reinforcement Learning and Self-Organization in a Network of Agents. In: Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 172–179. IFAAMAS, Honolulu (2007)
Buyya, R., Abramson, D., Giddy, J., Stockinger, H.: Economic models for resource management and scheduling in grid computing. Concurrency and Computation: Practice and Experience 14(13-15), 1507–1542 (2003)
Casanova, H., Legrand, A., Zagorodnov, D., Berman, F.: Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. In: Proceedings of the 9th Heterogeneous Computing Workshop, pp. 349–363 (2000)
Dalheimer, M., Pfreundt, F.-J., Merz, P.: Agent-Based Grid Scheduling with Calana. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 741–750. Springer, Heidelberg (2006)
Gaston, M.E., desJardins, M.: Agent-organized networks for dynamic team formation. In: Proceedings of 4th Int. Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2005), pp. 230–237 (2005)
Gu, C., Ishida, T.: Analyzing the Social Behavior of Contract Net Protocol. In: Perram, J., Van de Velde, W. (eds.) MAAMAW 1996. LNCS(LNAI), vol. 1038, pp. 116–127. Springer, Heidelberg (1996)
Kraus, S., Plotkin, T.: Algorithms of distributed task allocation for cooperative agents. Theoretical Computer Science 242(1-2), 1–27 (2000)
Parunak, H.V.D.: Manufacturing experience with the contract net. In: Huhns, M. (ed.) Distributed Artificial Intelligence, pp. 285–310. Pitman Publishing, Morgan Kaufmann, London, San Mateo (1987)
Sandholm, T.: An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations. In: Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 256–262 (1993)
Sandholm, T., Lesser, V.: Issues in automated negotiation and electronic commerce: Extending the contract net framework. In: Lesser, V. (ed.) Proceedings of the First International Conference on Multi-Agent Systems (ICMAS 1995), pp. 328–335. The MIT Press, Cambridge (1995)
Schillo, M., Kray, C., Fischer, K.: The Eager Bidder Problem: A Fundamental Problem of DAI and Selected Solutions. In: Proceedings of First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2002), pp. 599–606 (2002)
Smith, R.G.: The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver. IEEE Transactions on Computers C-29(12), 1104–1113 (1980)
Sugawara, T., Hirotsu, T., Kurihara, S., Fukuda, K.: Performance Variation Due to Interference Among a Large Number of Self-Interested Agents. In: Proceedings of 2007 IEEE Congress on Evolutionary Computation, pp. 766–773 (2007)
Sugawara, T., Hirotsu, T., Kurihara, S., Fukuda, K.: Adaptive Manager-side Control Policy in Contract Net Protocol for Massively Multi-Agent Systems. In: Proceedings of 7th Int. Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1433–1436. IFMAS (May 2008)
Sugawara, T., Hirotsu, T., Kurihara, S., Fukuda, K.: Controling Contract Net Protocol by Local Observation for Large-Scale Multi-Agent Systems. In: Klusch, M., Pěchouček, M., Polleres, A. (eds.) CIA 2008. LNCS (LNAI), vol. 5180, pp. 206–220. Springer, Heidelberg (2008)
Weyns, D., Boucké, N., Holvoet, T.: Gradient Field-Based Task Assignment in an AGV Transportation System. In: Proceedings of 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), pp. 842–849 (2006)
Xu, L., Weigand, H.: The Evolution of the Contract Net Protocol. In: Wang, X.S., Yu, G., Lu, H. (eds.) WAIM 2001. LNCS, vol. 2118, pp. 257–264. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sugawara, T., Fukuda, K., Hirotsu, T., Kurihara, S. (2012). Effect of Alternative Distributed Task Allocation Strategy Based on Local Observations in Contract Net Protocol. In: Desai, N., Liu, A., Winikoff, M. (eds) Principles and Practice of Multi-Agent Systems. PRIMA 2010. Lecture Notes in Computer Science(), vol 7057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25920-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-25920-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25919-7
Online ISBN: 978-3-642-25920-3
eBook Packages: Computer ScienceComputer Science (R0)