東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Integrating Domain Knowledge into Monte Carlo Tree Search for Real-Time Strategy Games.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Integrating Domain Knowledge into Monte Carlo Tree Search for Real-Time Strategy Games./
作者:	Yang, Zuozhi.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2022,
面頁冊數:	119 p.
附註:	Source: Dissertations Abstracts International, Volume: 84-01, Section: B.
Contained By:	Dissertations Abstracts International84-01B.
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29256402
ISBN:	9798835538287

Integrating Domain Knowledge into Monte Carlo Tree Search for Real-Time Strategy Games.
Yang, Zuozhi.

Integrating Domain Knowledge into Monte Carlo Tree Search for Real-Time Strategy Games. - Ann Arbor : ProQuest Dissertations & Theses, 2022 - 119 p.

Source: Dissertations Abstracts International, Volume: 84-01, Section: B.

Thesis (Ph.D.)--Drexel University, 2022.

This item must not be sold to any third party vendors.

Tree search algorithms are widely applied methods to model and solve sequential decision problems. In particular, the family of sampling-based tree search algorithms called Monte Carlo Tree Search (MCTS) has had great success in problems with large branching factors. However, Real-Time Strategy (RTS) games offer a challenging testbed for tree search algorithms due to their large combinatorial action spaces, partial observability, simultaneous moves, and other factors, making them beyond the grasp of even current MCTS algorithms. This thesis makes contributions towards scaling MCTS algorithms to become more effective and efficient in the domain of RTS games. Specifically, this thesis contributes on the following problems. Firstly, we explore the problem of the integration of MCTS and domain knowledge, in the form of unit-action probability distributions, state evaluation functions, and scripted bots. Secondly, we investigate the optimization of gameplay/rollout policies for MCTS. Third, we study methods for self-learning in MCTS, where tree and/or rollout policies are bootstrapped directly from MCTS behavior iteratively.

ISBN: 9798835538287Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Domain knowledge

Integrating Domain Knowledge into Monte Carlo Tree Search for Real-Time Strategy Games.
LDR:02289nmm a2200373 4500 001 2349218
005 20220920135807.5
008 241004s2022 ||||||||||||||||| ||eng d
020 $a 9798835538287
035 $a (MiAaPQ)AAI29256402
035 $a AAI29256402
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yang, Zuozhi. $3 3688622
245 1 0 $a Integrating Domain Knowledge into Monte Carlo Tree Search for Real-Time Strategy Games.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2022
300 $a 119 p.
500 $a Source: Dissertations Abstracts International, Volume: 84-01, Section: B.
500 $a Advisor: Ontanon, Santiago.
502 $a Thesis (Ph.D.)--Drexel University, 2022.
506 $a This item must not be sold to any third party vendors.
520 $a Tree search algorithms are widely applied methods to model and solve sequential decision problems. In particular, the family of sampling-based tree search algorithms called Monte Carlo Tree Search (MCTS) has had great success in problems with large branching factors. However, Real-Time Strategy (RTS) games offer a challenging testbed for tree search algorithms due to their large combinatorial action spaces, partial observability, simultaneous moves, and other factors, making them beyond the grasp of even current MCTS algorithms. This thesis makes contributions towards scaling MCTS algorithms to become more effective and efficient in the domain of RTS games. Specifically, this thesis contributes on the following problems. Firstly, we explore the problem of the integration of MCTS and domain knowledge, in the form of unit-action probability distributions, state evaluation functions, and scripted bots. Secondly, we investigate the optimization of gameplay/rollout policies for MCTS. Third, we study methods for self-learning in MCTS, where tree and/or rollout policies are bootstrapped directly from MCTS behavior iteratively.
590 $a School code: 0065.
650 4 $a Computer science. $3 523869
650 4 $a Mass communications. $3 3422380
650 4 $a Applied mathematics. $3 2122814
653 $a Domain knowledge
653 $a Monte Carlo
653 $a Tree search
653 $a Real-time
653 $a Strategy games
690 $a 0984
690 $a 0364
690 $a 0708
710 2 $a Drexel University. $b Computer Science (College of Computing and Informatics). $3 3177627
773 0 $t Dissertations Abstracts International $g 84-01B.
790 $a 0065
791 $a Ph.D.
792 $a 2022
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29256402