• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.591-594
• /
• 2004

항공기 정비는 고도의 기술과 많은 노력, 시간을 필요로 한다. 첨단화 되어가는 항공무기체계에 따라 정비작업도 고도화되어 가면서 시간과 작업량이 늘어나게 되고 정비사 부족 문제를 않고 있는 현시점에서는 업무량은 과중되어 질 수 밖에 없다. 하지만 현재 공군에서는 보다 체계적이고 효율적인 정비사들의 업무 할당에 대한 시스템이나 절차가 없었다. 본 연구는 항공기의 비행스케줄에 따른 정비사들의 정비 시간을 균등히 할당함으로써 업무의 효율을 높이고 향후 정비사들의 스케줄 관리를 위한 지침을 제공하는데 그 목적이 있다. 현재 공군에 있는 실질적인 자료를 가지고 실험을 하여 입력 자료에 대한 현실성을 보다 높였으며, 수학적 모델링을 통하여 구축된 스프레드시트 모형을 가지고 인원할당과 근무시간 할당을 위한 최적의 시스템을 palisade사의 evolver를 사용하여 구축하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.540-548
• /
• 2012

The Weapon Target Allocation(WTA) problem is the NP-Complete problem. The WTA problem is that the threatful air targets are assigned by weapon of allies for killing the targets. A good solution of NP-complete problem is heuristic algorithms. Genetic algorithms are commonly used heuristic for global optimization, and it is good solution on the diverse problem domain. But there has been very little research done on the generation of their initial population. The initialization of population is one of the GA step, and it decide to initial value of individuals. In this paper, we propose to the population initialization method to improve a Genetic Algorithm. When it initializes population, the proposed algorithm reflects the characteristics of the WTA problem domain, and inherits the dominant gene. In addition, the search space widely spread in the problem space to find efficiently the good quality solution. In this paper, the proposed algorithm to verify performance examine that an analysis of various properties and the experimental results by analyzing the performance compare to other algorithms. The proposed algorithm compared to the other initialization methods and a general genetic algorithm. As a result, the proposed algorithm showed better performance in WTA problem than the other algorithms. In particular, the proposed algorithm is a good way to apply to the variety of situation WTA problem domain, because the proposed algorithm can be applied flexibly to WTA problem by the adjustment of RMI.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.4
• /
• pp.287-295
• /
• 2022

As low altitude long-range artillery threat has been strengthened, the development of anti-artillery interception system to protect assets against its attacks will be kicked off. We view the defense of long-range artillery attacks as a typical dynamic weapon target assignment (DWTA) problem. DWTA is a sequential decision process in which decision making under future uncertain attacks affects the subsequent decision processes and its results. These are typical characteristics of Markov decision process (MDP) model. We formulate the problem as a MDP model to examine the assignment policy for the defender. The proximity of the capital of South Korea to North Korea border limits the computation time for its solution to a few second. Within the allowed time interval, it is impossible to compute the exact optimal solution. We apply approximate dynamic programming (ADP) approach to check if ADP approach solve the MDP model within processing time limit. We employ Shoot-Shoot-Look policy as a baseline strategy and compare it with ADP approach for three scenarios. Simulation results show that ADP approach provide better solution than the baseline strategy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1415-1421
• /
• 2016

There are considerable concern on the methods for the efficient utilization of the test-resources as increasing of the number of the tests for functionality and performance verification of weapon systems. Furthermore, with an increase in the complexity of the resource assignment the decision support is required. Test resource allocation is basically the same problems as conventional NP-hard FJSP(Flexible Job Shop Problem), therefore empirical test resource allocation method that has been used in many decades is limited in the time performance. Although research has been conducted applying the genetic algorithm to the FJSP, it is limited in the test resource allocation domain in which more than one machine is necessary for a single operation. In this paper, a variable group genetic algorithm is proposed. The algorithm is expected to improve the test plan efficiency by automating and optimizing the existing manual based allocation. The simulation result shows that the algorithm could be applicable to the test plan.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.3
• /
• pp.255-259
• /
• 2013

