An Optimal Path Planning for Survival Rate Maximization of Submarine

잠수함 생존율 극대화를 위한 최적 이동경로 계획

  • 김기태 (국방대학교 운영분석학과) ;
  • 박세훈 (국방대학교 국방관리학과) ;
  • 조성진 (국방대학교 운영분석학과) ;
  • 전건욱 (국방대학교 운영분석학과)
  • Received : 2010.11.04
  • Accepted : 2010.11.29
  • Published : 2010.12.31

Abstract

The submarine is very threatening and secretive weapon system that achieves missions under the sea. However, the submarine is faced with danger that can be attacked from the enemy when is detected by sensor or rose to the surface. This study will be planned optimal path to maximize the survival rate that considers submarine navigation capability in underwater and search activity of hostile warships. A mathematical programming model and a heuristic algorithm will be suggested in this study. The mathematical programming model is verified by using ILOG CPLEX. The submarine path, unit time(distance) of navigation, survival rate, and computation time is computed by using a heuristic algorithm.

잠수함은 수중에서 임무를 수행하며, 은밀성을 강점으로 하는 매우 위협적인 무기 체계이다. 하지만 잠수함 센서에 의해 탐지되거나 수면 위로 부상하여 노출될 경우 적으로부터 공격을 받을 수 있는 위협에 직면하게 된다. 본 연구는 적 수상함정의 탐색활동과 잠수함의 잠항능력을 고려하여 생존율을 극대화하는 최적의 이동경로를 계획하였다. 잠수함의 생존율을 극대화하기 위한 이동경로 계획 수리모형을 구축하고, ILOG CPLEX를 이용하여 수리모형을 검증하였다. 잠수함의 생존율을 보장하고, 목표지점으로 이동하기 위한 휴리스틱 알고리즘을 이용하여 이동경로, 이동 단위시간(거리), 생존율, 계산시간을 도출하였다.

Keywords

References

  1. 해군본부, "해군군사용어사전," 2007.
  2. 해군본부, "해군규정 제3권(해군 해양.음향업무 규정)," 2009.
  3. Baston, V. J. and F. A. Bostok, "A One-Dimensional Helicopter-Submarine Game," Naval Research Logistics, Vol.36, No.4(1989), pp.479-490. https://doi.org/10.1002/1520-6750(198908)36:4<479::AID-NAV3220360410>3.0.CO;2-7
  4. Carlyle, W. M., J. O. Royset, and R. K. Wood, "Routing Military Aircraft with a Constrained Shortest-path Algorithm," Naval Postgraduate School, 2007.
  5. Cho, S. J., "Fast Heuristic Algorithm for the Constrained Paths Moving Target Search Problems," Seoul National University, Ph.D. Thesis, 2008
  6. Chuan, E. C., "A Helicopter Submarine Search Game," Naval Postgraduate School, Master's Thesis, 1988.
  7. Danskin, J. M, "A Helicopter Versus Submarine Search Game," Operations Research, Vol.16, No.3(1968), pp.509-517. https://doi.org/10.1287/opre.16.3.509
  8. Hohzaki, R. and K. Iida, "Optimal Strategy of Route and Look for the Path Constrained Search Problem with Reward Criterion," European Journal of Operational Research, Vol.100, No.1(1997), pp.236-249. https://doi.org/10.1016/S0377-2217(96)00167-1
  9. Hong, S. P., S. J. Cho, and M. J. Park, "A Pseudo-polynomial heuristic for Path- constrained Discrete-time Markovian- target Search," European Journal of Operational Research, Vol.193, No.2(2009), pp.351-364. https://doi.org/10.1016/j.ejor.2007.10.048
  10. Hong, S. P., S. J. Cho, M. J. Park, and M. G. Lee, "Optimal Search-relocation Trade-off in Markovian-target Searching," Computers and Operations Research, Vol.36, No.6(2009), pp.2097-2104. https://doi.org/10.1016/j.cor.2008.07.007
  11. Kim, B. S., C. K. Ryoo, H. C. Bang, and E. H. Chung, "Optimal Path Planning for UAVs under Multiple Ground Threats," Journal of the Korean Society for Aeronautical and Space Sciences, Vol.34, No.1(2006), pp.74-80. https://doi.org/10.5139/JKSAS.2006.34.1.074
  12. Pollock, S. M., "A Simple Model of Search for a Moving Target," Operations Research, Vol.18, No.5(1970), pp.883-903. https://doi.org/10.1287/opre.18.5.883
  13. Randal, W. B., W. M. Timothy, and G. Michael, "Coordinated Target Assignment and Intercept for Unmanned Air Vehicles," IEEE Transactions on Robotics and Automation, Vol.18, No.6(2002), pp.80-91.
  14. Scott A. B., "Path Planning for UAVs," Proceedings of the American Control Conference, Chicaco, Illinois, 2000.
  15. Shupenus, J. and D. Barr, "Information Loss due to Target Mobility," Military Operations Research, Vol.4(2000), pp.31-43.
  16. Thomas, L. C. and A. R. Washburn, "Dynamic Search Games," Operations Research, Vol.39, No.3(1991), pp.415-422. https://doi.org/10.1287/opre.39.3.415
  17. Washburn A. R. and R. Hohzaki, "The Diesel Submarine Flaming Datum Problem," Military Operations Research, Vol.6, No.4(2001), pp.19-30. https://doi.org/10.5711/morj.6.4.19