• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.6
• /
• pp.521-528
• /
• 2021

In order to allocate an appropriate interceptor weapon to an air track for which the threat assessment has been completed, it is necessary to evaluate the suitability of engagement in consideration of the expected point of engagement. In this thesis, a method of calculating the kill probability is proposed according to the position in the engagement space using Bayesian theorem with multivariate attribute information such as relative distance, approach azimuth angle, and altitude of the air track when passing through the engagement space. As a result of the calculation, it was confirmed that the distribution form of the kill probability value for each point in the engagement space follows a multivariate normal distribution based on the optimal predicted intercepting point. It is expected to be applicable to the engagement suitability evaluation of the engagement space.

• Korean Management Science Review
• /
• v.27 no.1
• /
• pp.75-90
• /
• 2010

In this paper, we proposed new solution procedure of the air defense missile allocation problem. In order to find the optimal location of missile, we formulated a simple mathematical model maximizing the kill probability of enemy air threat including aircraft and missile. To find the Kill probability, we developed a new procedure using actual experimental data in the mathematical model. Actual experimental data mean real characteristic factor, which was acquired when the missile had been developed through missile fire experiment. The result of this study can offer practical solution for missile allocation and the methodology in this study can be used to the decision making for the optimal military facility allocation.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.55-58
• /
• 2003

본 논문에서는 유전자 알고리즘을 이용한 무장할당 문제를 제안하였다. 무장할당이란 적의 공격으로부터 방어대상물의 손상을 최소화하거나 적의 공격물 또는 표적의 격추 확률이 최대가 되도록 표적에 대한 방어무기의 적절한 할당을 목적으로 하는 최적화 문제로서, 본 논문에서는 무장할당 문제에 전역 최적화의 강점을 가진 유전자 알고리즘을 적용하였다. 무장할당문제에 적합한 유전자 알고리즘 형태와 파라메타를 선정하는 방법을 제시하였고, 시뮬레이션을 통해서 기존의 전통적인 최적화 기법과의 성능 비교를 수행한 결과, 제안된 방법이 우수함을 입증하였다.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.115-119
• /
• 2008

본 연구는 휴대용 게임기에서 가상현실(Virtual Reality)을 구현한 비행기 시뮬레이션 게임을 대상으로 상황인식(Situation Awareness), 수행도(Performance), 현실감(Presence)을 측정하여 세 측정 지표의 상관관계를 분석하였다. 상황인식 측정은 SAGAT (Situation Awareness Global Assessment Technique)을 이용하였고, 수행도는 분당 격추 시킨 적기 수를 기준으로 측정하였다. 현실감은 Presence Questionnaire (Version 3.0) 기법을 통해 측정하였다. 실험 결과 상황인식 2 단계와 3 단계의 능력이 좋을수록 현실감이 증가하는 경향을 보여 상황인식 능력과 현실감에 밀접한 연관이 있다는 기존 연구와 동일한 결과가 휴대용 게임기에서도 일어남을 밝혀냈다. 또한 상황인식 2 단계와 3 단계의 능력이 증가할수록 수행도도 같이 증가하는 경향이 있어 좋은 상황인식 능력이 높은 수행도를 가질 확률을 증가시킨다는 기존의 연구 결과를 뒷받침할 수 있었다. 현실감과 수행도의 관계는 본 실험 결과에서 서로 연관이 있는지 결정하기 어려웠다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.5
• /
• pp.539-544
• /
• 2003

The weapon-target assignment problem is solved using a genetic algorithm in this paper. The weapon-target assignment is an optimization problem which minimizes damages from enemy s attack or maximizes the kill probability of targets. Genetic algorithm is applied in this paper since it usually converges to a near global optimal solution. A specific structure of genetic algorithm which is suitable for the weapon-target assignment problem is proposed. A guideline selecting associated parameters is investigated through simulations. Comparition of the proposed method with several traditional optimization techniques for the weapon-target assignment problem shows the validity of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.2
• /
• pp.183-191
• /
• 1997

A neural network-based algorithm for the static weapon-target assignment (WTA) problem is Presented in this paper. An optimal WTA is one which allocates targets to weapon systems such that the total expected leakage value of targets surviving the defense is minimized. The proposed algorithm is based on a Hopfield and Tank's neural network model, and uses K x M processing elements called binary neuron, where M is the number of weapon platforms and K is the number of targets. From the software simulation results of example battle scenarios, it is shown that the proposed method has better performance in convergence speed than other method when the optimal initial values are used.

• Journal of Astronomy and Space Sciences
• /
• v.24 no.2
• /
• pp.135-144
• /
• 2007

Space environment becomes more hazardous for satellite because of increasing number of space debris. This research is to analyze collision hazards between KOMPSAT 3 in low-earth orbit and space debris generated by the explosion of FengYun satellite on the January 11, 2007. Based on the observed data of the space debris from FengYun satellite, the mass and number distribution of the debris are estimated including undetectable debris from the explosion of FengYun satellite. The spatial density and flux for the space debris can be calculated according to size. This study also brings out the analysis for the assessment of collision probability and damage probability. The algorithm developed in the current paper can be used to estimate the level of risk due to space debris for the satellites that will be launched in the future.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.6
• /
• pp.488-496
• /
• 2015

This paper proposes a framework to determine the routes of multiple unmanned aerial vehicles (UAVs) to conduct multiple tasks in different locations considering the survivability of the vehicles. The routing problem can be formulated as the vehicle routing problem (VRP) with different cost matrices representing the trade-off between the safety of the UAVs and the mission completion time. The threat level for a UAV at a certain location was modeled considering the detection probability and the shoot-down probability. The minimal-cost path connecting two locations considering the threat level and the flight distance was obtained using the Dijkstra algorithm in hexagonal cells. A case study for determining the optimal routes for a persistent multi-UAVs surveillance and reconnaissance missions given multiple enemy bases was conducted and its results were discussed.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.4
• /
• pp.354-361
• /
• 2011

In this paper, an efficient defense strategy of single naval ship using short range anti-air missiles against the threat of multiple anti-ship missiles is suggested. The defense logic is based on the estimated future trajectory of anti-ship missiles by using current radar information. The logic is designed to maximize the range of interception of anti-ship missiles so that the chance of interception can be increased although the prior tries turn out to be fail. Basically, the decision making for the allocation of a defense missile is achieved by comparing the total kill probability and the estimated intercepting point. Performance of the proposed logic is investigated by nonlinear planar numerical simulations.