• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.15-15
• /
• 2003

We provide some recent results of approximation algorithms for solving Markov Games and discuss their applications to problems that arise in Computer Science. We consider a receding horizon approach as an approximate solution to two-person zero-sum Markov games with an infinite horizon discounted cost criterion. We present error bounds from the optimal equilibrium value of the game when both players take “correlated” receding horizon policies that are based on exact or approximate solutions of receding finite horizon subgames. Motivated by the worst-case optimal control of queueing systems by Altman, we then analyze error bounds when the minimizer plays the (approximate) receding horizon control and the maximizer plays the worst case policy. We give two heuristic examples of the approximate receding horizon control. We extend “parallel rollout” and “hindsight optimization” into the Markov game setting within the framework of the approximate receding horizon approach and analyze their performances. From the parallel rollout approach, the minimizing player seeks to combine dynamically multiple heuristic policies in a set to improve the performances of all of the heuristic policies simultaneously under the guess that the maximizing player has chosen a fixed worst-case policy. Given $\varepsilon$>0, we give the value of the receding horizon which guarantees that the parallel rollout policy with the horizon played by the minimizer “dominates” any heuristic policy in the set by $\varepsilon$, From the hindsight optimization approach, the minimizing player makes a decision based on his expected optimal hindsight performance over a finite horizon. We finally discuss practical implementations of the receding horizon approaches via simulation and applications.

• 한국생산제조학회지
• /
• 제24권2호
• /
• pp.192-197
• /
• 2015

In many fields, the importance of reducing weight is increasing. A product should be designed such that it is profitable, by lowering costs and exhibiting better performance than other similar products. In this study, the mass and deflection of steel structures have to be reduced as objective functions under constraint conditions. To reduce computational analysis time, central composite design(CCD) and D-Optimal are used in design of experiments(DOE). The accuracy of approximate models is evaluated using the $R^2$ value. In this study, the objective functions are multiple, so the non-dominant sorting genetic algorithm(NSGA-II), which is highly efficient, is used for such a problem. In order to verify the validity of Pareto solutions, CAE results and Pareto solutions are compared.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.572-577
• /
• 1992

In this paper, the optimal homing guidance problem is investigated for the general missile/target models described in the state-space. The closed-form solution of the optimal guidance law derived, and its asymptotic properties are studied as the time-to-go goes to infinity or zero. Futhermore, several approximate solutions of the optimal guidance law are suggested for real-time applications.

• 대한기계학회논문집B
• /
• 제29권10호
• /
• pp.1139-1147
• /
• 2005

The shape optimal design of the plate-fin type heat sink with vortex generator is performed to minimize the pressure loss subjected to the desired maximum temperature numerically. Evaluation of the performance function, in general, is required much computational cost in fluid/thermal systems. Thus, global approximate optimization techniques have been introduced into the optimization of fluid/thermal systems. In this study, Kriging method Is used to obtain the optimal solutions associated with the computational fluid dynamics (CFD). The results show that when the temperature .rise is less than 40 K, the optimal design variables are $B_1=2.44\;mm,\;B_2=2.09\;mm$, and t=7.58 mm. Kriging method can dramatically reduce computational time by 1/6 times compared to SQP method so that the efficiency of Kriging method can be validated.

• 한국기계가공학회지
• /
• 제18권3호
• /
• pp.74-81
• /
• 2019

Herein, we performed a comparative study on approximate multi-objective design optimization, to realize a structural design to improve the weight and vibration performances of the knuckle - a car suspension component - considering various load conditions and vibration characteristics. In the approximate multi-objective optimization process, a regression meta-model was generated using the response surfaces method (RSM), while Kriging and back-propagation neural network (BPN) methods were applied for interpolation meta-modeling. The Pareto solutions, multi-objective optimal solutions, were derived using the non-dominated sorting genetic algorithm (NSGA-II). In terms of the knuckle design considered in this study, the characteristics and influence of the meta-model on multi-objective optimization were reviewed through a comparison of the approximate optimization results with the meta-models and the actual optimization.

• 대한기계학회논문집A
• /
• 제39권5호
• /
• pp.535-541
• /
• 2015

본 연구에서는 벽걸이 모니터 브라켓 암의 다중목적 근사최적설계를 수행하였다. 이를 위해 브라켓 암의 자유도를 고려하여 평면내의 회전 각도를 선정해 응력과 처짐량이 크게 발생하는 경우에 대한 최적화 문제를 정식화 하였다. 직교배열표와 반응표면법을 사용하여 평균 및 파라미터 분석을 통해 성능지수에 대한 설계변수 민감도를 확인하였으며, 중심합성계획법과 D-최적 계획법을 사용하여 목적함수와 제한조건함수에 대하여 반응표면 근사모델을 생성하고 $R^2$ 값을 통해 정확도를 평가하였다. 이를 비지배 분류 유전알고리즘에 적용하여 최적화를 수행하고 유한요소해석을 통해 검증하였다. 또한, 중심합성 계획법과 D-최적 계획법을 이용한 최적해를 비교 분석하였다.

• 대한수학회지
• /
• 제52권2호
• /
• pp.349-372
• /
• 2015

This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제26권2호
• /
• pp.76-107
• /
• 2022

In this paper, we study the temporal decay of global weak solutions to the inhomogeneous Hall-magnetohydrodynamic (Hall-MHD) equations. First, an approximation problem and its weak solutions are obtained via the Caffarelli-Kohn-Nirenberg retarded mollification technique. Then, we prove that the approximate solutions satisfy uniform decay estimates. Finally, using the weak convergence method, we construct weak solutions with optimal decay rates to the inhomogeneous Hall-MHD equations.

• 한국기계가공학회지
• /
• 제15권3호
• /
• pp.8-14
• /
• 2016

Medical bed head consoles (BHC) are generally used to increase the efficiency of medical equipment and speed the medical treatment response time. The BHC design has been consistently improved including a movable shelf unit that is embedded to mount stably medical instruments on the lower part of the main console. The cost of a BHC can be reduced through design optimization to limit the overall weight. However, as the size of a head console might decrease due to design optimization, the BHC deflection could be increased. In this study, multi-objective optimal design was adopted to consider this BHC design problem. In order to reduce the cost of optimization planning, an approximate model was applied for the design optimization. In the context of approximate optimization, we used the response surface method and non-dominant sorting genetic algorithm developed from various fields. Multi-objective optimal solutions were also compared with a single objective optimal design.

• 한국항공운항학회지
• /
• 제16권2호
• /
• pp.21-27
• /
• 2008

An inverse method is introduced to construct the problem for the error analysis of the numerical solution of initial value problem. These problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The process leading to the exact solution makes use of an initially available approximate numerical solution. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. Using this special case exact solution, it is possible to investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution.