한국항공우주학회지 (Journal of the Korean Society for Aeronautical & Space Sciences)

  • 제47권12호
  • /
  • Pages.856-864
  • /
  • 2019
  • /
  • 1225-1348(pISSN)
  • /
  • 2287-6871(eISSN)
한국항공우주학회 (The Korean Society for Aeronautical and Space Sciences)
권호 표지
DOI QR코드

DOI QR Code

동적 무장할당 문제에서의 GRASP 알고리즘 연구

GRASP Algorithm for Dynamic Weapon-Target Assignment Problem

  • 투고 : 2019.08.19
  • 심사 : 2019.10.31
  • 발행 : 2019.12.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

무장할당(Weapon-Target Assignment, WTA) 문제는 다수 위협과 다종의 무장을 효과적으로 할당하는 문제이다. 실제 급변하는 교전환경에서의 무장할당은 위협과 무장의 특성과 위협-무장 선정에 따른 영향성을 모두 고려해야한다. 본 논문에서는 동적 무장할당 문제에서의 최적해 도출을 위해 메타휴리스틱 방법의 일종인 Greedy Randomized Adaptive Search Procedure (GRASP) 알고리즘 적용 방안을 제안한다. 먼저 동적 무장할당 문제를 정의하고 알고리즘 적용을 위해 수학적 모델을 정식화한다. 무장할당 전략을 수립하기 위하여 목적함수를 정의하고 시간변화를 고려한 구속조건을 설정한다. 이를 바탕으로 GRASP 알고리즘을 동적 무장할당 문제에 적용한다. 교전 시뮬레이션을 통해 정식화한 무장할당 문제의 최적해 특성을 분석하며, Monte-Carlo 시뮬레이션을 통해 알고리즘 성능 검증을 수행한다.

The weapon-target assignment (WTA) problem is a matter of effectively allocating weapons to a number of threats. The WTA in a rapidly changing dynamic environment of engagement must take into account both of properties of the threat and the weapon and the effect of the previous decision. We propose a method of applying the Greedy Randomized Adaptive Search Procedure (GRASP) algorithm, a kind of meta-heuristic method, to derive optimal solution for a dynamic WTA problem. Firstly, we define a dynamic WTA problem and formulate a mathematical model for applying the algorithm. For the purpose of the assignment strategy, the objective function is defined and time-varying constraints are considered. The dynamic WTA problem is then solved by applying the GRASP algorithm. The optimal solution characteristics of the formalized dynamic WTA problem are analyzed through the simulation, and the algorithm performance is verified via the Monte-Carlo simulation.

키워드

참고문헌

  1. Cai, H., Liu, J., Chen, Y., and Wang, H., "Survey of the Research on Dynamic Weapon-Target Assignment Problem," Journal of Systems Engineering and Electronics, Vol. 17, No. 3, 2006, pp. 559-565. https://doi.org/10.1016/S1004-4132(06)60097-2
  2. Lloyd, S. P., and Witsenhausen, H. S., "Weapon allocation is NP-complete," Proceedings of the IEEE Summer computer Simulation Conference, 1986, pp. 1054-1058.
  3. Ibaraki, T., and Katoh, N., Resource Allocation Problems, The MIT press, Cambridge, Massachusetts, Handbook of combinatorial optimization, Vol. 2, 1998, pp. 156-260.
  4. Pepyne, D. L., Looze, D. P., Logan, D. A., Sandell, N. R., and LeBlanc, R., "A Decision Aid for Theater Missile Defense," Proceedings of 1997 IEEE International Conference on Evolutionary Computation, April 1997, pp. 563-568.
  5. Lee, Z. J., and Su, S. F., "Efficiently Solving General Weapon-Target Assignment Problem by Genetic Algorithms With Greedy Eugenics," IEEE Transactions on Systems, Man, and Cybernetics, Part B, Vol. 33, No. 1, 2003, pp. 113-121. https://doi.org/10.1109/TSMCB.2003.808174
  6. Lee, D. E., Oh, H. R., Kauh, J. H., Park, Y. W., and Lee, Y. J., "Improved Ant Colony Optimization Algorithm Design for Weapon-Target Assignment," Proceedings of Symposium of the Korean Institute of Communications and Information Sciences, Vol. 2011, No. 11, 2011, pp. 410-411.
  7. Zeng, X., Zhu, Y., Nan, L., Hu, K., Niu, B., and He, X., "Solving Weapon-Target Assignment Problem using Discrete Particle Swarm Optimization," Intelligent Control and Automation, 2006 6th World Congress on Intelligent Control and Automation, June 2006, pp. 3562-3565.
  8. Hong, S. S., Yoo, J. H., Park, S. J., Mun, C. M., and Han, M. M., "A Suite of Heuristic Algorithms for Weapon-Target Allocation in Air Defense," Journal of Korean Society for Internet Information, Vol. 13, No. 1, 2012, pp. 195-196.
  9. Vielma, J. P., "Mixed Integer Linear Programming Formulation Techniques," SIAM Review, Vol. 57, No. 1, February 2015, pp. 3-57. https://doi.org/10.1137/130915303
  10. Choi, H.-J., Seo, J.-B., and Kim, Y.-D., "Task Assignment of Multiple UAVs using MILP and GA," Journal of the Korean Society for Aeronautical and Space Sciences, Vol. 38, No. 5, 2010, pp. 427-436. https://doi.org/10.5139/JKSAS.2010.38.5.427
  11. Lee, D. R., and Yang, J. H., "A Study on the Allocation and Engagement Scheduling of Air Defense Missiles by Using Mixed Integer Programming," Korean Management Science Review, Vol. 32, No. 4, December 2015, pp. 109-133. https://doi.org/10.7737/KMSR.2015.32.4.109
  12. Lee, D. R., and Yang, J. H., "An Efficient Genetic Algorithm for the Allocation and Engagement Scheduling of Interceptor Missiles," Journal of Society of Korea Industrial and Systems Engineering, Vol. 39, No. 2, June 2016, pp. 88-102. https://doi.org/10.11627/jkise.2016.39.2.088
  13. Feo, T. A., and Resende, M. G. C., "Greedy Randomized Adaptive Search Procedures," Journal of Global Optimization, Vol. 6, 1995, pp. 109-133. https://doi.org/10.1007/BF01096763