Analysis of strategy in robot soccer game

  • Authors:
  • Jie Wu;VáClav SnášEl;ElišKa Ochodková;Jan Martinovič;VáClav Svatoň;Ajith Abraham

  • Affiliations:
  • Department of Computer Science, FEECS, VŠB - Technical University of Ostrava, 708 33 Ostrava-Poruba, Czech Republic;Department of Computer Science, FEECS, VŠB - Technical University of Ostrava, 708 33 Ostrava-Poruba, Czech Republic;Department of Computer Science, FEECS, VŠB - Technical University of Ostrava, 708 33 Ostrava-Poruba, Czech Republic;Department of Computer Science, FEECS, VŠB - Technical University of Ostrava, 708 33 Ostrava-Poruba, Czech Republic;Department of Computer Science, FEECS, VŠB - Technical University of Ostrava, 708 33 Ostrava-Poruba, Czech Republic;Department of Computer Science, FEECS, VŠB - Technical University of Ostrava, 708 33 Ostrava-Poruba, Czech Republic and Machine Intelligence Research Labs, Auburn, WA 98071, USA

  • Venue:
  • Neurocomputing
  • Year:
  • 2013

Quantified Score

Hi-index 0.01

Visualization

Abstract

Strategy is a kernel subsystem of robot soccer game. In our work, we present an approach to describe the strategy of the game, based on which we explain the morphology of strategy set. Loop strategies are likely to make robots be in a trap of executing repeated actions. We analyze the existence criterion of loop strategies, and then present some corollaries and theorems, by which the loop strategies and chain strategies can be found, also superfluous strategies and inconsistent strategies. We present a ranking model that indicates the weak node in strategy set. We also present a probability-based model which is the basis of evaluation of strategy. Additionally, we present a method to generate offensive strategy, and the statistic results of simulation game prove the validity of the method.