A real-time exhaustive search algorithm for the weapon-target assignment problem

被引:0
作者
Feghhi, Naeem [1 ]
Kosari, Amir Reza [1 ]
Amiri Atashgah, Mohammad Ali [1 ]
机构
[1] Faculty of New Sciences and Technologies, Department of Aerospace Engineering, University of Tehran, Tehran, Iran
关键词
Computing methods - Exhaustive search algorithms - Large-scale problem - Near-optimal solutions - Real time performance - Real-time searches - Weapon-target assignment - Weapon-target assignment problem;
D O I
暂无
中图分类号
学科分类号
摘要
Weapon-Target Assignment (WTA) as an important part of the aerial defense cycle has long been studied. Challenges are usually finding fast-computing methods to search for an optimal or near-optimal solution in case of a large number of weapons and targets. This viewpoint gains significance in terms of mathematics; yet, practically, it has limited applicability in the mentioned context. In this paper, a real-time search algorithm was proposed which decomposed the WTA problem and provided a real-time exhaustive search algorithm by decreasing the size of solution space and deleting impossible solutions. Implementation of the algorithm for three typical scenarios exhibited excellent real-time performance and the possibility of finding exact solutions to large-scale problems. © 2021 Sharif University of Technology. All rights reserved.
引用
收藏
页码:1539 / 1551
相关论文
empty
未找到相关数据