Journal of the Korea Institute of Military Science and Technology (한국군사과학기술학회지)

The Korea Institute of Military Science and Technology (한국군사과학기술학회)
권호 표지
DOI QR코드

DOI QR Code

Hierarchical Lazy Greedy Algorithm for Weapon Target Assignment

무기할당을 위한 계층적 레이지 그리디 알고리즘

  • Jeong, Hyesun (The 1st Research and Development Institute, Agency for Defense Development)
  • 정혜선 (국방과학연구소 제1기술연구본부)
  • Received : 2020.03.20
  • Accepted : 2020.07.24
  • Published : 2020.08.05
Download PDF
⟨ Previous Next ⟩

Abstract

Weapon target assignment problem is an essential technology for automating the operator's rapid decision-making support in a battlefield situation. Weapon target assignment problem is a kind of the optimization problem that can build up an objective function by maximizing the number of threat target destructed or maximizing the survival rate of the protected assets. Weapon target assignment problem is known as the NP-Complete, and various studies have been conducted on it. Among them, a greedy heuristic algorithm which guarantees (1-1/e) approximation has been considered a very practical method in order to enhance the applicability of the real weapon system. In this paper, we formulated the weapon target assignment problem for supporting decision-making at the level of artillery. The lazy strategy based on hierarchical structure is proposed to accelerate the greedy algorithm. By experimental results, we show that our algorithm is more efficient in processing time and support the same level of the objective function value with the basic greedy algorithm.

Keywords

References

  1. A. Krause and D. Golovin, "Submodular Function Maximization," Tractabilikty: Practical Approaches to Hard Problems, Vol. 3, p. 19, 2012.
  2. Badanidiyuru, A., and Vondrak, J. "Fast Algorithms for Maximizing Submodular Functions," In SODA, pp. 1497-1514, 2014.
  3. C. D. G. S. Kirkpatrick and M. P. Vecchi, "Optimization by Simulated Annealing," Science, Vol. 220, No. 4598, pp. 671-680, May 1983. https://doi.org/10.1126/science.220.4598.671
  4. D. e. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning," Boston, MA, USA : Addison-Wesley Longman Publishing Co., Inc., 1989.
  5. D. H. Co and H. L. Choi, "Greedy Maximization for Asset-Based Weapon-Target Assignment with Tim-Dependent Reward," Cooperative Control of Multi-Agent Systems Theory and Applications, First Edition, pp. 115-139, 2017.
  6. Edmonds, J., "Matroids and the Greedy Algorithm," Mathematical Programming, 1971.
  7. F. Glover, "Tabu Sesarch - Part i," ORSA Journal on Computing, Vol. 2, No. 3, pp. 190-206, Summer, 1989. https://doi.org/10.1287/ijoc.1.3.190
  8. F. Glover, "Tabu Sesarch - Part ii," ORSA Journal on Computing, Vol. 2, No. 1, pp. 4-32, Winter 1990. https://doi.org/10.1287/ijoc.2.1.4
  9. Fujishige, A., "Submodular Functions and Optimization," Elsevier Science, 2nd edition, 2005.
  10. J. Kennedy and R, Eberhart, "Particle Swarm Optimization," Vol. 4, Neural Networks, Perth, WA: IEEE, pp. 1942-1948, Dec. 1995.
  11. Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A., Vondrak, J. and Krause, A., "Lazier Than Lazy Greedy," In AAAI, 2015.
  12. Minoux, M. "Accelerated Greedy Algorithms for Maximizing Submodular Set Functions," Optimization Techniques, LNCS 234-243, 1978a.
  13. Minoux, M. "Accelerated Greedy Algorithms for Maximizaing Submodular Set Functions," In Proc. of the 8th IFIP Conference on Optimization Techniques. Springer. 1978a.
  14. Nemhauser, G. L., Wolsey, L. A. and Fisher, M. L. "An Analysis of Approximations for Maximizing Submodular Set Functions," - I. Mathematical Programming, 1978.
  15. S. P. Lloyd and H. S. Witsenhausen, "Weapon Allocation is Np-Complete," Summer Computer Simulation Conference, 1986.
  16. V. M. M. Dorigo and A. Colorni, "Ant System: Anautocatalytic Optimizing Process," Dipartimento di Elettronica e Informazione Politecnico di milano, Piazza Leonardo da Vinci 32 20133 Milano, Italy, Tech. Rep., 1991.
  17. Y. L. Zengfu Wang, Xuezhi wang and Q. Pan, "Weapon Target Assignment Leveraging Strong Submodularity," in Proceeding of the IEEE International Conference on Information and Automation, Yinchuan, China, pp. 74-79, August 2013.
  18. Hyesun Jeong, Jieun Kim, Hyeseung Koh and Ohkyun Jeong, "Weapon-Target Assignment Algorithm using Submodular Function Maximization for Multi-Target Engagement," KIMST Annual Conference Proceedings, Vol. 2018, No. Autumn, pp. 881-882, 2018.