Monte Carlo Tree Search as an intelligent search tool in structural design problems

被引:0
|
作者
Leonardo Rossi
Mark H. M. Winands
Christoph Butenweg
机构
[1] Università degli Studi di Perugia,Department of Engineering
[2] Maastricht University,Department of Data Science and Knowledge Engineering (DKE), Faculty of Science and Engineering
[3] RWTH Aachen University,Center for Wind and Earthquake Engineering (CWE)
来源
关键词
Monte Carlo Tree Search; Structural design; Artificial intelligence; Civil engineering; Genetic algorithm; Reinforced concrete buildings;
D O I
暂无
中图分类号
学科分类号
摘要
Monte Carlo Tree Search (MCTS) is a search technique that in the last decade emerged as a major breakthrough for Artificial Intelligence applications regarding board- and video-games. In 2016, AlphaGo, an MCTS-based software agent, outperformed the human world champion of the board game Go. This game was for long considered almost infeasible for machines, due to its immense search space and the need for a long-term strategy. Since this historical success, MCTS is considered as an effective new approach for many other scientific and technical problems. Interestingly, civil structural engineering, as a discipline, offers many tasks whose solution may benefit from intelligent search and in particular from adopting MCTS as a search tool. In this work, we show how MCTS can be adapted to search for suitable solutions of a structural engineering design problem. The problem consists of choosing the load-bearing elements in a reference reinforced concrete structure, so to achieve a set of specific dynamic characteristics. In the paper, we report the results obtained by applying both a plain and a hybrid version of single-agent MCTS. The hybrid approach consists of an integration of both MCTS and classic Genetic Algorithm (GA), the latter also serving as a term of comparison for the results. The study’s outcomes may open new perspectives for the adoption of MCTS as a design tool for civil engineers.
引用
收藏
页码:3219 / 3236
页数:17
相关论文
共 50 条
  • [31] Parallel Monte-Carlo Tree Search
    Chaslot, Guillaume M. J. -B.
    Winands, Mark H. M.
    van den Herik, H. Jaap
    COMPUTERS AND GAMES, 2008, 5131 : 60 - +
  • [32] Parallel Monte Carlo Tree Search on GPU
    Rocki, Kamil
    Suda, Reiji
    ELEVENTH SCANDINAVIAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (SCAI 2011), 2011, 227 : 80 - 89
  • [33] Monte Carlo Tree Search in Lines of Action
    Winands, Mark H. M.
    Bjornsson, Yngvi
    Saito, Jahn-Takeshi
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2010, 2 (04) : 239 - 250
  • [34] Monte-Carlo Tree Search Solver
    Winands, Mark H. M.
    Bjornsson, Yngvi
    Saito, Jahn-Takeshi
    COMPUTERS AND GAMES, 2008, 5131 : 25 - +
  • [35] Learning in POMDPs with Monte Carlo Tree Search
    Katt, Sammie
    Oliehoek, Frans A.
    Amato, Christopher
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [36] Playing Carcassonne with Monte Carlo Tree Search
    Ameneyro, Fred Valdez
    Galvan, Edgar
    Fernando, Angel
    Morales, Kuri
    2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 2343 - 2350
  • [37] Monte Carlo Tree Search for Love Letter
    Omarov, Tamirlan
    Aslam, Hamna
    Brown, Joseph Alexander
    Reading, Elizabeth
    19TH INTERNATIONAL CONFERENCE ON INTELLIGENT GAMES AND SIMULATION (GAME-ON(R) 2018), 2018, : 10 - 15
  • [38] Incentive Learning in Monte Carlo Tree Search
    Kao, Kuo-Yuan
    Wu, I-Chen
    Yen, Shi-Jim
    Shan, Yi-Chang
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2013, 5 (04) : 346 - 352
  • [39] Monte Carlo Tree Search With Reversibility Compression
    Cook, Michael
    2021 IEEE CONFERENCE ON GAMES (COG), 2021, : 556 - 563
  • [40] Text Matching with Monte Carlo Tree Search
    He, Yixuan
    Tao, Shuchang
    Xu, Jun
    Guo, Jiafeng
    Lan, YanYan
    Cheng, Xueqi
    INFORMATION RETRIEVAL, CCIR 2018, 2018, 11168 : 41 - 52