Abstract
The Multi-Agent Programming Contest is to stimulate research in the area of multi-agent systems. In 2012, for the first time, a team from Sun Yat-sen University, Guangzhou, China, participated in the contest. The team is called AiWYX, and consists of a single member, who has just finished his undergraduate study. The system mainly exploits three strategies: strengthening action preconditions, task allocation optimization, and surrounding larger zones with shorter boundaries. With these strategies, our team is able to conquer large zones as early as possible, optimize collaboration, and ensure efficiency. The system was implemented in C++, and in this paper, we will introduce the design and architecture of AiWYX, and discuss the algorithms and implementations for these strategies.
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.
References
Behrens, T., Dastani, M., Dix, J., Köster, M., Novák, P.: Special issue about Multi-Agent-Contest I. In: Annals of Mathematics and Artificial Intelligence, vol. 59. Springer, Netherlands (2010)
Behrens, T., Dix, J., Köster, M., Hübner, J.: Special issue about Multi-Agent-Contest II. In: Annals of Mathematics and Artificial Intelligence, vol. 61. Springer, Netherlands (2011)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Section 22.2: Breadth-first search. In: Introduction to Algorithms, pp. 531–539. MIT Press and McGraw-Hill (2001)
Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Numerische Mathematik, vol. 1, pp. 260–271. Springer (1959)
Edmonds, J.: Maximum matching and a polyhedron with 0,1 vertices. J. of Res. the Nat. Bureau of Standards 69 B, 125–130 (1965)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. The MIT Press, Cambridge (1995)
Kuhn, H.W., Yaw, B.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart, 83–97 (1955)
Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Operations Research 41(2), 338–350 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, C. (2013). Conquering Large Zones by Exploiting Task Allocation and Graph-Theoretical Algorithms. In: Dastani, M., Hübner, J.F., Logan, B. (eds) Programming Multi-Agent Systems. ProMAS 2012. Lecture Notes in Computer Science(), vol 7837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38700-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-38700-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38699-2
Online ISBN: 978-3-642-38700-5
eBook Packages: Computer ScienceComputer Science (R0)