• Journal of the military operations research society of Korea
• /
• v.36 no.1
• /
• pp.15-27
• /
• 2010

Fire sequencing problem is to find a sequence of firing on the targets. The latest, because the korea artillery force is inferior in number as compared with north korea force. It is an important question to give a fatal damage to the enemy force by using prompt and accurate fire in order to overcome the lack of artillery force. Minimizing the fire finishing time will secure the adapt ability in tactical operation. In this paper, we developed a mathematical model to do allocation the fire on the targets to decrease to total fire operation time. In order to work out the fire sequencing problem, MIP is developed and the optimum solution is obtained by using ILOG OPL. If this analytical model is applied to the field artillery unit, it will improve the artillery fire force enhancement.

• Journal of the military operations research society of Korea
• /
• v.33 no.1
• /
• pp.105-115
• /
• 2007

It is essential to give a fatal damage to the enemy force by using prompt and accurate fire in order to overcome the lack of artillery force. During the artillery fire operations, minimizing the firing time will secure the adapt ability in tactical operation. In this paper, we developed a mathematical model to schedule the artillery fire on the multiple targets to decrease total fire operation time. To design a program to describe a real firing situation, we consider many possible circumstances of changes such as commander's intention, firing constraints, target priority, and contingency plan to make a fire plan in an artillery unit. In order to work out the target sequencing problem, MIP is developed and the optimum solution is obtained by using ILOG OPL. If this analytical model is applied to a field artillery unit, it will improve the efficiency of the artillery fire force operations.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.5
• /
• pp.365-372
• /
• 2021

This paper deals with an optimal Weapon-Target Assignment (WTA) algorithm for Closed-In Weapon Systems (CIWS), considering variable burst time. In this study, the WTA problem for CIWS is formulated based on Mixed Integer Linear Programming (MILP). Unlike the previous study assuming that the burst time is fixed regardless of the engagement range, the proposed method utilizes the variable burst time based on the kill probability according to the engagement range. Thus, the proposed method can reflect a more realistic engagement situation and reduce the reaction time of CIWS against targets, compared to the existing method. In this paper, we first reformulate the existing MILP-based WTA problem to accommodate the variable burst Time. The proposed method is then validated through numerical simulations with the help of a commercial optimization tool.

• Defense and Technology
• /
• no.6 s.256
• /
• pp.62-73
• /
• 2000

현대전은 군수면에서의 기술적 우세에 의해 전쟁의 승패가 결정된다는 걸프전의 교훈을 바탕으로, 주요 선진국들은 나름대로의 계획과 형편에 따라 주변기술의 발전과 더불어 주력전차 공격력의 핵심인 사격통제장치를 연구.개발중에 있다. 이러한 주요 선진국들의 사격통제장치 발전추세를 철저하게 분석하여, 우리 군의 현실태와 앞으로의 나아갈 바를 판단할 수 있는 계기를 마련하고, 이에 적극적으로 대처하는 연구.개발 활동과 접근 자세가 내부적으로 더욱 필요하다고 판단된다.

• Proceedings of the Military Operations Research Society of Korea Conference
• /
• 2005.10d
• /
• pp.103-116
• /
• 2005

• The Journal of the Korea Contents Association
• /
• v.18 no.8
• /
• pp.118-126
• /
• 2018

In order to dominate the multiple-targets of high threat in the initial stage of combat, it is necessary to maximize the combat effect by rapidly firing as many weapons as possible within a short time. Therefore, it is mandatory to establish the effective weapon allocation and utilize them for the combat. In this paper, we propose a weapon assignment algorithm for rapid reaction in multi-target and multi-weapon environments. The proposed algorithm maximizes the combat effect by establishing the fire plan that enables the rapid action with the operation of low complexity. To show the superiority of our algorithm, we implement the evaluation and verification of performances through the simulation and visualization of our algorithm. Our experimental results show that the proposed algorithm perform the effective weapon assignment, which shows the high target assignment rate within the fast hour even under the large-scale battle environments. Therefore, our proposed scheme are expected to be highly useful when it is applied to real weapon systems.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.4
• /
• pp.448-455
• /
• 2014

Virtual Fire Control System(VFCS) in attack helicopter is developed. VFCS is comprised of multifunction display, store management computer, mission computer, target acquisition and designation system, mission planning system, weapon simulator and flight simulator. Weapon engagement process under the operational environment of helicopter was considered by using the VFCS. We considered hellfire missile, tow missile, unguided rocket and turret gun. The results of this study will be utilized efficiently on integrated fire control system SIL(System Integration Lab.) in attack helicopter.

• Defense and Technology
• /
• no.1 s.143
• /
• pp.58-65
• /
• 1991

종말유도포탄과 동등한 효과를 올리기 위해서는 센서신관부의 탄약에 의한 사격은 통상 약 3배의 탄두수를 필요로 한다. 그러나 탄가가 약 4분의 1-5분의 1로 싸기 때문에 포탄수의 증가가 비경제적이라기 보다 비용대 효과면에서 오히려 유리하게 된다는 것이다. 수년 전에는 센서신관부의 탄약개발이 국제적으로 유행되어, 서독에서는 Diehi사와 Rheinmetall사가 참가하여 HABICHT 및 ZEPL 계획이라고 하는 2개의 프로젝트가 추진되었다. 그 후 이것은 하나로 통합되어 SMArt 155(155미리 포용 센서신관부 포탄의 약어)가 되었다

• The Journal of the Korea Contents Association
• /
• v.18 no.7
• /
• pp.590-599
• /
• 2018

As a basic information to implement the fire plan that dominates multiple targets effectively under the battle environment with limited resources, such a process is mandatory that gives a priority order to a target with the high level of threat by quantitatively computing the threat level of an individual target through the analysis on the target. However, the study has still remained in the initial level on an evaluation algorithm for the threat level of the ground target. Considering this fact, the present paper proposes the evaluation algorithm for the threat by multiple ground targets. The proposed algorithm has a core point to consider the type of target and protected asset to implement the computation of proximity; set the additional value based on the weights indicating the significance of weapon and protected asset; and compute the threat level of a target that considers the characteristics of the target. The evaluation and verification of performances have been implemented through the simulation and visualization of an algorithm proposed in the present paper. From the performance result, as the proposed algorithm has been able to perform effectively the threat assessment according to the weights indicating the significance of weapons and protected assets under diverse environments where weapons and protected assets are located, high utility and effect are expected when applied to an actual ground weapon system.

• The Journal of the Korea Contents Association
• /
• v.18 no.9
• /
• pp.614-622
• /
• 2018

As multiple weapons are fired simultaneously in multi-target and multi-weapon environments, a possibility always exists in the collision occurred by the intersection between weapon trajectories. The collision between weapons not only hinders the rapid reaction but also causes the loss of the asset of weapons of friendly force to weaken the responsive power against the threat by an enemy. In this paper, we propose an intersection validation and interference elimination algorithm between weapon trajectories in multi-target and multi-weapon environments. The core points of our algorithm are to confirm the possible interference through the analysis on the intersections between weapon trajectories and to eliminate the mutual interference. To show the superiority of our algorithm, we implement the evaluation and verification of performances through the simulation and visualization of our algorithm. Our experimental results show that the proposed algorithm performs effectively the interference elimination regardless of the number of targets and weapon groups by showing that no cross point exists.