Analyzing and learning an opponent's strategies in the RoboCup small size league

11Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes a dissimilarity function that is useful for analyzing and learning the opponent's strategies implemented in a RoboCup Soccer game. The dissimilarity function presented here identifies the differences between two instances of the opponent's deployment choices. An extension of this function was developed to further identify the differences between deployment choices over two separate time intervals. The dissimilarity function, which generates a dissimilarity matrix, is then exploited to analyze and classify the opponent's strategies using cluster analysis. The classification step was implemented by analyzing the opponent's strategies used in set plays captured in the logged data obtained from the Small Size League's games played during RoboCup 2012. The experimental results showed that the attacking strategies used in set plays may be effectively classified. A method for learning an opponent's attacking strategies and deploying teammates in advantageous positions on the fly in actual games is discussed. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Yasui, K., Kobayashi, K., Murakami, K., & Naruse, T. (2014). Analyzing and learning an opponent’s strategies in the RoboCup small size league. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8371 LNAI, pp. 159–170). Springer Verlag. https://doi.org/10.1007/978-3-662-44468-9_15

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