scholarly journals Improving Monte Carlo Tree Search with Artificial Neural Networks without Heuristics

2021 ◽  
Vol 11 (5) ◽  
pp. 2056
Author(s):  
Alba Cotarelo ◽  
Vicente García-Díaz ◽  
Edward Rolando Núñez-Valdez ◽  
Cristian González García ◽  
Alberto Gómez ◽  
...  

Monte Carlo Tree Search is one of the main search methods studied presently. It has demonstrated its efficiency in the resolution of many games such as Go or Settlers of Catan and other different problems. There are several optimizations of Monte Carlo, but most of them need heuristics or some domain language at some point, making very difficult its application to other problems. We propose a general and optimized implementation of Monte Carlo Tree Search using neural networks without extra knowledge of the problem. As an example of our proposal, we made use of the Dots and Boxes game. We tested it against other Monte Carlo system which implements specific knowledge for this problem. Our approach improves accuracy, reaching a winning rate of 81% over previous research but the generalization penalizes performance.

2020 ◽  
Vol 32 (18) ◽  
pp. 15191-15207 ◽  
Author(s):  
Xuze Liu ◽  
Abbas Fotouhi

Abstract Energy management has been one of the most important parts in electric race strategies since the Fédération Internationale de l’Automobile Formula-E championships were launched in 2014. Since that time, a number of unfavorable race finishes have been witnessed due to poor energy management. Previous researches have been focused on managing the power flow between different energy sources or different energy consumers based on a fixed cycle. However, there is no published work in the literature about energy management of a full electric racing car on repeated course but with changeable settings and driving styles. Different from traditional energy management problems, the electric race strategy is more of a multi-stage decision-making problem which has a very large scale. Meanwhile, this is a time-critical task in motorsport where fast prediction tools are needed and decisions have to be made in seconds to benefit the final outcome of the race. In this study, the use of artificial neural networks (ANN) and tree search techniques is investigated as an approach to solve such a large-scale problem. ANN prediction models are developed to replace the traditional lap time simulation as a much faster performance prediction tool. Implementation of Monte Carlo tree search based on the proposed ANN fast prediction models has provided decent capability to generate decision-making solution for both pre-race planning and in-race reaction to unexpected scenarios.


2005 ◽  
Vol 42 (1) ◽  
pp. 110-120 ◽  
Author(s):  
M A Shahin ◽  
M B Jaksa ◽  
H R Maier

Traditional methods of settlement prediction of shallow foundations on granular soils are far from accurate and consistent. This can be attributed to the fact that the problem of estimating the settlement of shallow foundations on granular soils is very complex and not yet entirely understood. Recently, artificial neural networks (ANNs) have been shown to outperform the most commonly used traditional methods for predicting the settlement of shallow foundations on granular soils. However, despite the relative advantage of the ANN based approach, it does not take into account the uncertainty that may affect the magnitude of the predicted settlement. Artificial neural networks, like more traditional methods of settlement prediction, are based on deterministic approaches that ignore this uncertainty and thus provide single values of settlement with no indication of the level of risk associated with these values. An alternative stochastic approach is essential to provide more rational estimation of settlement. In this paper, the likely distribution of predicted settlements, given the uncertainties associated with settlement prediction, is obtained by combining Monte Carlo simulation with a deterministic ANN model. A set of stochastic design charts, which incorporate the uncertainty associated with the ANN method, is developed. The charts are considered to be useful in the sense that they enable the designer to make informed decisions regarding the level of risk associated with predicted settlements and consequently provide a more realistic indication of what the actual settlement might be.Key words: settlement prediction, shallow foundations, neural networks, Monte Carlo, stochastic simulation.


Author(s):  
Serkan Eti

Quantitative methods are mainly preferred in the literature. The main purpose of this chapter is to evaluate the usage of quantitative methods in the subject of the investment decision. Within this framework, the studies related to the investment decision in which quantitative methods are taken into consideration. As for the quantitative methods, probit, logit, decision tree algorithms, artificial neural networks methods, Monte Carlo simulation, and MARS approaches are taken into consideration. The findings show that MARS methodology provides a more accurate results in comparison with other techniques. In addition to this situation, it is also concluded that probit and logit methodologies were less preferred in comparison with decision tree algorithms, artificial neural networks methods, and Monte Carlo simulation analysis, especially in the last studies. Therefore, it is recommended that a new evaluation for investment analysis can be performed with MARS method because it is understood that this approach provides better results.


1997 ◽  
Vol 9 (5) ◽  
pp. 1109-1126
Author(s):  
Zhiyu Tian ◽  
Ting-Ting Y. Lin ◽  
Shiyuan Yang ◽  
Shibai Tong

With the progress in hardware implementation of artificial neural networks, the ability to analyze their faulty behavior has become increasingly important to their diagnosis, repair, reconfiguration, and reliable application. The behavior of feedforward neural networks with hard limiting activation function under stuck-at faults is studied in this article. It is shown that the stuck-at-M faults have a larger effect on the network's performance than the mixed stuck-at faults, which in turn have a larger effect than that of stuck-at-0 faults. Furthermore, the fault-tolerant ability of the network decreases with the increase of its size for the same percentage of faulty interconnections. The results of our analysis are validated by Monte-Carlo simulations.


2006 ◽  
Vol 50 ◽  
pp. 25-30 ◽  
Author(s):  
Camilo A. S. de FARIAS ◽  
Alcigeimes B. CELESTE ◽  
Yojiro SAKATA ◽  
Akihiro KADOTA ◽  
Koichi SUZUKI

Sign in / Sign up

Export Citation Format

Share Document