• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.401-418
• /
• 2005

In this paper, a dual algorithm, based on a smoothing function of Bertsekas (1982), is established for solving unconstrained minimax problems. It is proven that a sequence of points, generated by solving a sequence of unconstrained minimizers of the smoothing function with changing parameter t, converges with Q-superlinear rate to a Kuhn-Thcker point locally under some mild conditions. The relationship between the condition number of the Hessian matrix of the smoothing function and the parameter is studied, which also validates the convergence theory. Finally the numerical results are reported to show the effectiveness of this algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.428-431
• /
• 1995

In this paper we propose an on-line tuning method by using genetic algorithm for robust minimax I-PD controller based on new criterion. The new criterion is the Integral of Squared Error (ISE) with a penalty of the derivative of manipulated variable. The work focuses on robust tuning of I-PD controller's parameters in the presence of plant parameter uncertainty. The result of several simulation studies are provided to illustrate the performance of this robust tunig method.

• 한국게임학회 논문지
• /
• 제18권5호
• /
• pp.59-66
• /
• 2018

이 논문에서는 전통게임중 하나인 고누게임에 대한 구현과 실험이 수행된다. 고누게임을 구현하기 위한 기법으로 미니맥스알고리즘이 적용되었다. 미니맥스 알고리즘에 게임을 구현하기 위해 평가함수를 제안하였다. 고누게임의 구현 이후 성능향상을 위해 알파베타 가지치기에 대한 알고리즘의 효율성을 분석한다. 게임의 승패에 영향을 미치는 최적의 분석을 위해 가중치 분석이 수행되었다. 가중치 분석을 위하여, 사람과 컴퓨터의 대국, 컴퓨터와 컴퓨터의 대국으로 실험하였다. 그 결과 최적의 공격과 방어를 할 수 있는 가중치를 제시하였다.

• 전기학회논문지
• /
• 제67권12호
• /
• pp.1657-1664
• /
• 2018

This paper proposes a decision making scheme for choosing the best move at each state of game in order to implement an artificial intelligence othello game player. The proposed decision making scheme predicts the various possible states of the game when the game has progressed from the current state, evaluates the degree of possibility of winning or losing the game at the states, and searches the best move based on the evaluation. In this paper, we generate learning data by decomposing the records of professional players' real game into states, matching and accumulating winning points to the states, and using the Artificial Neural Network that learned them, we evaluated the value of each predicted state and applied the Minimax search to determine the best move. We implemented an artificial intelligence player of the Othello game by applying the proposed scheme and evaluated the performance of the game player through games with three different artificial intelligence players.

• Communications for Statistical Applications and Methods
• /
• 제22권2호
• /
• pp.147-157
• /
• 2015

We consider a sparse high-dimensional linear regression model. Penalized methods using LASSO or non-convex penalties have been widely used for variable selection and estimation in high-dimensional regression models. In penalized regression, the selection and prediction performances depend on which penalty function is used. For example, it is known that LASSO has a good prediction performance but tends to select more variables than necessary. In this paper, we propose an additive sparse penalty for variable selection using a combination of LASSO and minimax concave penalties (MCP). The proposed penalty is designed for good properties of both LASSO and MCP.We develop an efficient algorithm to compute the proposed estimator by combining a concave convex procedure and coordinate descent algorithm. Numerical studies show that the proposed method has better selection and prediction performances compared to other penalized methods.

• 응용통계연구
• /
• 제13권2호
• /
• pp.393-405
• /
• 2000

원래 최적실험의 이론은 주어진 모형과 그에 따른 가정에 기초하여 발달되었기 때문에 하나의 최적실험기준이 실험이 가족 있는 여러 목적을 모두 반영하는 것이 무리이다. 따라서 실험자가 다목적 실험기준의 필요성을 느끼는 경우에는 종종 여러 최적실험 기준들의 균형을 이루는 방법을 통해 이러한 문제가 다루어진다. 본 연구에서는 이 분산 구조를 가지고 있는 모형을 예를 들어 복합적인 실험기준들을 알아본다. 왜냐하면 이분산인 경우 D-최적과 G-최적실험간의 동격이론은 더 이상 성립되지 않음에 따라 두 실험기준의 특징은 현격하게 구분되어지기 때문이다. 제약조건최적실험, 결합최적실험, 그리고 minimax 설험방법을 통한 실험기준들간의 균형을 꾀하여 보았다. 처음 두 방법은 실험자의 주관이 반영되어 실제적으로 매우 세심한 주의가 필요한 반면, minimax는 그러한 점을 해소하였다고 본다. 또한 이를 확장하여 오차의 이분산 구조에 대한 불확실성이 존재할 때 적용될수 있는 두 가지 실험기준도 마련하여 보았다. 간단한 알고리즘과 결어를 첨부하였다.

