Analysis of strategy in robot soccer game

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86089053" target="_blank" >RIV/61989100:27240/13:86089053 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/13:86089053

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S0925231212006686" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0925231212006686</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.neucom.2012.03.021" target="_blank" >10.1016/j.neucom.2012.03.021</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Analysis of strategy in robot soccer game

Popis výsledku v původním jazyce

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 aranking 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 simulationgame prove the validity of the method. (C) 2012 Elsevier B.V. All rights reserved.

Název v anglickém jazyce

Analysis of strategy in robot soccer game

Popis výsledku anglicky

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 aranking 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 simulationgame prove the validity of the method. (C) 2012 Elsevier B.V. All rights reserved.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Neurocomputing

ISSN

0925-2312

e-ISSN

—

Svazek periodika

109

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

10

Strana od-do

66-75

Kód UT WoS článku

000318379600009

EID výsledku v databázi Scopus

—