To evaluate the suitability of the Weaponeering tool for the Surface to Surface Guided Missile at the Above-Ground Buildings, we analyzed the relation among SSPD, $MAE_{bldg}$, CEP and the number of missiles, expected damage etc.. According to the analysis, if the target Length is 100m, and $\sqrt{MAE_{bldg}}$ is longer than the target length, the tool is suitable but shorter than it, the tool is not suitable. So Morris Driels's Weaponeering Tool needs new adaptive algorithm to Translate as the Target size and $MAE_{bldg}$.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.295-297
• /
• 2005

CEC, 근접방어무기체계, 지휘통제체계 등에 사용되는 위협평가시스템은 자동위협평가, 방어구역 위협지수, 무기할당 등의 공통된 기능을 포함하고 있고, 시스템 환경의 변화 또는 성능 향상에 따라 수시로 업그레이드가 요구된다. 따라서 본 논문에서는 생산성 향상과 중복투자 방지로 인한 비용감소 효과를 거둘 수 있는 제품계열 방법론을 위협평가시스템 개발에 적용하는 방안을 제안한다. 위협평가시스템의 제품계열 방법론 적용을 위해 핵심자산 개발 프로세스를 수행하여 제품계열 영역지정, 핵심자산, 제품계획을 정의한다. 제품계열 영역지정은 Feature 모델링을 이용하여 공통점과 차이점을 식별하고, 핵심자산은 아키텍처 설계 중심으로, 그리고 각 핵심자산의 부착 프로세스를 종합하여 제품계획을 수립한다.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2808-2814
• /
• 2012

The most of military systems that developed today are composed with many sub-systems for mission execution. The test of military systems for delivery test of mass product such that part test, PCB test, component test, integration test. Improving productivity is minimize testing item by man and minimize kind of tester, so that decrease product cost by production time for test. PCB tester be developed many kind of test method that systems were developed by many different engineers. This article studies testing check point for testing that how to minimize of kind of tester, how to automatic test for all of function that have inputs and outputs. Development of tester for improving productivity requires classify functional allocation of main system and sub system, sub system require PCB for functional allocation start on preliminary design period for reducing testing item and testing fixture.

• Proceedings of the Korea Contents Association Conference
• /
• 2019.05a
• /
• pp.269-270
• /
• 2019

무장 비행 궤적 간 간섭을 식별하여 아군 무장간 충돌을 방지함으로써 단위 시간 당 교전 효과를 극대화하는 것은 다무장 대지 무기체계 운용에 있어서 필수적이다. 기존 연구에서는 연산 부하의 최소화를 목표로 3차원 무장 비행 궤적을 2차원 평면의 사격선으로 변환하여 간섭을 식별하는 알고리즘을 제안하였다. 그러나 기존 연구는 2차원 평면에서 사격선간 교차점이 발생할 경우 간섭으로 식별하고, 이에 대한 무장 할당을 해제함으로써 무장 활용도를 감소시키는 문제가 있었다. 이를 고려하여 본 논문에서는 교전 효과 최대화를 위한 효율적인 무장 궤적 간 간섭 식별 알고리즘을 제안한다. 제안하는 알고리즘은 2차원 평면에서 사격선간 교차점이 발생할 경우, 해당 사격선을 3차원 평면에서 비행 궤적 간 비교 연산을 수행하여 실제 간섭 여부를 식별함으로써 무장 활용도를 최대화하는 것이 가능하다. 성능 평가 결과, 제안하는 기법은 기존 기법에 비해 궤적 교차수는 최대 52.1% 감소하였으며, 그에 따른 표적 할당율은 최대 6.9% 향상됨을 보임으로써 그 우수성을 확인하였다.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.6
• /
• pp.733-738
• /
• 2009

In this paper, we have proposed the design and implementation for efficient Command Control and Alert(C2A). Information fusion must be done for knowing the state and identification of targets using multi-sensor. The threat priority of targets which are processed and identified by information fusion is calculated by air-defence operation logic. The threat targets are assigned to the valid and effective weapons by nearest neighborhood algorithm. Furthermore, the assignment result allows operators to effectively operate C2A by providing the operators with visualizing symbol color and the assignment pairing color line. We introduce the prototype which is implemented by the proposed design and algorithm.