대잠전 의사결정지원 시스템에서 표적 탐색 논리 연구

A Study on the Target Search Logic in the ASW Decision Support System

  • 조성진 (국방대학교 군사운영분석) ;
  • 최봉완 (해군 전력분석시험평가단 체계분석처) ;
  • 전재효 (해군 전력분석시험평가단 체계분석처)
  • 투고 : 2010.07.08
  • 심사 : 2010.09.10
  • 발행 : 2010.10.05

초록

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.

키워드

참고문헌

  1. Ahuja, R. K., Magnanti, T. and Orlin, J. B., "Network Flows(Theory, Algorithms, and Applications)", Prentice Hall, INC., 1993.
  2. Koopman, B. O., "Search and Screening : General Principles with Historical Applications", Military Operations Research Society, Alexandria, Virginia, USA, 1999.
  3. Morse, P. M. and Kimball, G. E., "Methods of Operations Research", The MIT Press, Cambridge, Massachusetts, USA, 1970.
  4. Waddington, C. H., "O.R. in World War 2 : Operational Research Against the U-boat", Paul Elek (Scientific Books) Ltd., London, England, 1973.
  5. Dell, R. F., Eagle, J. N., Martins, G. H. A. and Santos, A. G., "Using Multiple Searchers in Constrained-Path, Moving-Target Search Problem", Naval Research Logistics, Vol. 43, pp. 463-480, 1996. https://doi.org/10.1002/(SICI)1520-6750(199606)43:4<463::AID-NAV1>3.0.CO;2-5
  6. Hong, S. P., Cho, S. J. and Park, M. J., "A Pseudo-Polynomial Heuristic for Path-Constrained Discrete-Time Markovian- Target Search", European Journal of Operational Research, Vol. 193, pp. 351-364, 2009. https://doi.org/10.1016/j.ejor.2007.10.048
  7. Richardson, H. R. and Stone, L. D., "Operations Analysis During the Underwater Search for Scorpion", Naval Research Logistics, Vol. 18, pp. 141-157, 1971. https://doi.org/10.1002/nav.3800180202
  8. Trummel, K. E. and Weisinger, J. R., "The Complexity of the Optimal Search Path Problem", Operations Research, Vol. 34, pp. 324-327, 1986. https://doi.org/10.1287/opre.34.2.324
  9. Frost, J. R. and Stone, L. D., "Review of Search Theory : Advances and Applications to Search and Rescue Decision Support", Technical Report, (CG-D-15-01), U.S. Coast Guard Research and Development Center, 2001.
  10. 신내호, 오명호, 최호림, 정동윤, 이용웅, "지형공간정보 기반의 침투위험도 예측 모델을 이용한 최적 침투지역 분석", 한국군사과학기술학회지, 제12권 제2호, pp. 199-205, 2009년 4월.
  11. 장인갑, 홍정식, 김지표, 이창훈, "이동 통신망에서 방향성을 지닌 2개의 연속적 위치 영역을 이용한 예측 위치 관리 전략", 한국경영과학회지, 제33권 제3호, pp. 43-58, 2008년 9월.
  12. 조성진, "제한된 경로를 가지는 이동-표적 탐색 문제에 대한 휴리스틱 알고리듬 연구", 박사학위논문, 서울대학교 대학원, 2008년.