• Transactions of the Korean Society of Automotive Engineers
• /
• v.12 no.6
• /
• pp.135-142
• /
• 2004

The severe frontal crash tests are NCAP with belted occupant at 35mph and FMVSS 208 with unbelted occupant at 25mph, This paper describes the design process of occupant protection systems, airbag and seat belt, under the two tests. In this study, NCAP simulations are performed by Monte Carlo search method and cluster analysis. The Monte Carlo search method is a global optimization technique and requires execution of a series of deterministic analyses, The procedure is as follows. 1) Define the region of interest 2) Perform Monte Carlo simulation with uniform distribution 3) Transform output to obtain points grouped around the local minima 4) Perform cluster analysis to obtain groups that are close to each other 5) Define the several feasible design ranges. The several feasible designs are acquired and checked under FMVSS 208 simulation with unbelted occupant at 25mph.

• Smart Media Journal
• /
• v.9 no.4
• /
• pp.36-43
• /
• 2020

The Monte Carlo tree search (MCTS) is a popular method for implementing an intelligent game program. It has several hyper-parameters that require an optimization for showing the best performance. Due to the stochastic nature of the MCTS, the hyper-parameter optimization is difficult to solve. This paper uses the self-playing capability of the MCTS-based game program for optimizing the hyper-parameters. It seeks a winner path over the hyper-parameter space while performing the self-play. The top-q longest winners in the winner path compete for the final winner. The experiment using the 15-15-5 game (Omok in Korean name) showed a promising result.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.405-408
• /
• 2016

Games like Go, Chess, Janggi have helped to brain development of the people. These games are developed by computer program. And many algorithms have been developed to allow myself to play. The person winning chess program was developed in the 1990s. But game of go is too large number of cases. So it was considered impossible to win professional go player. However, with the use of MCTS(Monte Carlo Tree Search) and CNN(Convolutional Neural Network), the performance of the go algorithm is greatly improved. In this paper, using CNN and MCTS were proceeding development of go algorithm. Using the manual of go learning CNN look for the best position, MCTS calculates the win probability in the game to proceed with simulation. In addition, extract pattern information of go using existing manual of go, plans to improve speed and performance by using it. This method is showed a better performance than general go algorithm. Also if it is receiving sufficient computing power, it seems to be even more improved performance.

• Nuclear Engineering and Technology
• /
• v.55 no.7
• /
• pp.2712-2722
• /
• 2023

For an accurate and efficient time-dependent Monte Carlo (TDMC) neutron transport analysis, several advanced methods are newly developed and implemented in the Seoul National University Monte Carlo code, McCARD. For an efficient control of the neutron population, a dynamic weight window method is devised to adjust the weight bounds of the implicit capture in the time bin-by-bin TDMC simulations. A moving geometry module is developed to model a continuous insertion or withdrawal of a control rod. Especially, the history-based batch method for the TDMC calculations is developed to predict the unbiased variance of a bin-wise mean estimate. The developed methods are verified for three-dimensional problems in the C5G7-TD benchmark, showing good agreements with results from a deterministic neutron transport analysis code, nTRACER, within the statistical uncertainty bounds. In addition, the TDMC analysis capability implemented in McCARD is demonstrated to search the optimum detector positions for the pulsed-neutron-source experiments in the Kyoto University Critical Assembly and AGN201K.

• KIISE Transactions on Computing Practices
• /
• v.21 no.8
• /
• pp.572-577
• /
• 2015

Generally, the existing Artificial Intelligence (AI) systems were designed for specific purposes and their capabilities handle only specific problems. Alternatively, Artificial General Intelligence can solve new problems as well as those that are already known. Recently, General Video Game Playing the game AI version of General Artificial Intelligence, has garnered a large amount of interest among Game Artificial Intelligence communities. Although video games are the sole concern, the design of a single AI that is capable of playing various video games is not an easy process. In this paper, we propose a GreedyUCB1 algorithm and rollout method that were formulated using the knowledge from a game analysis for the Monte-Carlo Tree Search game AI. An AI that used our method was ranked fourth at the GVG-AI (General Video Game-Artificial Intelligence) competition of the IEEE international conference of CIG (Computational Intelligence in Games) 2014.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1035-1040
• /
• 2004

