High Level Mission Assignment Optimization
Our research deals with Weapon-Target Assignment (WTA) problem which is a combinatorial optimization one that known to be NP-complete. The WTA is an optimization problem focus on setting the best assignment of weapons to targets, to minimizing the total expected value of the surviving targets. In this paper, we compared different methods of Z3 and Simulated Annealing (SA) to solve the WTA problem and suggest a novel algorithm based on Deep Q Networks (DQN) method. The main advantage of the DQN algorithm since we can learn in advance what is the optimal action for every space in short amount of time. Moreover, in real time the actual assignment of weapon can be done in a lot shorter amount of time then in the SA algorithm and the Z3 as can be seen in the results presented in this paper.
Copyright (c) 2020 Oren Gal (Author)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
International Journal of Data Science and Advanced Analytics (IJDSAA) is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. This license allows users to copy, distribute and transmit an article, adapt the article as long as the author is attributed and the article is not used for commercial purposes.
The author(s) confirms
- The manuscript submission has not been previously published, nor is it before another journal for consideration (or an explanation has been provided in Comments to the Editor).
- The published materials used in the manuscript were obtained permission for reproduction. (if any)