• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.4
• /
• pp.337-345
• /
• 2020

The Weapon-Target Assignment(WTA) problem can be formulated as an optimization problem that minimize the threat of targets. Existing methods consider the trade-off between optimality and execution time to meet the various mission objectives. We propose a multi-agent reinforcement learning algorithm for WTA based on mean field game to solve the problem in real-time with nearly optimal accuracy. Mean field game is a recent method introduced to relieve the curse of dimensionality in multi-agent learning algorithm. In addition, previous reinforcement learning models for WTA generally do not consider weapon interference, which may be critical in real world operations. Therefore, we modify the reward function to discourage the crossing of weapon trajectories. The feasibility of the proposed method was verified through simulation of a WTA problem with multiple targets in realtime and the proposed algorithm can assign the weapons to all targets without crossing trajectories of weapons.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.11 no.2
• /
• pp.234-242
• /
• 1987

The solution of shape design problems based on variational analysis has been approached by using the domain adaptive method. The objective of the structural shape design is to minimize the weight within a bound on local stress measure, or to minimize the maximum local stress measure within a bound on the weight. A derived optimality condition in both design problems requires that the unit mutual energy has constant value along the design boundary. However, the condition for constant stress on the design boundary was used in computation since the computed mutual energy oscillates severely on the boundary. A two step iteration scheme using domain adaptation was presented as a computational method to slove the example designs of elastic structures. It was also shown that remeshing by grid adaptation was effective to reduce oscillatory behavior on the design boundary.

• Journal of Information Technology Services
• /
• v.8 no.3
• /
• pp.209-221
• /
• 2009

The successful mass media drama, 'The 1st Shop of Coffee Prince', has received lots of supports from the audience by showing them a vivid life and also enabling them to dream a real fantasy. One among the most powerful strategies that made this drama stay successful is the marketing value of the drama space fully maximized when doing the production. This study, introducing a unique representation of 2-D cell matrix with x-y plots of drama space set along the time stream following the scenario, first proposes a quantitative way of uncovering the hidden relation between drama space and scenario using nonlinear matrix filtering method and, secondly, suggests possible service designs mainly constrained by economical standpoints of the stakeholder in producing the drama. The methodology may invoke a plausible contradiction with art instincts that have hardly been supposed to be affected by financial debate, which, nevertheless, must sometimes be allowed under the circumstance of pursuing optimality in programming and producing the drama that must survive in the world of competitive market of service business.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.165-173
• /
• 2002

In the static channel assignment scheme for cellular mobile computing environment, each cell has a fixed number of channels and supports a service for a user′s request entering to the cell. This scheme has an advantage of simplicity. However, this scheme has a disadvantage that can′t control far hot cell problem. Therefore, to solve this problem, the "channel borrowing" concept is needed. In this paper, we propose a load balancing(channel borrowing, channel reassignment) approach using genetic algorithm. The purposes of using genetic algorithm in this paper are ${\circled1}$ to find early a cell including an available channel and ${\circled2}$ to decrease a number of probings and ${\circled3}$ to migrate to the cell after searching an available channel near upon optimality. To represent effectiveness of the proposed algorithm, we simulated various experiments.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.80-89
• /
• 2009

A fast and efficient search algorithm to determine an optimal number of clusters in clustering algorithms is presented. The method is based on cluster validity index which is a measure for clustering optimality. As the clustering procedure progresses and reaches an optimal cluster configuration, the cluster validity index is expected to be minimized or maximized. In this Paper, a fast non-exhaustive search method for finding the optimal number of clusters is designed and shown to work well in clustering. The proposed algorithm is implemented with the k-mean++ algorithm as underlying clustering techniques using CB and PBM as a cluster validity index. Experimental results show that the proposed method provides the computation time efficiency without loss of accuracy on several artificial and real-life data sets.

• Annual Conference of KIPS
• /
• 2015.04a
• /
• pp.741-744
• /
• 2015

최근 소셜 미디어를 이용한 대량의 데이터로부터 사용자의 의사결정을 지원하기위한 맞춤형 데이터 추천 서비스가 관심을 받고 있으며 사용자의 선호도에 근접한 데이터 추천기법으로 스카이라인 질의가 연구되어왔다. 그러나 기존의 스카이라인 질의는 데이터의 정적속성(위도, 경도, 가격 등)만을 기준으로 모든 사용자에게 동일한 데이터를 반환하기 때문에 맞춤형 데이터를 추천하기 어렵다. 본 논문에서는 사용자의 기호에 대한 정밀도를 높이기 위해 정적속성에서 동적속성(계산속성)을 유도하는 분기한정 동적 스카이라인 질의 기법(Branch and Bound Dynamic Skyline, BBDS)을 구현하였다. 시뮬레이션에서는 대규모 데이터 및 다양한 분포에 따른 실험을 수행한 결과 BBDS가 기존 기법에 비해 데이터 탐색과 추천에 있어서 향상된 성능을 나타내는 것으로 평가되었다.