In the proto design stage of a new car, the performance of an occupant protection system is often evaluated by CAE instead of the real test. CAE predicts and recommends the appropriate design values hence reducing the number of the real tests. However, the existing researches using CAE in predicting the performances do not consider the uncertainties of parameters, in which inconsistency between the actual test results and CAE exists. In this research, the optimization procedure of a protection system such as airbag and load limiter is suggested for the frontal collision. The DACE modeling known as Kriging interpolation is introduced to obtain the meta model of the system followed by the tabu search method to determine a global optimum. Finally, the distribution of a suggested design is determined through the Monte-Carlo Simulation.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.3
• /
• pp.155-164
• /
• 2010

This paper proposes a robust detection method for ship wake search using two wake sensors. A long trailing wake in the rear of a surface ship is generated along the track of surface ships. In this paper, we assume that the nearer the surface ship, the stronger wake strength is and a two-sensor based wake homing torpedo can sense for the wake strength. On this assumption we propose a simple wake detection and search method using information of wake strength. Experimental results using monte-carlo simulation demonstrate that the proposed method yields better performance in search time than previous method, which uses a single sensor. Our method is shown faster by about 45 seconds than previous method to achieve the same performance. Also, it can improve the detection performance of torpedo in the case of short wake length.

• Nuclear Engineering and Technology
• /
• v.55 no.8
• /
• pp.3030-3038
• /
• 2023

Nowadays, mobile robots have been used to search for uncontrolled radioactive source in indoor environments to avoid radiation exposure for technicians. However, in the indoor environments, especially in the presence of obstacles, how to make the robots with limited sensing capabilities automatically search for the radioactive source remains a major challenge. Also, the source search efficiency of robots needs to be further improved to meet practical scenarios such as limited exploration time. This paper proposes an automatic source search strategy, abbreviated as ACA: the location of source is estimated by a convolutional neural network (CNN), and the path is planned by the A-star algorithm. First, the search area is represented as an occupancy grid map. Then, the radiation dose distribution of the radioactive source in the occupancy grid map is obtained by Monte Carlo (MC) method simulation, and multiple sets of radiation data are collected through the eight neighborhood self-avoiding random walk (ENSAW) algorithm as the radiation data set. Further, the radiation data set is fed into the designed CNN architecture to train the network model in advance. When the searcher enters the search area where the radioactive source exists, the location of source is estimated by the network model and the search path is planned by the A-star algorithm, and this process is iterated continuously until the searcher reaches the location of radioactive source. The experimental results show that the average number of radiometric measurements and the average number of moving steps of the ACA algorithm are only 2.1% and 33.2% of those of the gradient search (GS) algorithm in the indoor environment without obstacles. In the indoor environment shielded by concrete walls, the GS algorithm fails to search for the source, while the ACA algorithm successfully searches for the source with fewer moving steps and sparse radiometric data.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.3
• /
• pp.221-230
• /
• 2001

The assembly tolerance design methods have applied linear or nonlinear programming methods and used simulation method and search algorithms to optimize the tolerance allocation of each part in an assembly. However, those methods are only considered to the relationship between tolerance and manufacturing cost, which do not consider a quality loss cost for each part tolerance. In this paper, the integrated simulation model used genetic algorithm and the Monte-Carlo simulation method was developed for the allocation of the optimal tolerance considering the manufacturing cost and quality loss cost.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.40 no.10
• /
• pp.895-900
• /
• 2016

Remaining useful life (RUL) estimation of the Li-ion battery has gained great interest because it is necessary for quality assurance, operation planning, and determination of the exchange period. This paper presents the RUL estimation of an Li-ion battery for an energy storage system using exponential function for the degradation model and Markov Chain Monte Carlo (MCMC) approach for parameter estimation. The MCMC approach is dependent upon information such as model initial parameters and input setting parameters which highly affect the estimation result. To overcome this difficulty, this paper offers a guideline for model initial parameters based on the regression result, and MCMC input parameters derived by comparisons with a thorough search of theoretical results.