A Real-Time Exhaustive Search Algorithm‎ For Weapon-Target Assignment (WTA) Problem‎

Document Type : Article

Authors

1 Aerospace Department, faculty of new sciences and technologies, university of tehran, Tehran, Iran

2 Aerospace Department, Faculty of New Science and Technologies, University of Tehran, Tehran, Iran

3 Aerospace Department, Faculty of New Sciences and Technologies, University of Tehran, Tehran, Iran

Abstract

Weapon-Target Assignment (WTA) as an important part of aerial defense cycle has long been ‎studied. Challenges are usually finding fast-computing methods to search optimal or near-‎optimal solution in cases of a large number of weapons and targets. This viewpoint is more ‎mathematically considerable but practically has limited usage in the mentioned context. A ‎real-time search algorithm is proposed which decomposes the WTA problem and by ‎decreasing the size of solution space and deleting impossible solutions, enables real-time ‎exhaustive search algorithm. Implementation of the algorithm for three typical scenarios shows ‎excellent real-time performance and the possibility of finding exact solutions for large-scale ‎problems.‎

Keywords