• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.99-106
• /
• 2010

In the anti-submarine warfare, a search using HMS is used as a basic strategy. The importance of HMS operation strategy is increasing, but it is hard to develop effective anti-submarine search strategy due to reciprocal actions among sea environments, search patterns, sonar operational tactics, anti-submarine search strategy, etc. In this research, a simulator was invented so as to analyze anti-submarine search patterns used when an HMS-carrying ship searches for submarine in various anti-submarine search environments. The simulator reflects various factors that influence anti-submarine search, and with consideration of search patterns of anti-submarine ships as well as evasive movement of submarines, it can simulate various anti-submarine search operations such as a collaborative anti-submarine operation by a single or multiple forces. Also, the simulator will contribute to developing and improving systematic and efficient HMS operational tactics in anti-submarine warfare.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.6
• /
• pp.877-885
• /
• 2018

The anti-submarine helicopter is the most effective weapon system in anti-submarine warfare. Recently changes in the introduction of the anti-submarine warfare sonar system are expected to operate multi-static sonar equipment of the anti-submarine helicopter. Therefore, it is required to study the operational concept of multi-static of anti-submarine helicopter. This paper studies on the optimal search of multi-static based on anti-submarine helicopter considering Furthest On Circles(FOC). First, the deployment of the sensors of the anti-submarine helicopter is optimized using genetic algorithms. Then, the optimized model is extended to consider FOC. Finally, the proposed model is verified by comparing pattern-deployment the search method in Korean Navy.

• Journal of the Korea Society for Simulation
• /
• v.23 no.1
• /
• pp.33-42
• /
• 2014

In this paper we analyzed the search patterns for the anti-submarine warfare (ASW) surface ships cooperating with ASW helicopters. For this purpose, we modeled evasive motion of a submarine with a probabilistic method. And maneuvers and search actions of ships and helicopters participating in the anti-submarine search mission are designed. And for each simulation scenario, the case where a ship and a helicopter searches a submarine independently according to its optimized search pattern is compared with the case where the search platforms participate in the ASW mission cooperatively. Based on the simulation results, we proposed the reconfigured search patterns that help cooperative ASW surface ships increase the total cumulative detection probability (CDP).

• Journal of the Korea Society for Simulation
• /
• v.20 no.2
• /
• pp.59-66
• /
• 2011

In this paper, a method to allocate a submarine search mission to an ASW(Anti-Submarine Warfare) helicopter is proposed. The aim of the proposed method is to increase the submarine detection capability. For this purpose, we modeled the behaviors that the ASW helicopter conduct during the search mission, and the relations between the behaviors are also modeled. To measure quantitatively the effectiveness of ASW search mission, the measure of effectiveness(MOP) is defined. Scenarios are designed to analyze the effectiveness utilizing the ASW mission model. We conducted simulations applying the designed scenarios and some parameters concerned with the friendly ship and the enemy submarine interacting each other in the ASW missions. We analyzed the result of simulation depending on the dipping interval and the pattern of dipping positions in the situation that the helicopter operates for a long time and should resupply several times on the friendly ship. From the analyzed data, we suggested the practical value of ratio between the detectable range of the sonar and the dipping interval to improve the effectiveness of ASW mission.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.204-210
• /
• 2010

The tactical effectiveness, which is the result of applying decision-making algorithms to respond a specific situation with weapons and sensors, is required to analyze according to the integrated combat situation, because each situation, which is intimately involved with each other, influences the surface ship to complete missions successfully. However, the tactical effectiveness have been analyzed in separation of each tactical situation due to the complexity of the integrated tactical situation. This paper is originated from the needs for analyzing the anti-submarine search region of the surface ship after it evades the torpedo by operation of the torpedo countermeasure tactics. It also describes simulation results of effectiveness analysis for the search patterns in the search region.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.2
• /
• pp.225-234
• /
• 2018

In this paper, we consider a problem of partitioning a search area into smaller rectangular regions, so that multiple platforms can conduct search operations independently without requiring unnecessary coordination among themselves. The search area consists of cells where each cell has some prior information regarding the probability of target existence. The detection probability in particular cell is evaluated by multiplying the observation probability of the platform and the target existence probability in that cell. The total detection probability within the search area is defined as the cumulative detection probability for each cell. However, since this search area partitioning problem is NP-Hard, we decompose the problem into three sequential phases to solve this computationally intractable problem. Additionally, we discuss a special case of this problem, which can provide an optimal analytic solution. We also examine the performance of the proposed approach by comparing our results with the optimal analytic solution.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.824-830
• /
• 2010

It is not easy job to find a underwater target using sonar system in the ASW operations. Many researchers have tried to solve anti-submarine search problem aiming to maximize the probability of detection under limited searching conditions. The classical 'Search Theory' deals with search allocation problem and search path problem. In both problems, the main issue is to prioritize the searching cells in a searching area. The number of possible searching path that is combination of the consecutive searching cells increases rapidly by exponential function in the case that the number of searching cells or searchers increases. The more searching path we consider, the longer time we calculate. In this study, an effective algorithm that can maximize the probability of detection in shorter computation time is presented. We show the presented algorithm is quicker method than previous algorithms to solve search problem through the comparison of the CPU computation time.