Prior state reasoning in multi-agent systems and graph-theoretical algorithms

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Multi-Agent Programming Contest is held every year to stimulate research in the area of multi-agent systems. Our system mainly exploits four strategies: prior state reasoning, task allocation optimization, dijkstra with recharge and surrounding several stable and valuable zones with shorter boundaries. With these strategies, our team is able to conquer several 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 AiWXX, and discuss the algorithms and implementations for these strategies. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, C., & Liu, L. (2013). Prior state reasoning in multi-agent systems and graph-theoretical algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8245 LNAI, pp. 356–365). https://doi.org/10.1007/978-3-642-45343-4_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free