Finite-time Analysis of the Multiarmed Bandit Problem
Machine Learning
Combining online and offline knowledge in UCT
Proceedings of the 24th international conference on Machine learning
Bandit based monte-carlo planning
ECML'06 Proceedings of the 17th European conference on Machine Learning
Heuristic search applied to abstract combat games
AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
A data mining approach to strategy prediction
CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
High-level reinforcement learning in strategy games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Identifying and utilizing subgroup coordination patterns in team adversarial games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Multi-agent plan adaptation using coordination patterns in team adversarial games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Monte-Carlo tree search and rapid action value estimation in computer Go
Artificial Intelligence
Learning to win by reading manuals in a Monte-Carlo framework
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Computing approximate Nash Equilibria and robust best-responses using sampling
Journal of Artificial Intelligence Research
Non-linear Monte-Carlo search in civilization II
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A real-time opponent modeling system for rush football
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Learning to win by reading manuals in a monte-carlo framework
Journal of Artificial Intelligence Research
Bootstrapping monte carlo tree search with an imperfect heuristic
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Hi-index | 0.00 |
We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics of this problem are quite complex, it is often possible to provide or learn a coarse simulation-based model of a tactical domain, which makes Monte-Carlo planning an attractive approach. In this paper, we investigate the use of UCT, a recent Monte-Carlo planning algorithm for this problem. UCT has recently shown impressive successes in the area of games, particularly Go, but has not yet been considered in the context of multiagent tactical planning. We discuss the challenges of adapting UCT to our domain and an implementation which allows for the optimization of user specified objective functions. We present an evaluation of our approach on a range of tactical assault problems with different objectives in the RTS game Wargus. The results indicate that our planner is able to generate superior plans compared to several baselines and a human player.