K Sorochan, M Guzdial - arXiv preprint arXiv:2212.03387, 2022 - arxiv.org
Real-Time Strategy (RTS) game unit generation is an unexplored area of Procedural Content Generation (PCG) research, which leaves the question of how to automatically …
Search algorithms based on combinatorial multi-armed bandits (CMABs) are promising for dealing with state-space sequential decision problems. However, current CMAB-based …
Y Zhao, J Zhao, X Hu, W Zhou… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
With the development of deep reinforcement learning (DRL), much progress in various perfect and imperfect information games has been achieved. Among these games …
A key challenge for planning systems in real-time multiagent domains is to search in large action spaces to decide an agent's next action. Previous works showed that handcrafted …
Syntax-guided synthesis is commonly used to generate programs encoding policies. In this approach, the set of programs, that can be written in a domain-specific language defines the …
Y Lu, Y Zhao, W Zhou, H Li - 2023 IEEE Conference on …, 2023 - ieeexplore.ieee.org
The use of artificial intelligence (AI) in card games has been a widely researched topic in the field of AI for an extended period. Recent advancements have led to AI programs exhibiting …
Y Zhao, Y Lu, J Zhao, W Zhou… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Recent advancements have propelled artificial intelligence (AI) to showcase expertise in intricate card games, such as Mahjong, DouDizhu, and Texas Hold'em. In this work, we aim …
Churchill and Buro (2013) launched a line of research through Portfolio Greedy Search (PGS), an algorithm for adversarial real-time planning that uses scripts to simplify the …
Abstract Real-Time Strategy (RTS) games are well-known for their substantially large combinatorial decision and state spaces, responsible for creating significant challenges for …