• Cross-Cultural Studies
• /
• v.30
• /
• pp.97-124
• /
• 2013

For a long period, vowel reduction has been accepted as one of the most common pronunciation rules in Russian phonology. However, since the rules have been modified in many ways after the influx of loanwords, [a, e, i, o, u, ${\star}$]-including [e, o]-can now be pronounced in unstressed position, obeying the rule of vowel reduction. Especially in Modern Russian, along with the destruction of the consonant pronunciation norm due to some relatively complex changes it underwent palatalization, consonant pronunciation has been simplified, and as a response to such a phenomenon, the specialization of vowel pronunciation rule is now occurring. In other words, in the interrelation between consonants and vowels, as the pronunciation rules for consonants are simplified and thus the contrast between consonants is weakened, the degree of dependence on pronunciation of segment in the vowel pronunciation rule has been elevated. Therefore, the analysis says that the degree of vowel reduction depends on a vowel's distance from a stressed syllable is not enough; the influence of surrounding phonemes-including consonants-or the formative characteristics of words themselves should also be considered. The introduction of Max-noncorner/UnderLex, a/an Licence constraint that is related to non-declension nouns, and that of IdentC[back] and ShareCV[back], which are faithfulness constraint and share constraint respectively that are related to the nature of consonants stresses that vowel pronunciation rules should not be simply viewed as rules for vowels; The rules should be analyzed with emphasis on their correlation with surrounding phonemes.

• Journal of Power Electronics
• /
• v.19 no.4
• /
• pp.835-845
• /
• 2019

This paper presents a robust-optimal control strategy to improve the output-voltage error-tracking and control capability of a DC-DC boost converter. The proposed strategy employs an optimized Fractional-order Proportional-Integral (FoPI) controller that serves to eliminate oscillations, overshoots, undershoots and steady-state fluctuations. In order to significantly improve the error convergence-rate during a transient response, the FoPI controller is augmented with a pre-stage nonlinear error-modulator. The modulator combines the variations in the error and error-derivative via the signed-distance method. Then it feeds the aggregated-signal to a smooth sigmoidal control surface constituting an optimized hyperbolic secant function. The error-derivative is evaluated by measuring the output-capacitor current in order to compensate the hysteresis effect rendered by the parasitic impedances. The resulting modulated-signal is fed to the FoPI controller. The fixed controller parameters are meta-heuristically selected via a Particle-Swarm-Optimization (PSO) algorithm. The proposed control scheme exhibits rapid transits with improved damping in its response which aids in efficiently rejecting external disturbances such as load-transients and input-fluctuations. The superior robustness and time-optimality of the proposed control strategy is validated via experimental results.

• Nuclear Engineering and Technology
• /
• v.51 no.3
• /
• pp.825-836
• /
• 2019

One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

• Knowledge Management Research
• /
• v.20 no.3
• /
• pp.39-47
• /
• 2019

Response surface methodology (RSM) is a group of statistical modeling and optimization methods to improve the quality of design systematically in the quality engineering field. Its final goal is to identify the optimal setting of input variables optimizing a response. RSM is a kind of knowledge management tool since it studies a manufacturing or service process and extracts an important knowledge about it. In a real problem of RSM, it is a quite frequent situation that considers multiple responses simultaneously. To date, many approaches are proposed for solving (i.e., optimizing) a multi-response problem: process capability function approach, desirability function approach, loss function approach, and so on. The process capability function approach first estimates the mean and standard deviation models of each response. Then, it derives an individual process capability function for each response. The overall process capability function is obtained by aggregating the individual process capability function. The optimal setting is given by maximizing the overall process capability function. The existing process capability function methods usually use the arithmetic mean or geometric mean as an aggregation operator. However, these operators do not guarantee the Pareto optimality of their solution. Moreover, they may bring out an unacceptable result in terms of individual process capability function values. In this paper, we propose a maximin-based process capability function method which uses a maximin criterion as an aggregation operator. The proposed method is illustrated through a well-known multiresponse problem.