• 한국게임학회 논문지
• /
• 제18권4호
• /
• pp.99-106
• /
• 2018

보드게임에서는 많은 경우의 수의 말들과 많은 상태공간들을 가지고 있다. 그러므로 게임은 학습을 오래 하여야 한다. 본 논문에서는 Q러닝 알고리즘을 이용했다. 그러나 강화학습은 학습초기에 학습속도가 느려지는 단점이 있다. 그러므로 학습을 하는 동안에 같은 최선의 값이 있을 때, 게임트리를 고려한 문제영역의 지식을 활용한 휴리스틱을 사용하여 학습의 속도향상을 시도하였다. 기존 구현된 말과 개선하여 구현된 말을 비교하기 위하여 보드게임을 제작했다. 그래서 일방적으로 공격하는 말과 승부를 겨루게 하였다. 개선된 말은 게임트리를 고려하여 상대방 말을 공격하였다. 실험결과 개선하여 구현된 말이 학습속도적인 면에서 향상됨 것을 알 수 있었다.

• Structural Engineering and Mechanics
• /
• 제68권5호
• /
• pp.549-561
• /
• 2018

Sobol method is applied as a powerful variance decomposition technique in the field of global sensitivity analysis (GSA). The paper is devoted to increase convergence speed of the extracted Sobol indices using a new proposed sampling technique called genetic based Latine hypercube sampling (GBLHS). This technique is indeed an improved version of restricted Latine hypercube sampling (LHS) and the optimization algorithm is inspired from genetic algorithm in a new approach. The new approach is based on the optimization of minimax value of LHS arrays using manipulation of array indices as chromosomes in genetic algorithm. The improved Sobol method is implemented to perform factor prioritization and fixing of an uncertain comprehensive high speed rotor-bearing system. The finite element method is employed for rotor-bearing modeling by considering Eshleman-Eubanks assumption and interaction of axial force on the rotor whirling behavior. The performance of the GBLHS technique are compared with the Monte Carlo Simulation (MCS), LHS and Optimized LHS (Minimax. criteria). Comparison of the GBLHS with other techniques demonstrates its capability for increasing convergence speed of the sensitivity indices and improving computational time of the GSA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권2호
• /
• pp.542-558
• /
• 2023

A digital focus index (DFI) is a value used to determine image focus in scientific apparatus and smart devices. Automatic focus (AF) is an iterative and time-consuming procedure; however, its processing time can be reduced using a general processing unit (GPU) and a multi-core processor (MCP). In this study, parallel architectures of a minimax search algorithm (MSA) are applied to two DFIs: range algorithm (RA) and image contrast (CT). The DFIs are based on a histogram; however, the parallel computation of the histogram is conventionally inefficient because of the bank conflict in shared memory. The parallel architectures of RA and CT are constructed using parallel reduction for MSA, which is performed through parallel relative rating of the image pixel pairs and halved the rating in every step. The array size is then decreased to one, and the minimax is determined at the final reduction. Kernels for the architectures are constructed using open source software to make it relatively platform independent. The kernels are tested in a hexa-core PC and an embedded device using Lenna images of various sizes based on the resolutions of industrial cameras. The performance of the kernels for the DFIs was investigated in terms of processing speed and computational acceleration; the maximum acceleration was 32.6× in the best case and the MCP exhibited a higher performance.

• 한국경영과학회지
• /
• 제7권2호
• /
• pp.41-48
• /
• 1982

This paper presents an efficient algorithm for finding a new facility(center) in the Euclidean plane in accordance with minimax criterion: that is, the facility is located to minimize the maximum weighted Euclidean distance. The method given in this paper involves computational geometry. Some possible extensions of this problem are also discussed.