Výsledky vyhledávání

Analysis of the Impact of Randomization of Search-Control Parameters in Monte-Carlo Tree Search

Autor: Mark H. M. Winands, Chiara F. Sironi

Publikováno v: Journal of Artificial Intelligence Research, 72, 717-757. AI Access Foundation

Monte-Carlo Tree Search (MCTS) has been applied successfully in many domains, including games. However, its performance is not uniform on all domains, and it also depends on how parameters that control the search are set. Parameter values that are op

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34d117a43361d82a6df15536ed6ed5ec
https://doi.org/10.1613/jair.1.12065

Zobrazit plný text záznamu

Enhancing Playout Policy Adaptation for General Game Playing

Autor: Mark H. M. Winands, Chiara F. Sironi, Tristan Cazenave

Publikováno v: Monte Carlo Search: MCS 2020, 116-139
STARTPAGE=116;ENDPAGE=139;TITLE=Monte Carlo Search
Communications in Computer and Information Science ISBN: 9783030894528

Playout policy adaptation (ppa) is a state-of-the-art strategy that has been proposed to control the playouts in monte-carlo tree search (mcts). Ppa has been successfully applied to many two-player, sequential-move games. This paper further evaluates

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b24e7e2680dc991fd0a7023ff4b64714
https://doi.org/10.1007/978-3-030-89453-5_9

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Adaptive General Search Framework for Games and Beyond

Autor: Chiara F. Sironi, Mark H. M. Winands

Publikováno v: 2021 IEEE Conference on Games (CoG), 1051-1058
STARTPAGE=1051;ENDPAGE=1058;TITLE=2021 IEEE Conference on Games (CoG)

The research field of Artificial General Intelligence (AGI) is concerned with the creation of adaptive programs that can autonomously address tasks of a different nature. Search and planning have been identified as core capabilities of AGI, and have

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1839d1cc5425d6b65985b037250858fc
https://cris.maastrichtuniversity.nl/en/publications/d5b47367-c519-403a-8695-36cac866df09

Zobrazit plný text záznamu

Automatic Goal Discovery in Subgoal Monte Carlo Tree Search

Autor: Dominik Jeurissen, Mark H.M. Winands, Chiara F. Sironi, Diego Perez-Liebana

Publikováno v: 2021 IEEE Conference on Games (CoG), 990-993
STARTPAGE=990;ENDPAGE=993;TITLE=2021 IEEE Conference on Games (CoG)

Monte Carlo Tree Search (MCTS) is a heuristic search algorithm that can play a wide range of games without requiring any domain-specific knowledge. However, MCTS tends to struggle in very complicated games due to an exponentially increasing branching

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::382b82f3397d87a097059a8e6cc2b8d4
https://cris.maastrichtuniversity.nl/en/publications/9650feb6-d777-4585-88af-a859642fde31

Zobrazit plný text záznamu

Comparing Randomization Strategies for Search-Control Parameters in Monte-Carlo Tree Search

Autor: Mark H. M. Winands, Chiara F. Sironi

Publikováno v: 2019 IEEE Conference on Games (CoG), 1-8
STARTPAGE=1;ENDPAGE=8;TITLE=2019 IEEE Conference on Games (CoG)
CoG

Monte-Carlo Tree Search (MCTS) has been applied successfully in many domains. Previous research has shown that adding randomization to certain components of MCTS might increase the diversification of the search and improve the performance. In a domai

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::001b6ba77c3144d63e65efa8b23a80ac
https://ieeexplore.ieee.org/document/8848056/

Zobrazit plný text záznamu

Self-Adaptive Rolling Horizon Evolutionary Algorithms for General Video Game Playing

Autor: Raluca D. Gaina, Simon M. Lucas, Diego Perez-Liebana, Mark H. M. Winands, Chiara F. Sironi

Publikováno v: CoG
2020 IEEE Conference on Games (CoG), 367-374
STARTPAGE=367;ENDPAGE=374;TITLE=2020 IEEE Conference on Games (CoG)

For general video game playing agents, the biggest challenge is adapting to the wide variety of situations they encounter and responding appropriately. Some success was recently achieved by modifying search-control parameters in agents on-line, durin

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e992cafdaa77163b92c40bcc41f65652
https://doi.org/10.1109/CoG47356.2020.9231587

Zobrazit plný text záznamu

Self-Adaptive Monte Carlo Tree Search in General Game Playing

Autor: Chiara F. Sironi, Mark H. M. Winands, Jialin Liu

Publikováno v: IEEE Transactions on Games, 12(2), 132-144. IEEE

Many enhancements for Monte Carlo tree search (MCTS) have been applied successfully in general game playing (GGP). MCTS and its enhancements are controlled by multiple parameters that require extensive and time-consuming offline optimization. Moreove

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3b51f783399bdad0160ccfa190b7207
https://cris.maastrichtuniversity.nl/en/publications/dc999e7f-896a-4e4d-bfa6-346ecc8db2fa

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Vyhledávací nástroje:

Upřesnit hledání