Analysis of strategy in robot soccer game
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 crit...
Gespeichert in:
Veröffentlicht in: | Neurocomputing (Amsterdam) 2013-06, Vol.109, p.66-75 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 75 |
---|---|
container_issue | |
container_start_page | 66 |
container_title | Neurocomputing (Amsterdam) |
container_volume | 109 |
creator | Wu, Jie Snášel, Václav Ochodková, Eliška Martinovič, Jan Svatoň, Václav Abraham, Ajith |
description | 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. |
doi_str_mv | 10.1016/j.neucom.2012.03.021 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1709778278</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0925231212006686</els_id><sourcerecordid>1709778278</sourcerecordid><originalsourceid>FETCH-LOGICAL-c372t-edaa9834d996f711a18f707c189349a8e52303373d177363b60e361574e799503</originalsourceid><addsrcrecordid>eNqFkD1PwzAURS0EEqXwDxgywpDwnp3E9oJUVXxJlVhgtlznpXLVxMVOkfrvSRVmmO5y7pXuYewWoUDA-mFb9HRwoSs4IC9AFMDxjM1QSZ4rrupzNgPNq5wL5JfsKqUtAErkesbuF73dHZNPWWizNEQ70OaY-T6LYR2GLAXnKGYb29E1u2jtLtHNb87Z5_PTx_I1X72_vC0Xq9wJyYecGmu1EmWjdd1KRIuqlSAdKi1KbRVVXIAQUjQopajFugYSNVayJKl1BWLO7qbdfQxfB0qD6XxytNvZnsIhGZSgpVRcqv_RkmtVag18RMsJdTGkFKk1--g7G48GwZwkmq2ZJJqTRAPCjBLH2uNUo_Hxt6dokvPUO2p8JDeYJvi_B34A6pB5Lg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1429849902</pqid></control><display><type>article</type><title>Analysis of strategy in robot soccer game</title><source>Elsevier ScienceDirect Journals</source><creator>Wu, Jie ; Snášel, Václav ; Ochodková, Eliška ; Martinovič, Jan ; Svatoň, Václav ; Abraham, Ajith</creator><creatorcontrib>Wu, Jie ; Snášel, Václav ; Ochodková, Eliška ; Martinovič, Jan ; Svatoň, Václav ; Abraham, Ajith</creatorcontrib><description>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.</description><identifier>ISSN: 0925-2312</identifier><identifier>EISSN: 1872-8286</identifier><identifier>DOI: 10.1016/j.neucom.2012.03.021</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Computer simulation ; Criteria ; Games ; Kernels ; Robot soccer ; Robots ; Soccer ; Statistics ; Strategy</subject><ispartof>Neurocomputing (Amsterdam), 2013-06, Vol.109, p.66-75</ispartof><rights>2012 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c372t-edaa9834d996f711a18f707c189349a8e52303373d177363b60e361574e799503</citedby><cites>FETCH-LOGICAL-c372t-edaa9834d996f711a18f707c189349a8e52303373d177363b60e361574e799503</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0925231212006686$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Wu, Jie</creatorcontrib><creatorcontrib>Snášel, Václav</creatorcontrib><creatorcontrib>Ochodková, Eliška</creatorcontrib><creatorcontrib>Martinovič, Jan</creatorcontrib><creatorcontrib>Svatoň, Václav</creatorcontrib><creatorcontrib>Abraham, Ajith</creatorcontrib><title>Analysis of strategy in robot soccer game</title><title>Neurocomputing (Amsterdam)</title><description>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.</description><subject>Computer simulation</subject><subject>Criteria</subject><subject>Games</subject><subject>Kernels</subject><subject>Robot soccer</subject><subject>Robots</subject><subject>Soccer</subject><subject>Statistics</subject><subject>Strategy</subject><issn>0925-2312</issn><issn>1872-8286</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNqFkD1PwzAURS0EEqXwDxgywpDwnp3E9oJUVXxJlVhgtlznpXLVxMVOkfrvSRVmmO5y7pXuYewWoUDA-mFb9HRwoSs4IC9AFMDxjM1QSZ4rrupzNgPNq5wL5JfsKqUtAErkesbuF73dHZNPWWizNEQ70OaY-T6LYR2GLAXnKGYb29E1u2jtLtHNb87Z5_PTx_I1X72_vC0Xq9wJyYecGmu1EmWjdd1KRIuqlSAdKi1KbRVVXIAQUjQopajFugYSNVayJKl1BWLO7qbdfQxfB0qD6XxytNvZnsIhGZSgpVRcqv_RkmtVag18RMsJdTGkFKk1--g7G48GwZwkmq2ZJJqTRAPCjBLH2uNUo_Hxt6dokvPUO2p8JDeYJvi_B34A6pB5Lg</recordid><startdate>20130603</startdate><enddate>20130603</enddate><creator>Wu, Jie</creator><creator>Snášel, Václav</creator><creator>Ochodková, Eliška</creator><creator>Martinovič, Jan</creator><creator>Svatoň, Václav</creator><creator>Abraham, Ajith</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7TS</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130603</creationdate><title>Analysis of strategy in robot soccer game</title><author>Wu, Jie ; Snášel, Václav ; Ochodková, Eliška ; Martinovič, Jan ; Svatoň, Václav ; Abraham, Ajith</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c372t-edaa9834d996f711a18f707c189349a8e52303373d177363b60e361574e799503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer simulation</topic><topic>Criteria</topic><topic>Games</topic><topic>Kernels</topic><topic>Robot soccer</topic><topic>Robots</topic><topic>Soccer</topic><topic>Statistics</topic><topic>Strategy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, Jie</creatorcontrib><creatorcontrib>Snášel, Václav</creatorcontrib><creatorcontrib>Ochodková, Eliška</creatorcontrib><creatorcontrib>Martinovič, Jan</creatorcontrib><creatorcontrib>Svatoň, Václav</creatorcontrib><creatorcontrib>Abraham, Ajith</creatorcontrib><collection>CrossRef</collection><collection>Physical Education Index</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Neurocomputing (Amsterdam)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wu, Jie</au><au>Snášel, Václav</au><au>Ochodková, Eliška</au><au>Martinovič, Jan</au><au>Svatoň, Václav</au><au>Abraham, Ajith</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Analysis of strategy in robot soccer game</atitle><jtitle>Neurocomputing (Amsterdam)</jtitle><date>2013-06-03</date><risdate>2013</risdate><volume>109</volume><spage>66</spage><epage>75</epage><pages>66-75</pages><issn>0925-2312</issn><eissn>1872-8286</eissn><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.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.neucom.2012.03.021</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0925-2312 |
ispartof | Neurocomputing (Amsterdam), 2013-06, Vol.109, p.66-75 |
issn | 0925-2312 1872-8286 |
language | eng |
recordid | cdi_proquest_miscellaneous_1709778278 |
source | Elsevier ScienceDirect Journals |
subjects | Computer simulation Criteria Games Kernels Robot soccer Robots Soccer Statistics Strategy |
title | Analysis of strategy in robot soccer game |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T15%3A00%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Analysis%20of%20strategy%20in%20robot%20soccer%20game&rft.jtitle=Neurocomputing%20(Amsterdam)&rft.au=Wu,%20Jie&rft.date=2013-06-03&rft.volume=109&rft.spage=66&rft.epage=75&rft.pages=66-75&rft.issn=0925-2312&rft.eissn=1872-8286&rft_id=info:doi/10.1016/j.neucom.2012.03.021&rft_dat=%3Cproquest_cross%3E1709778278%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1429849902&rft_id=info:pmid/&rft_els_id=S0925231212006686&rfr_iscdi=true |